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_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:10:09,494 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:10:09,496 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:10:09,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:10:09,508 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:10:09,509 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:10:09,511 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:10:09,512 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:10:09,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:10:09,515 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:10:09,516 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:10:09,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:10:09,517 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:10:09,518 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:10:09,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:10:09,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:10:09,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:10:09,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:10:09,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:10:09,526 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:10:09,527 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:10:09,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:10:09,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:10:09,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:10:09,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:10:09,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:10:09,533 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:10:09,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:10:09,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:10:09,535 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:10:09,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:10:09,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:10:09,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:10:09,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:10:09,538 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:10:09,538 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:10:09,539 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:10:09,539 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:10:09,539 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:10:09,540 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:10:09,541 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:10:09,542 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 13:10:09,556 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:10:09,556 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:10:09,558 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:10:09,558 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:10:09,558 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:10:09,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:10:09,559 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:10:09,559 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:10:09,559 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:10:09,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:10:09,559 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:10:09,559 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:10:09,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:10:09,560 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:10:09,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:10:09,560 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:10:09,560 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:10:09,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:10:09,561 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:10:09,561 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:10:09,561 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:10:09,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:10:09,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:10:09,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:10:09,562 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:10:09,562 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:10:09,562 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:10:09,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:10:09,563 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:10:09,590 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:10:09,603 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:10:09,606 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:10:09,608 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:10:09,608 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:10:09,609 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 13:10:09,676 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3065e29ad/33243cd27b5e44b48b93abce72f008c8/FLAG0e8c88067 [2019-09-08 13:10:10,290 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:10:10,291 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 13:10:10,322 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3065e29ad/33243cd27b5e44b48b93abce72f008c8/FLAG0e8c88067 [2019-09-08 13:10:10,423 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3065e29ad/33243cd27b5e44b48b93abce72f008c8 [2019-09-08 13:10:10,434 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:10:10,436 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:10:10,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:10:10,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:10:10,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:10:10,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:10:10" (1/1) ... [2019-09-08 13:10:10,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fa32137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:10, skipping insertion in model container [2019-09-08 13:10:10,444 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:10:10" (1/1) ... [2019-09-08 13:10:10,452 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:10:10,568 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:10:11,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:10:11,620 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:10:12,010 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:10:12,034 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:10:12,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:12 WrapperNode [2019-09-08 13:10:12,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:10:12,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:10:12,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:10:12,036 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:10:12,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:12" (1/1) ... [2019-09-08 13:10:12,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:12" (1/1) ... [2019-09-08 13:10:12,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:12" (1/1) ... [2019-09-08 13:10:12,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:12" (1/1) ... [2019-09-08 13:10:12,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:12" (1/1) ... [2019-09-08 13:10:12,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:12" (1/1) ... [2019-09-08 13:10:12,183 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:12" (1/1) ... [2019-09-08 13:10:12,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:10:12,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:10:12,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:10:12,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:10:12,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:12" (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 13:10:12,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:10:12,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:10:12,310 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:10:12,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:10:12,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:10:12,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 13:10:12,312 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:10:12,312 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:10:12,315 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:10:12,315 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:10:12,316 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:10:12,316 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:10:12,317 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:10:12,317 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:10:12,318 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:10:12,318 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:10:12,321 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:10:12,322 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:10:12,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:10:12,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:10:15,162 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:10:15,163 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:10:15,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:10:15 BoogieIcfgContainer [2019-09-08 13:10:15,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:10:15,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:10:15,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:10:15,173 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:10:15,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:10:10" (1/3) ... [2019-09-08 13:10:15,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704bf855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:10:15, skipping insertion in model container [2019-09-08 13:10:15,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:12" (2/3) ... [2019-09-08 13:10:15,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704bf855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:10:15, skipping insertion in model container [2019-09-08 13:10:15,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:10:15" (3/3) ... [2019-09-08 13:10:15,183 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-08 13:10:15,197 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:10:15,209 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:10:15,235 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:10:15,283 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:10:15,284 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:10:15,285 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:10:15,285 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:10:15,285 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:10:15,285 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:10:15,286 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:10:15,286 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:10:15,286 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:10:15,326 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states. [2019-09-08 13:10:15,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 13:10:15,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:15,352 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:15,355 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:15,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:15,364 INFO L82 PathProgramCache]: Analyzing trace with hash 539385033, now seen corresponding path program 1 times [2019-09-08 13:10:15,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:15,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:15,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:15,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:15,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:16,438 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 13:10:16,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:16,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:10:16,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:10:16,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:10:16,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:10:16,463 INFO L87 Difference]: Start difference. First operand 796 states. Second operand 3 states. [2019-09-08 13:10:16,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:16,800 INFO L93 Difference]: Finished difference Result 1515 states and 2659 transitions. [2019-09-08 13:10:16,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:10:16,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-08 13:10:16,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:16,830 INFO L225 Difference]: With dead ends: 1515 [2019-09-08 13:10:16,830 INFO L226 Difference]: Without dead ends: 1299 [2019-09-08 13:10:16,836 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 13:10:16,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2019-09-08 13:10:16,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1297. [2019-09-08 13:10:16,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1297 states. [2019-09-08 13:10:16,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 2028 transitions. [2019-09-08 13:10:16,976 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 2028 transitions. Word has length 318 [2019-09-08 13:10:16,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:16,977 INFO L475 AbstractCegarLoop]: Abstraction has 1297 states and 2028 transitions. [2019-09-08 13:10:16,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:10:16,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 2028 transitions. [2019-09-08 13:10:16,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 13:10:16,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:16,984 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:16,984 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:16,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:16,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1328544871, now seen corresponding path program 1 times [2019-09-08 13:10:16,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:16,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:16,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:16,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:16,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:17,448 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 13:10:17,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:17,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:10:17,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:10:17,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:10:17,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:10:17,451 INFO L87 Difference]: Start difference. First operand 1297 states and 2028 transitions. Second operand 3 states. [2019-09-08 13:10:17,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:17,726 INFO L93 Difference]: Finished difference Result 2583 states and 4061 transitions. [2019-09-08 13:10:17,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:10:17,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 318 [2019-09-08 13:10:17,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:17,744 INFO L225 Difference]: With dead ends: 2583 [2019-09-08 13:10:17,745 INFO L226 Difference]: Without dead ends: 2249 [2019-09-08 13:10:17,753 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 13:10:17,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2019-09-08 13:10:17,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2247. [2019-09-08 13:10:17,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2247 states. [2019-09-08 13:10:17,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 2247 states and 3500 transitions. [2019-09-08 13:10:17,860 INFO L78 Accepts]: Start accepts. Automaton has 2247 states and 3500 transitions. Word has length 318 [2019-09-08 13:10:17,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:17,862 INFO L475 AbstractCegarLoop]: Abstraction has 2247 states and 3500 transitions. [2019-09-08 13:10:17,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:10:17,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2247 states and 3500 transitions. [2019-09-08 13:10:17,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-08 13:10:17,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:17,872 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:17,872 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:17,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:17,873 INFO L82 PathProgramCache]: Analyzing trace with hash 183715048, now seen corresponding path program 1 times [2019-09-08 13:10:17,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:17,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:17,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:17,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:17,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:18,852 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 13:10:18,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:18,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:10:18,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:10:18,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:10:18,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:10:18,857 INFO L87 Difference]: Start difference. First operand 2247 states and 3500 transitions. Second operand 4 states. [2019-09-08 13:10:19,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:19,254 INFO L93 Difference]: Finished difference Result 6634 states and 10325 transitions. [2019-09-08 13:10:19,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:10:19,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 318 [2019-09-08 13:10:19,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:19,287 INFO L225 Difference]: With dead ends: 6634 [2019-09-08 13:10:19,289 INFO L226 Difference]: Without dead ends: 4402 [2019-09-08 13:10:19,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 13:10:19,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4402 states. [2019-09-08 13:10:19,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4402 to 4400. [2019-09-08 13:10:19,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4400 states. [2019-09-08 13:10:19,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4400 states to 4400 states and 6814 transitions. [2019-09-08 13:10:19,519 INFO L78 Accepts]: Start accepts. Automaton has 4400 states and 6814 transitions. Word has length 318 [2019-09-08 13:10:19,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:19,520 INFO L475 AbstractCegarLoop]: Abstraction has 4400 states and 6814 transitions. [2019-09-08 13:10:19,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:10:19,520 INFO L276 IsEmpty]: Start isEmpty. Operand 4400 states and 6814 transitions. [2019-09-08 13:10:19,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 13:10:19,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:19,532 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:19,532 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:19,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:19,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1361787525, now seen corresponding path program 1 times [2019-09-08 13:10:19,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:19,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:19,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:19,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:19,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:19,905 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 13:10:19,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:19,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:10:19,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:10:19,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:10:19,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:10:19,908 INFO L87 Difference]: Start difference. First operand 4400 states and 6814 transitions. Second operand 3 states. [2019-09-08 13:10:20,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:20,366 INFO L93 Difference]: Finished difference Result 12899 states and 19930 transitions. [2019-09-08 13:10:20,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:10:20,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-08 13:10:20,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:20,414 INFO L225 Difference]: With dead ends: 12899 [2019-09-08 13:10:20,414 INFO L226 Difference]: Without dead ends: 8628 [2019-09-08 13:10:20,427 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 13:10:20,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8628 states. [2019-09-08 13:10:20,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8628 to 8626. [2019-09-08 13:10:20,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8626 states. [2019-09-08 13:10:20,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8626 states to 8626 states and 13283 transitions. [2019-09-08 13:10:20,793 INFO L78 Accepts]: Start accepts. Automaton has 8626 states and 13283 transitions. Word has length 320 [2019-09-08 13:10:20,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:20,794 INFO L475 AbstractCegarLoop]: Abstraction has 8626 states and 13283 transitions. [2019-09-08 13:10:20,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:10:20,794 INFO L276 IsEmpty]: Start isEmpty. Operand 8626 states and 13283 transitions. [2019-09-08 13:10:20,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-08 13:10:20,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:20,816 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:20,816 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:20,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:20,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1487447872, now seen corresponding path program 1 times [2019-09-08 13:10:20,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:20,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:20,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:20,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:20,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:21,022 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 13:10:21,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:21,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:10:21,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:10:21,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:10:21,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:10:21,024 INFO L87 Difference]: Start difference. First operand 8626 states and 13283 transitions. Second operand 3 states. [2019-09-08 13:10:21,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:21,518 INFO L93 Difference]: Finished difference Result 25803 states and 39725 transitions. [2019-09-08 13:10:21,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:10:21,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-08 13:10:21,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:21,583 INFO L225 Difference]: With dead ends: 25803 [2019-09-08 13:10:21,584 INFO L226 Difference]: Without dead ends: 17219 [2019-09-08 13:10:21,605 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 13:10:21,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17219 states. [2019-09-08 13:10:22,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17219 to 8645. [2019-09-08 13:10:22,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8645 states. [2019-09-08 13:10:22,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8645 states to 8645 states and 13311 transitions. [2019-09-08 13:10:22,105 INFO L78 Accepts]: Start accepts. Automaton has 8645 states and 13311 transitions. Word has length 320 [2019-09-08 13:10:22,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:22,106 INFO L475 AbstractCegarLoop]: Abstraction has 8645 states and 13311 transitions. [2019-09-08 13:10:22,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:10:22,106 INFO L276 IsEmpty]: Start isEmpty. Operand 8645 states and 13311 transitions. [2019-09-08 13:10:22,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-08 13:10:22,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:22,139 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:22,139 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:22,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:22,140 INFO L82 PathProgramCache]: Analyzing trace with hash 415483124, now seen corresponding path program 1 times [2019-09-08 13:10:22,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:22,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:22,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:22,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:22,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:22,947 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 13:10:22,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:22,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:10:22,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:10:22,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:10:22,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:10:22,949 INFO L87 Difference]: Start difference. First operand 8645 states and 13311 transitions. Second operand 3 states. [2019-09-08 13:10:23,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:23,579 INFO L93 Difference]: Finished difference Result 25822 states and 39746 transitions. [2019-09-08 13:10:23,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:10:23,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-09-08 13:10:23,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:23,619 INFO L225 Difference]: With dead ends: 25822 [2019-09-08 13:10:23,619 INFO L226 Difference]: Without dead ends: 17237 [2019-09-08 13:10:23,641 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 13:10:23,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17237 states. [2019-09-08 13:10:24,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17237 to 8663. [2019-09-08 13:10:24,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8663 states. [2019-09-08 13:10:24,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8663 states to 8663 states and 13332 transitions. [2019-09-08 13:10:24,191 INFO L78 Accepts]: Start accepts. Automaton has 8663 states and 13332 transitions. Word has length 321 [2019-09-08 13:10:24,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:24,193 INFO L475 AbstractCegarLoop]: Abstraction has 8663 states and 13332 transitions. [2019-09-08 13:10:24,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:10:24,193 INFO L276 IsEmpty]: Start isEmpty. Operand 8663 states and 13332 transitions. [2019-09-08 13:10:24,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 13:10:24,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:24,212 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:24,213 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:24,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:24,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1540137930, now seen corresponding path program 1 times [2019-09-08 13:10:24,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:24,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:24,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:24,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:24,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:10:24,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:24,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:10:24,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:10:24,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:10:24,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:10:24,487 INFO L87 Difference]: Start difference. First operand 8663 states and 13332 transitions. Second operand 3 states. [2019-09-08 13:10:25,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:25,151 INFO L93 Difference]: Finished difference Result 25310 states and 38853 transitions. [2019-09-08 13:10:25,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:10:25,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-08 13:10:25,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:25,195 INFO L225 Difference]: With dead ends: 25310 [2019-09-08 13:10:25,195 INFO L226 Difference]: Without dead ends: 16892 [2019-09-08 13:10:25,220 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 13:10:25,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16892 states. [2019-09-08 13:10:26,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16892 to 16890. [2019-09-08 13:10:26,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16890 states. [2019-09-08 13:10:26,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16890 states to 16890 states and 25820 transitions. [2019-09-08 13:10:26,078 INFO L78 Accepts]: Start accepts. Automaton has 16890 states and 25820 transitions. Word has length 322 [2019-09-08 13:10:26,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:26,078 INFO L475 AbstractCegarLoop]: Abstraction has 16890 states and 25820 transitions. [2019-09-08 13:10:26,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:10:26,079 INFO L276 IsEmpty]: Start isEmpty. Operand 16890 states and 25820 transitions. [2019-09-08 13:10:26,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-08 13:10:26,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:26,110 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:26,110 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:26,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:26,111 INFO L82 PathProgramCache]: Analyzing trace with hash -301419309, now seen corresponding path program 1 times [2019-09-08 13:10:26,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:26,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:26,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:26,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:26,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:26,452 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 13:10:26,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:26,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:10:26,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:10:26,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:10:26,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:10:26,455 INFO L87 Difference]: Start difference. First operand 16890 states and 25820 transitions. Second operand 4 states. [2019-09-08 13:10:27,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:27,473 INFO L93 Difference]: Finished difference Result 47830 states and 72921 transitions. [2019-09-08 13:10:27,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:10:27,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2019-09-08 13:10:27,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:27,553 INFO L225 Difference]: With dead ends: 47830 [2019-09-08 13:10:27,553 INFO L226 Difference]: Without dead ends: 31480 [2019-09-08 13:10:27,588 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 13:10:27,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31480 states. [2019-09-08 13:10:28,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31480 to 17125. [2019-09-08 13:10:28,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17125 states. [2019-09-08 13:10:28,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17125 states to 17125 states and 26208 transitions. [2019-09-08 13:10:28,473 INFO L78 Accepts]: Start accepts. Automaton has 17125 states and 26208 transitions. Word has length 322 [2019-09-08 13:10:28,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:28,474 INFO L475 AbstractCegarLoop]: Abstraction has 17125 states and 26208 transitions. [2019-09-08 13:10:28,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:10:28,474 INFO L276 IsEmpty]: Start isEmpty. Operand 17125 states and 26208 transitions. [2019-09-08 13:10:28,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 13:10:28,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:28,510 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:28,510 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:28,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:28,511 INFO L82 PathProgramCache]: Analyzing trace with hash -395160752, now seen corresponding path program 1 times [2019-09-08 13:10:28,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:28,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:28,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:28,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:28,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:28,823 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 13:10:28,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:28,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:10:28,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:10:28,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:10:28,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:10:28,825 INFO L87 Difference]: Start difference. First operand 17125 states and 26208 transitions. Second operand 3 states. [2019-09-08 13:10:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:29,588 INFO L93 Difference]: Finished difference Result 42065 states and 64714 transitions. [2019-09-08 13:10:29,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:10:29,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-08 13:10:29,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:29,654 INFO L225 Difference]: With dead ends: 42065 [2019-09-08 13:10:29,654 INFO L226 Difference]: Without dead ends: 26599 [2019-09-08 13:10:29,688 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 13:10:29,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26599 states. [2019-09-08 13:10:31,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26599 to 21189. [2019-09-08 13:10:31,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21189 states. [2019-09-08 13:10:31,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21189 states to 21189 states and 32908 transitions. [2019-09-08 13:10:31,290 INFO L78 Accepts]: Start accepts. Automaton has 21189 states and 32908 transitions. Word has length 324 [2019-09-08 13:10:31,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:31,291 INFO L475 AbstractCegarLoop]: Abstraction has 21189 states and 32908 transitions. [2019-09-08 13:10:31,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:10:31,291 INFO L276 IsEmpty]: Start isEmpty. Operand 21189 states and 32908 transitions. [2019-09-08 13:10:31,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-08 13:10:31,319 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:31,320 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:31,320 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:31,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:31,320 INFO L82 PathProgramCache]: Analyzing trace with hash -54184761, now seen corresponding path program 1 times [2019-09-08 13:10:31,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:31,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:31,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:31,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:31,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:31,458 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 13:10:31,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:31,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:10:31,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:10:31,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:10:31,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:10:31,460 INFO L87 Difference]: Start difference. First operand 21189 states and 32908 transitions. Second operand 3 states. [2019-09-08 13:10:32,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:32,714 INFO L93 Difference]: Finished difference Result 61997 states and 96005 transitions. [2019-09-08 13:10:32,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:10:32,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-08 13:10:32,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:32,800 INFO L225 Difference]: With dead ends: 61997 [2019-09-08 13:10:32,801 INFO L226 Difference]: Without dead ends: 41611 [2019-09-08 13:10:32,829 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 13:10:32,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41611 states. [2019-09-08 13:10:33,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41611 to 21293. [2019-09-08 13:10:33,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21293 states. [2019-09-08 13:10:34,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21293 states to 21293 states and 33051 transitions. [2019-09-08 13:10:34,049 INFO L78 Accepts]: Start accepts. Automaton has 21293 states and 33051 transitions. Word has length 324 [2019-09-08 13:10:34,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:34,049 INFO L475 AbstractCegarLoop]: Abstraction has 21293 states and 33051 transitions. [2019-09-08 13:10:34,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:10:34,050 INFO L276 IsEmpty]: Start isEmpty. Operand 21293 states and 33051 transitions. [2019-09-08 13:10:34,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-09-08 13:10:34,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:34,071 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:34,071 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:34,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:34,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1092389941, now seen corresponding path program 1 times [2019-09-08 13:10:34,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:34,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:34,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:34,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:34,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:34,223 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 13:10:34,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:34,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:10:34,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:10:34,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:10:34,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:10:34,225 INFO L87 Difference]: Start difference. First operand 21293 states and 33051 transitions. Second operand 3 states. [2019-09-08 13:10:35,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:35,449 INFO L93 Difference]: Finished difference Result 62129 states and 96171 transitions. [2019-09-08 13:10:35,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:10:35,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 325 [2019-09-08 13:10:35,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:35,512 INFO L225 Difference]: With dead ends: 62129 [2019-09-08 13:10:35,512 INFO L226 Difference]: Without dead ends: 41736 [2019-09-08 13:10:35,558 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 13:10:35,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41736 states. [2019-09-08 13:10:37,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41736 to 21418. [2019-09-08 13:10:37,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21418 states. [2019-09-08 13:10:37,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21418 states to 21418 states and 33197 transitions. [2019-09-08 13:10:37,437 INFO L78 Accepts]: Start accepts. Automaton has 21418 states and 33197 transitions. Word has length 325 [2019-09-08 13:10:37,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:37,437 INFO L475 AbstractCegarLoop]: Abstraction has 21418 states and 33197 transitions. [2019-09-08 13:10:37,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:10:37,437 INFO L276 IsEmpty]: Start isEmpty. Operand 21418 states and 33197 transitions. [2019-09-08 13:10:37,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 13:10:37,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:37,449 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:37,450 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:37,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:37,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1223465517, now seen corresponding path program 1 times [2019-09-08 13:10:37,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:37,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:37,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:37,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:37,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:37,615 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 13:10:37,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:37,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:10:37,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:10:37,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:10:37,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:10:37,617 INFO L87 Difference]: Start difference. First operand 21418 states and 33197 transitions. Second operand 3 states. [2019-09-08 13:10:39,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:39,106 INFO L93 Difference]: Finished difference Result 52382 states and 81743 transitions. [2019-09-08 13:10:39,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:10:39,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-08 13:10:39,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:39,149 INFO L225 Difference]: With dead ends: 52382 [2019-09-08 13:10:39,150 INFO L226 Difference]: Without dead ends: 33164 [2019-09-08 13:10:39,174 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 13:10:39,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33164 states. [2019-09-08 13:10:40,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33164 to 28682. [2019-09-08 13:10:40,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28682 states. [2019-09-08 13:10:40,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28682 states to 28682 states and 45113 transitions. [2019-09-08 13:10:40,419 INFO L78 Accepts]: Start accepts. Automaton has 28682 states and 45113 transitions. Word has length 326 [2019-09-08 13:10:40,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:40,420 INFO L475 AbstractCegarLoop]: Abstraction has 28682 states and 45113 transitions. [2019-09-08 13:10:40,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:10:40,420 INFO L276 IsEmpty]: Start isEmpty. Operand 28682 states and 45113 transitions. [2019-09-08 13:10:40,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 13:10:40,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:40,432 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:40,433 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:40,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:40,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1016185114, now seen corresponding path program 1 times [2019-09-08 13:10:40,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:40,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:40,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:40,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:40,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:41,037 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 13:10:41,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:41,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:10:41,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:10:41,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:10:41,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:10:41,039 INFO L87 Difference]: Start difference. First operand 28682 states and 45113 transitions. Second operand 4 states. [2019-09-08 13:10:42,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:42,687 INFO L93 Difference]: Finished difference Result 58723 states and 92267 transitions. [2019-09-08 13:10:42,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:10:42,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2019-09-08 13:10:42,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:42,722 INFO L225 Difference]: With dead ends: 58723 [2019-09-08 13:10:42,722 INFO L226 Difference]: Without dead ends: 29568 [2019-09-08 13:10:42,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:10:42,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29568 states. [2019-09-08 13:10:45,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29568 to 29566. [2019-09-08 13:10:45,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29566 states. [2019-09-08 13:10:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29566 states to 29566 states and 46210 transitions. [2019-09-08 13:10:45,058 INFO L78 Accepts]: Start accepts. Automaton has 29566 states and 46210 transitions. Word has length 326 [2019-09-08 13:10:45,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:45,058 INFO L475 AbstractCegarLoop]: Abstraction has 29566 states and 46210 transitions. [2019-09-08 13:10:45,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:10:45,058 INFO L276 IsEmpty]: Start isEmpty. Operand 29566 states and 46210 transitions. [2019-09-08 13:10:45,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 13:10:45,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:45,075 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:45,076 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:45,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:45,076 INFO L82 PathProgramCache]: Analyzing trace with hash -403823476, now seen corresponding path program 1 times [2019-09-08 13:10:45,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:45,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:45,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:45,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:45,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:45,548 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 13:10:45,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:45,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 13:10:45,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 13:10:45,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 13:10:45,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:10:45,551 INFO L87 Difference]: Start difference. First operand 29566 states and 46210 transitions. Second operand 8 states. [2019-09-08 13:10:56,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:56,303 INFO L93 Difference]: Finished difference Result 148830 states and 235440 transitions. [2019-09-08 13:10:56,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 13:10:56,304 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 327 [2019-09-08 13:10:56,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:56,472 INFO L225 Difference]: With dead ends: 148830 [2019-09-08 13:10:56,472 INFO L226 Difference]: Without dead ends: 132124 [2019-09-08 13:10:56,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2019-09-08 13:10:56,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132124 states. [2019-09-08 13:11:00,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132124 to 73270. [2019-09-08 13:11:00,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73270 states. [2019-09-08 13:11:00,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73270 states to 73270 states and 114042 transitions. [2019-09-08 13:11:00,804 INFO L78 Accepts]: Start accepts. Automaton has 73270 states and 114042 transitions. Word has length 327 [2019-09-08 13:11:00,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:11:00,804 INFO L475 AbstractCegarLoop]: Abstraction has 73270 states and 114042 transitions. [2019-09-08 13:11:00,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 13:11:00,805 INFO L276 IsEmpty]: Start isEmpty. Operand 73270 states and 114042 transitions. [2019-09-08 13:11:00,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 13:11:00,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:11:00,842 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:11:00,842 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:11:00,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:11:00,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1533969227, now seen corresponding path program 1 times [2019-09-08 13:11:00,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:11:00,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:11:00,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:00,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:11:00,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:11:01,346 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 13:11:01,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:11:01,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 13:11:01,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 13:11:01,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 13:11:01,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 13:11:01,347 INFO L87 Difference]: Start difference. First operand 73270 states and 114042 transitions. Second operand 10 states. [2019-09-08 13:11:14,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:11:14,553 INFO L93 Difference]: Finished difference Result 227104 states and 356365 transitions. [2019-09-08 13:11:14,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 13:11:14,554 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 327 [2019-09-08 13:11:14,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:11:14,744 INFO L225 Difference]: With dead ends: 227104 [2019-09-08 13:11:14,744 INFO L226 Difference]: Without dead ends: 160500 [2019-09-08 13:11:14,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-09-08 13:11:14,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160500 states. [2019-09-08 13:11:21,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160500 to 112016. [2019-09-08 13:11:21,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112016 states. [2019-09-08 13:11:25,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112016 states to 112016 states and 173518 transitions. [2019-09-08 13:11:25,010 INFO L78 Accepts]: Start accepts. Automaton has 112016 states and 173518 transitions. Word has length 327 [2019-09-08 13:11:25,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:11:25,010 INFO L475 AbstractCegarLoop]: Abstraction has 112016 states and 173518 transitions. [2019-09-08 13:11:25,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 13:11:25,010 INFO L276 IsEmpty]: Start isEmpty. Operand 112016 states and 173518 transitions. [2019-09-08 13:11:25,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 13:11:25,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:11:25,039 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:11:25,040 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:11:25,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:11:25,040 INFO L82 PathProgramCache]: Analyzing trace with hash -397615245, now seen corresponding path program 1 times [2019-09-08 13:11:25,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:11:25,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:11:25,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:25,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:11:25,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:11:25,403 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 13:11:25,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:11:25,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:11:25,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:11:25,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:11:25,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:11:25,407 INFO L87 Difference]: Start difference. First operand 112016 states and 173518 transitions. Second operand 4 states. [2019-09-08 13:11:33,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:11:33,593 INFO L93 Difference]: Finished difference Result 207988 states and 327980 transitions. [2019-09-08 13:11:33,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:11:33,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 327 [2019-09-08 13:11:33,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:11:33,757 INFO L225 Difference]: With dead ends: 207988 [2019-09-08 13:11:33,757 INFO L226 Difference]: Without dead ends: 134002 [2019-09-08 13:11:33,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:11:33,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134002 states. [2019-09-08 13:11:40,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134002 to 86608. [2019-09-08 13:11:40,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86608 states. [2019-09-08 13:11:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86608 states to 86608 states and 135050 transitions. [2019-09-08 13:11:40,226 INFO L78 Accepts]: Start accepts. Automaton has 86608 states and 135050 transitions. Word has length 327 [2019-09-08 13:11:40,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:11:40,227 INFO L475 AbstractCegarLoop]: Abstraction has 86608 states and 135050 transitions. [2019-09-08 13:11:40,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:11:40,227 INFO L276 IsEmpty]: Start isEmpty. Operand 86608 states and 135050 transitions. [2019-09-08 13:11:40,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-08 13:11:40,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:11:40,251 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:11:40,251 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:11:40,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:11:40,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1527760996, now seen corresponding path program 1 times [2019-09-08 13:11:40,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:11:40,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:11:40,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:40,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:11:40,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:11:40,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:11:40,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:11:40,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:11:40,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:11:40,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:11:40,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:11:40,722 INFO L87 Difference]: Start difference. First operand 86608 states and 135050 transitions. Second operand 4 states. [2019-09-08 13:11:53,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:11:53,157 INFO L93 Difference]: Finished difference Result 255709 states and 398590 transitions. [2019-09-08 13:11:53,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:11:53,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 327 [2019-09-08 13:11:53,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:11:53,364 INFO L225 Difference]: With dead ends: 255709 [2019-09-08 13:11:53,365 INFO L226 Difference]: Without dead ends: 169423 [2019-09-08 13:11:53,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 13:11:53,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169423 states. [2019-09-08 13:12:07,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169423 to 169421. [2019-09-08 13:12:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169421 states. [2019-09-08 13:12:08,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169421 states to 169421 states and 262905 transitions. [2019-09-08 13:12:08,130 INFO L78 Accepts]: Start accepts. Automaton has 169421 states and 262905 transitions. Word has length 327 [2019-09-08 13:12:08,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:12:08,130 INFO L475 AbstractCegarLoop]: Abstraction has 169421 states and 262905 transitions. [2019-09-08 13:12:08,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:12:08,130 INFO L276 IsEmpty]: Start isEmpty. Operand 169421 states and 262905 transitions. [2019-09-08 13:12:08,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 13:12:08,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:12:08,174 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:08,174 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:12:08,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:12:08,174 INFO L82 PathProgramCache]: Analyzing trace with hash -49446034, now seen corresponding path program 1 times [2019-09-08 13:12:08,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:12:08,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:12:08,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:12:08,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:12:08,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:12:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:12:08,448 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 13:12:08,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:12:08,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:12:08,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:12:08,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:12:08,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:12:08,450 INFO L87 Difference]: Start difference. First operand 169421 states and 262905 transitions. Second operand 4 states. [2019-09-08 13:12:34,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:12:34,773 INFO L93 Difference]: Finished difference Result 505609 states and 784493 transitions. [2019-09-08 13:12:34,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:12:34,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2019-09-08 13:12:34,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:12:35,240 INFO L225 Difference]: With dead ends: 505609 [2019-09-08 13:12:35,241 INFO L226 Difference]: Without dead ends: 338240 [2019-09-08 13:12:35,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 13:12:35,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338240 states. [2019-09-08 13:12:54,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338240 to 170450. [2019-09-08 13:12:54,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170450 states. [2019-09-08 13:12:55,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170450 states to 170450 states and 264629 transitions. [2019-09-08 13:12:55,054 INFO L78 Accepts]: Start accepts. Automaton has 170450 states and 264629 transitions. Word has length 328 [2019-09-08 13:12:55,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:12:55,054 INFO L475 AbstractCegarLoop]: Abstraction has 170450 states and 264629 transitions. [2019-09-08 13:12:55,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:12:55,054 INFO L276 IsEmpty]: Start isEmpty. Operand 170450 states and 264629 transitions. [2019-09-08 13:12:55,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 13:12:55,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:12:55,107 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:55,107 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:12:55,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:12:55,108 INFO L82 PathProgramCache]: Analyzing trace with hash -963849709, now seen corresponding path program 1 times [2019-09-08 13:12:55,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:12:55,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:12:55,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:12:55,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:12:55,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:12:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:12:55,719 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 13:12:55,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:12:55,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:12:55,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:12:55,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:12:55,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:12:55,724 INFO L87 Difference]: Start difference. First operand 170450 states and 264629 transitions. Second operand 3 states. [2019-09-08 13:13:23,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:13:23,062 INFO L93 Difference]: Finished difference Result 501111 states and 776901 transitions. [2019-09-08 13:13:23,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:13:23,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-09-08 13:13:23,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:13:23,512 INFO L225 Difference]: With dead ends: 501111 [2019-09-08 13:13:23,512 INFO L226 Difference]: Without dead ends: 332500 [2019-09-08 13:13:23,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:13:23,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332500 states. [2019-09-08 13:13:59,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332500 to 332498. [2019-09-08 13:13:59,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332498 states. [2019-09-08 13:13:59,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332498 states to 332498 states and 513104 transitions. [2019-09-08 13:13:59,963 INFO L78 Accepts]: Start accepts. Automaton has 332498 states and 513104 transitions. Word has length 328 [2019-09-08 13:13:59,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:13:59,964 INFO L475 AbstractCegarLoop]: Abstraction has 332498 states and 513104 transitions. [2019-09-08 13:13:59,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:13:59,964 INFO L276 IsEmpty]: Start isEmpty. Operand 332498 states and 513104 transitions. [2019-09-08 13:14:00,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-08 13:14:00,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:14:00,650 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:14:00,650 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:14:00,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:14:00,650 INFO L82 PathProgramCache]: Analyzing trace with hash 590275532, now seen corresponding path program 1 times [2019-09-08 13:14:00,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:14:00,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:14:00,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:00,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:14:00,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:00,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 13:14:00,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:14:00,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:14:00,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:14:00,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:14:00,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:14:00,884 INFO L87 Difference]: Start difference. First operand 332498 states and 513104 transitions. Second operand 3 states. [2019-09-08 13:15:04,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:04,618 INFO L93 Difference]: Finished difference Result 976290 states and 1506379 transitions. [2019-09-08 13:15:04,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:15:04,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 329 [2019-09-08 13:15:04,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:05,535 INFO L225 Difference]: With dead ends: 976290 [2019-09-08 13:15:05,536 INFO L226 Difference]: Without dead ends: 648817 [2019-09-08 13:15:05,767 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 13:15:06,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648817 states. [2019-09-08 13:16:18,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648817 to 648815. [2019-09-08 13:16:18,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648815 states. [2019-09-08 13:16:19,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648815 states to 648815 states and 997329 transitions. [2019-09-08 13:16:19,233 INFO L78 Accepts]: Start accepts. Automaton has 648815 states and 997329 transitions. Word has length 329 [2019-09-08 13:16:19,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:16:19,233 INFO L475 AbstractCegarLoop]: Abstraction has 648815 states and 997329 transitions. [2019-09-08 13:16:19,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:16:19,234 INFO L276 IsEmpty]: Start isEmpty. Operand 648815 states and 997329 transitions. [2019-09-08 13:16:19,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 13:16:19,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:16:19,421 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:16:19,421 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:16:19,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:16:19,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1260398662, now seen corresponding path program 1 times [2019-09-08 13:16:19,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:16:19,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:16:19,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:19,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:16:19,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:16:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:16:20,626 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 13:16:20,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:16:20,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:16:20,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:16:20,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:16:20,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:16:20,628 INFO L87 Difference]: Start difference. First operand 648815 states and 997329 transitions. Second operand 4 states. [2019-09-08 13:18:31,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:31,305 INFO L93 Difference]: Finished difference Result 1918613 states and 2950538 transitions. [2019-09-08 13:18:31,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:18:31,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 330 [2019-09-08 13:18:31,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:33,315 INFO L225 Difference]: With dead ends: 1918613 [2019-09-08 13:18:33,316 INFO L226 Difference]: Without dead ends: 1270200 [2019-09-08 13:18:33,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 13:18:34,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270200 states.