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_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:40:06,500 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:40:06,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:40:06,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:40:06,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:40:06,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:40:06,517 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:40:06,519 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:40:06,521 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:40:06,522 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:40:06,523 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:40:06,524 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:40:06,524 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:40:06,525 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:40:06,526 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:40:06,527 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:40:06,528 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:40:06,529 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:40:06,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:40:06,537 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:40:06,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:40:06,543 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:40:06,545 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:40:06,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:40:06,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:40:06,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:40:06,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:40:06,550 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:40:06,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:40:06,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:40:06,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:40:06,556 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:40:06,557 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:40:06,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:40:06,561 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:40:06,561 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:40:06,562 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:40:06,562 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:40:06,562 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:40:06,563 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:40:06,564 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:40:06,565 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 09:40:06,590 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:40:06,590 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:40:06,593 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:40:06,593 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:40:06,593 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:40:06,593 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:40:06,593 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:40:06,594 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:40:06,594 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:40:06,594 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:40:06,595 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:40:06,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:40:06,596 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:40:06,596 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:40:06,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:40:06,597 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:40:06,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:40:06,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:40:06,597 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:40:06,598 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:40:06,598 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:40:06,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:40:06,598 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:40:06,598 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:40:06,599 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:40:06,599 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:40:06,599 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:40:06,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:40:06,599 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:40:06,649 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:40:06,668 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:40:06,673 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:40:06,675 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:40:06,675 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:40:06,676 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 09:40:06,751 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b769e37a/fb9c4279a1b04137888337d21199b996/FLAG99bb4870b [2019-09-08 09:40:07,333 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:40:07,335 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 09:40:07,350 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b769e37a/fb9c4279a1b04137888337d21199b996/FLAG99bb4870b [2019-09-08 09:40:07,669 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b769e37a/fb9c4279a1b04137888337d21199b996 [2019-09-08 09:40:07,679 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:40:07,680 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:40:07,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:40:07,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:40:07,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:40:07,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:40:07" (1/1) ... [2019-09-08 09:40:07,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@164487eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:07, skipping insertion in model container [2019-09-08 09:40:07,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:40:07" (1/1) ... [2019-09-08 09:40:07,697 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:40:07,769 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:40:08,235 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:40:08,264 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:40:08,428 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:40:08,458 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:40:08,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:08 WrapperNode [2019-09-08 09:40:08,458 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:40:08,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:40:08,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:40:08,459 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:40:08,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:08" (1/1) ... [2019-09-08 09:40:08,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:08" (1/1) ... [2019-09-08 09:40:08,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:08" (1/1) ... [2019-09-08 09:40:08,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:08" (1/1) ... [2019-09-08 09:40:08,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:08" (1/1) ... [2019-09-08 09:40:08,529 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:08" (1/1) ... [2019-09-08 09:40:08,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:08" (1/1) ... [2019-09-08 09:40:08,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:40:08,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:40:08,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:40:08,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:40:08,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:08" (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 09:40:08,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:40:08,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:40:08,620 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:40:08,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:40:08,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:40:08,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:40:08,621 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:40:08,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:40:08,622 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:40:08,622 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:40:08,622 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:40:08,622 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:40:08,623 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:40:08,623 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 09:40:08,623 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:40:08,623 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:40:08,623 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:40:08,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:40:08,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:40:10,130 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:40:10,131 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:40:10,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:40:10 BoogieIcfgContainer [2019-09-08 09:40:10,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:40:10,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:40:10,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:40:10,138 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:40:10,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:40:07" (1/3) ... [2019-09-08 09:40:10,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446b5141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:40:10, skipping insertion in model container [2019-09-08 09:40:10,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:40:08" (2/3) ... [2019-09-08 09:40:10,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446b5141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:40:10, skipping insertion in model container [2019-09-08 09:40:10,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:40:10" (3/3) ... [2019-09-08 09:40:10,148 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.1.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 09:40:10,159 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:40:10,170 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 09:40:10,189 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 09:40:10,225 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:40:10,226 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:40:10,226 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:40:10,226 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:40:10,226 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:40:10,227 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:40:10,227 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:40:10,227 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:40:10,227 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:40:10,254 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states. [2019-09-08 09:40:10,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 09:40:10,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:10,271 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] [2019-09-08 09:40:10,273 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:10,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:10,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1302901501, now seen corresponding path program 1 times [2019-09-08 09:40:10,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:10,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:10,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:10,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:10,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:10,861 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 09:40:10,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:10,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:10,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:10,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:10,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:10,886 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 3 states. [2019-09-08 09:40:11,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:11,073 INFO L93 Difference]: Finished difference Result 563 states and 974 transitions. [2019-09-08 09:40:11,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:11,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-09-08 09:40:11,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:11,105 INFO L225 Difference]: With dead ends: 563 [2019-09-08 09:40:11,105 INFO L226 Difference]: Without dead ends: 424 [2019-09-08 09:40:11,110 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 09:40:11,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-09-08 09:40:11,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 422. [2019-09-08 09:40:11,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-09-08 09:40:11,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 706 transitions. [2019-09-08 09:40:11,244 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 706 transitions. Word has length 103 [2019-09-08 09:40:11,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:11,247 INFO L475 AbstractCegarLoop]: Abstraction has 422 states and 706 transitions. [2019-09-08 09:40:11,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:11,248 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 706 transitions. [2019-09-08 09:40:11,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 09:40:11,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:11,261 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:40:11,261 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:11,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:11,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1878169074, now seen corresponding path program 1 times [2019-09-08 09:40:11,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:11,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:11,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:11,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:11,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:11,536 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 09:40:11,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:11,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:11,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:11,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:11,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:11,539 INFO L87 Difference]: Start difference. First operand 422 states and 706 transitions. Second operand 3 states. [2019-09-08 09:40:11,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:11,615 INFO L93 Difference]: Finished difference Result 886 states and 1482 transitions. [2019-09-08 09:40:11,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:11,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-08 09:40:11,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:11,621 INFO L225 Difference]: With dead ends: 886 [2019-09-08 09:40:11,621 INFO L226 Difference]: Without dead ends: 645 [2019-09-08 09:40:11,624 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 09:40:11,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2019-09-08 09:40:11,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 643. [2019-09-08 09:40:11,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-09-08 09:40:11,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1074 transitions. [2019-09-08 09:40:11,665 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1074 transitions. Word has length 106 [2019-09-08 09:40:11,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:11,666 INFO L475 AbstractCegarLoop]: Abstraction has 643 states and 1074 transitions. [2019-09-08 09:40:11,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:11,666 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1074 transitions. [2019-09-08 09:40:11,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 09:40:11,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:11,669 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] [2019-09-08 09:40:11,669 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:11,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:11,670 INFO L82 PathProgramCache]: Analyzing trace with hash -769887869, now seen corresponding path program 1 times [2019-09-08 09:40:11,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:11,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:11,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:11,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:11,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:11,774 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 09:40:11,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:11,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:11,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:11,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:11,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:11,776 INFO L87 Difference]: Start difference. First operand 643 states and 1074 transitions. Second operand 3 states. [2019-09-08 09:40:11,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:11,837 INFO L93 Difference]: Finished difference Result 1531 states and 2552 transitions. [2019-09-08 09:40:11,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:11,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-08 09:40:11,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:11,844 INFO L225 Difference]: With dead ends: 1531 [2019-09-08 09:40:11,845 INFO L226 Difference]: Without dead ends: 1069 [2019-09-08 09:40:11,847 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 09:40:11,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2019-09-08 09:40:11,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1067. [2019-09-08 09:40:11,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1067 states. [2019-09-08 09:40:11,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1774 transitions. [2019-09-08 09:40:11,894 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1774 transitions. Word has length 109 [2019-09-08 09:40:11,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:11,895 INFO L475 AbstractCegarLoop]: Abstraction has 1067 states and 1774 transitions. [2019-09-08 09:40:11,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:11,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1774 transitions. [2019-09-08 09:40:11,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 09:40:11,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:11,898 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] [2019-09-08 09:40:11,898 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:11,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:11,898 INFO L82 PathProgramCache]: Analyzing trace with hash 491698056, now seen corresponding path program 1 times [2019-09-08 09:40:11,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:11,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:11,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:11,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:11,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:12,000 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 09:40:12,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:12,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:12,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:12,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:12,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:12,002 INFO L87 Difference]: Start difference. First operand 1067 states and 1774 transitions. Second operand 3 states. [2019-09-08 09:40:12,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:12,105 INFO L93 Difference]: Finished difference Result 2767 states and 4584 transitions. [2019-09-08 09:40:12,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:12,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-09-08 09:40:12,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:12,119 INFO L225 Difference]: With dead ends: 2767 [2019-09-08 09:40:12,119 INFO L226 Difference]: Without dead ends: 1881 [2019-09-08 09:40:12,123 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 09:40:12,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2019-09-08 09:40:12,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1879. [2019-09-08 09:40:12,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1879 states. [2019-09-08 09:40:12,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1879 states to 1879 states and 3102 transitions. [2019-09-08 09:40:12,237 INFO L78 Accepts]: Start accepts. Automaton has 1879 states and 3102 transitions. Word has length 112 [2019-09-08 09:40:12,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:12,238 INFO L475 AbstractCegarLoop]: Abstraction has 1879 states and 3102 transitions. [2019-09-08 09:40:12,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:12,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1879 states and 3102 transitions. [2019-09-08 09:40:12,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 09:40:12,240 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:12,241 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] [2019-09-08 09:40:12,241 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:12,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:12,241 INFO L82 PathProgramCache]: Analyzing trace with hash -2126778359, now seen corresponding path program 1 times [2019-09-08 09:40:12,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:12,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:12,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:12,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:12,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:12,475 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 09:40:12,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:12,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:40:12,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:40:12,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:40:12,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:40:12,477 INFO L87 Difference]: Start difference. First operand 1879 states and 3102 transitions. Second operand 6 states. [2019-09-08 09:40:13,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:13,283 INFO L93 Difference]: Finished difference Result 9602 states and 15958 transitions. [2019-09-08 09:40:13,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 09:40:13,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-09-08 09:40:13,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:13,327 INFO L225 Difference]: With dead ends: 9602 [2019-09-08 09:40:13,328 INFO L226 Difference]: Without dead ends: 7904 [2019-09-08 09:40:13,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-09-08 09:40:13,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7904 states. [2019-09-08 09:40:13,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7904 to 3488. [2019-09-08 09:40:13,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3488 states. [2019-09-08 09:40:13,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 3488 states and 5743 transitions. [2019-09-08 09:40:13,638 INFO L78 Accepts]: Start accepts. Automaton has 3488 states and 5743 transitions. Word has length 115 [2019-09-08 09:40:13,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:13,638 INFO L475 AbstractCegarLoop]: Abstraction has 3488 states and 5743 transitions. [2019-09-08 09:40:13,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:40:13,639 INFO L276 IsEmpty]: Start isEmpty. Operand 3488 states and 5743 transitions. [2019-09-08 09:40:13,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 09:40:13,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:13,646 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:40:13,646 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:13,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:13,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1571788028, now seen corresponding path program 1 times [2019-09-08 09:40:13,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:13,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:13,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:13,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:13,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:13,922 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 09:40:13,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:13,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:40:13,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:40:13,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:40:13,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:40:13,924 INFO L87 Difference]: Start difference. First operand 3488 states and 5743 transitions. Second operand 4 states. [2019-09-08 09:40:14,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:14,419 INFO L93 Difference]: Finished difference Result 9377 states and 15522 transitions. [2019-09-08 09:40:14,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:40:14,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-08 09:40:14,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:14,452 INFO L225 Difference]: With dead ends: 9377 [2019-09-08 09:40:14,452 INFO L226 Difference]: Without dead ends: 6070 [2019-09-08 09:40:14,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 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 09:40:14,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6070 states. [2019-09-08 09:40:14,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6070 to 5159. [2019-09-08 09:40:14,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5159 states. [2019-09-08 09:40:14,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5159 states to 5159 states and 8514 transitions. [2019-09-08 09:40:14,850 INFO L78 Accepts]: Start accepts. Automaton has 5159 states and 8514 transitions. Word has length 116 [2019-09-08 09:40:14,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:14,850 INFO L475 AbstractCegarLoop]: Abstraction has 5159 states and 8514 transitions. [2019-09-08 09:40:14,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:40:14,851 INFO L276 IsEmpty]: Start isEmpty. Operand 5159 states and 8514 transitions. [2019-09-08 09:40:14,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 09:40:14,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:14,856 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:40:14,857 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:14,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:14,857 INFO L82 PathProgramCache]: Analyzing trace with hash -190610616, now seen corresponding path program 1 times [2019-09-08 09:40:14,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:14,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:14,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:14,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:14,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:15,017 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 09:40:15,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:15,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:15,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:15,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:15,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:15,020 INFO L87 Difference]: Start difference. First operand 5159 states and 8514 transitions. Second operand 3 states. [2019-09-08 09:40:15,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:15,576 INFO L93 Difference]: Finished difference Result 10349 states and 17122 transitions. [2019-09-08 09:40:15,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:15,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-08 09:40:15,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:15,614 INFO L225 Difference]: With dead ends: 10349 [2019-09-08 09:40:15,614 INFO L226 Difference]: Without dead ends: 7659 [2019-09-08 09:40:15,620 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 09:40:15,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7659 states. [2019-09-08 09:40:16,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7659 to 7657. [2019-09-08 09:40:16,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7657 states. [2019-09-08 09:40:16,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7657 states to 7657 states and 12606 transitions. [2019-09-08 09:40:16,055 INFO L78 Accepts]: Start accepts. Automaton has 7657 states and 12606 transitions. Word has length 116 [2019-09-08 09:40:16,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:16,055 INFO L475 AbstractCegarLoop]: Abstraction has 7657 states and 12606 transitions. [2019-09-08 09:40:16,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:16,056 INFO L276 IsEmpty]: Start isEmpty. Operand 7657 states and 12606 transitions. [2019-09-08 09:40:16,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 09:40:16,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:16,063 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:40:16,063 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:16,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:16,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1210538184, now seen corresponding path program 1 times [2019-09-08 09:40:16,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:16,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:16,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:16,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:16,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:16,162 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 09:40:16,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:16,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:16,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:16,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:16,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:16,165 INFO L87 Difference]: Start difference. First operand 7657 states and 12606 transitions. Second operand 3 states. [2019-09-08 09:40:16,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:16,654 INFO L93 Difference]: Finished difference Result 14273 states and 23564 transitions. [2019-09-08 09:40:16,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:16,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-08 09:40:16,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:16,680 INFO L225 Difference]: With dead ends: 14273 [2019-09-08 09:40:16,680 INFO L226 Difference]: Without dead ends: 10393 [2019-09-08 09:40:16,691 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 09:40:16,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10393 states. [2019-09-08 09:40:17,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10393 to 10391. [2019-09-08 09:40:17,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10391 states. [2019-09-08 09:40:17,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10391 states to 10391 states and 17062 transitions. [2019-09-08 09:40:17,286 INFO L78 Accepts]: Start accepts. Automaton has 10391 states and 17062 transitions. Word has length 116 [2019-09-08 09:40:17,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:17,287 INFO L475 AbstractCegarLoop]: Abstraction has 10391 states and 17062 transitions. [2019-09-08 09:40:17,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:17,287 INFO L276 IsEmpty]: Start isEmpty. Operand 10391 states and 17062 transitions. [2019-09-08 09:40:17,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 09:40:17,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:17,290 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:17,290 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:17,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:17,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1227020200, now seen corresponding path program 1 times [2019-09-08 09:40:17,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:17,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:17,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:17,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:17,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:17,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:40:17,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:17,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:17,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:17,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:17,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:17,375 INFO L87 Difference]: Start difference. First operand 10391 states and 17062 transitions. Second operand 3 states. [2019-09-08 09:40:18,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:18,600 INFO L93 Difference]: Finished difference Result 19539 states and 32202 transitions. [2019-09-08 09:40:18,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:18,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-08 09:40:18,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:18,630 INFO L225 Difference]: With dead ends: 19539 [2019-09-08 09:40:18,631 INFO L226 Difference]: Without dead ends: 14111 [2019-09-08 09:40:18,643 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 09:40:18,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14111 states. [2019-09-08 09:40:19,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14111 to 14109. [2019-09-08 09:40:19,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14109 states. [2019-09-08 09:40:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14109 states to 14109 states and 23147 transitions. [2019-09-08 09:40:19,323 INFO L78 Accepts]: Start accepts. Automaton has 14109 states and 23147 transitions. Word has length 116 [2019-09-08 09:40:19,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:19,323 INFO L475 AbstractCegarLoop]: Abstraction has 14109 states and 23147 transitions. [2019-09-08 09:40:19,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:19,324 INFO L276 IsEmpty]: Start isEmpty. Operand 14109 states and 23147 transitions. [2019-09-08 09:40:19,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 09:40:19,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:19,326 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:40:19,326 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:19,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:19,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1410050920, now seen corresponding path program 1 times [2019-09-08 09:40:19,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:19,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:19,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:19,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:19,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:19,428 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 09:40:19,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:19,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:40:19,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:40:19,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:40:19,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:40:19,430 INFO L87 Difference]: Start difference. First operand 14109 states and 23147 transitions. Second operand 3 states. [2019-09-08 09:40:20,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:20,103 INFO L93 Difference]: Finished difference Result 30522 states and 50523 transitions. [2019-09-08 09:40:20,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:40:20,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-08 09:40:20,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:20,156 INFO L225 Difference]: With dead ends: 30522 [2019-09-08 09:40:20,156 INFO L226 Difference]: Without dead ends: 20829 [2019-09-08 09:40:20,181 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 09:40:20,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20829 states. [2019-09-08 09:40:20,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20829 to 20827. [2019-09-08 09:40:20,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20827 states. [2019-09-08 09:40:21,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20827 states to 20827 states and 34241 transitions. [2019-09-08 09:40:21,011 INFO L78 Accepts]: Start accepts. Automaton has 20827 states and 34241 transitions. Word has length 116 [2019-09-08 09:40:21,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:21,011 INFO L475 AbstractCegarLoop]: Abstraction has 20827 states and 34241 transitions. [2019-09-08 09:40:21,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:40:21,012 INFO L276 IsEmpty]: Start isEmpty. Operand 20827 states and 34241 transitions. [2019-09-08 09:40:21,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 09:40:21,013 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:21,013 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] [2019-09-08 09:40:21,014 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:21,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:21,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1542398928, now seen corresponding path program 1 times [2019-09-08 09:40:21,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:21,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:21,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:21,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:21,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:21,109 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 09:40:21,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:21,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:40:21,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:40:21,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:40:21,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:40:21,110 INFO L87 Difference]: Start difference. First operand 20827 states and 34241 transitions. Second operand 4 states. [2019-09-08 09:40:23,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:23,278 INFO L93 Difference]: Finished difference Result 60929 states and 100465 transitions. [2019-09-08 09:40:23,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:40:23,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-09-08 09:40:23,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:23,344 INFO L225 Difference]: With dead ends: 60929 [2019-09-08 09:40:23,344 INFO L226 Difference]: Without dead ends: 40339 [2019-09-08 09:40:23,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 09:40:23,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40339 states. [2019-09-08 09:40:24,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40339 to 33908. [2019-09-08 09:40:24,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33908 states. [2019-09-08 09:40:24,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33908 states to 33908 states and 55591 transitions. [2019-09-08 09:40:24,654 INFO L78 Accepts]: Start accepts. Automaton has 33908 states and 55591 transitions. Word has length 117 [2019-09-08 09:40:24,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:24,655 INFO L475 AbstractCegarLoop]: Abstraction has 33908 states and 55591 transitions. [2019-09-08 09:40:24,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:40:24,655 INFO L276 IsEmpty]: Start isEmpty. Operand 33908 states and 55591 transitions. [2019-09-08 09:40:24,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 09:40:24,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:24,657 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:40:24,657 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:24,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:24,658 INFO L82 PathProgramCache]: Analyzing trace with hash -626778805, now seen corresponding path program 1 times [2019-09-08 09:40:24,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:24,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:24,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:24,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:24,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:24,747 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 09:40:24,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:24,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:40:24,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:40:24,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:40:24,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:40:24,749 INFO L87 Difference]: Start difference. First operand 33908 states and 55591 transitions. Second operand 4 states. [2019-09-08 09:40:26,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:26,893 INFO L93 Difference]: Finished difference Result 98573 states and 162091 transitions. [2019-09-08 09:40:26,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:40:26,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-09-08 09:40:26,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:26,997 INFO L225 Difference]: With dead ends: 98573 [2019-09-08 09:40:26,998 INFO L226 Difference]: Without dead ends: 64902 [2019-09-08 09:40:27,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 09:40:27,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64902 states. [2019-09-08 09:40:30,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64902 to 54897. [2019-09-08 09:40:30,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54897 states. [2019-09-08 09:40:30,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54897 states to 54897 states and 89749 transitions. [2019-09-08 09:40:30,176 INFO L78 Accepts]: Start accepts. Automaton has 54897 states and 89749 transitions. Word has length 118 [2019-09-08 09:40:30,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:30,176 INFO L475 AbstractCegarLoop]: Abstraction has 54897 states and 89749 transitions. [2019-09-08 09:40:30,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:40:30,176 INFO L276 IsEmpty]: Start isEmpty. Operand 54897 states and 89749 transitions. [2019-09-08 09:40:30,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 09:40:30,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:30,178 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] [2019-09-08 09:40:30,179 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:30,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:30,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1992199255, now seen corresponding path program 1 times [2019-09-08 09:40:30,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:30,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:30,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:30,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:30,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:30,321 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 09:40:30,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:30,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 09:40:30,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 09:40:30,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 09:40:30,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:40:30,323 INFO L87 Difference]: Start difference. First operand 54897 states and 89749 transitions. Second operand 7 states. [2019-09-08 09:40:40,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:40,074 INFO L93 Difference]: Finished difference Result 266900 states and 437669 transitions. [2019-09-08 09:40:40,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 09:40:40,074 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2019-09-08 09:40:40,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:40,375 INFO L225 Difference]: With dead ends: 266900 [2019-09-08 09:40:40,375 INFO L226 Difference]: Without dead ends: 212240 [2019-09-08 09:40:40,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-08 09:40:40,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212240 states. [2019-09-08 09:40:49,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212240 to 148480. [2019-09-08 09:40:49,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148480 states. [2019-09-08 09:40:50,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148480 states to 148480 states and 241042 transitions. [2019-09-08 09:40:50,069 INFO L78 Accepts]: Start accepts. Automaton has 148480 states and 241042 transitions. Word has length 119 [2019-09-08 09:40:50,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:50,070 INFO L475 AbstractCegarLoop]: Abstraction has 148480 states and 241042 transitions. [2019-09-08 09:40:50,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 09:40:50,070 INFO L276 IsEmpty]: Start isEmpty. Operand 148480 states and 241042 transitions. [2019-09-08 09:40:50,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 09:40:50,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:50,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] [2019-09-08 09:40:50,072 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:50,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:50,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1753406439, now seen corresponding path program 1 times [2019-09-08 09:40:50,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:50,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:50,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:50,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:50,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:50,320 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 09:40:50,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:50,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:40:50,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:40:50,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:40:50,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:40:50,322 INFO L87 Difference]: Start difference. First operand 148480 states and 241042 transitions. Second operand 6 states. [2019-09-08 09:41:01,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:01,696 INFO L93 Difference]: Finished difference Result 353653 states and 575224 transitions. [2019-09-08 09:41:01,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:41:01,696 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-09-08 09:41:01,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:02,003 INFO L225 Difference]: With dead ends: 353653 [2019-09-08 09:41:02,004 INFO L226 Difference]: Without dead ends: 205410 [2019-09-08 09:41:02,120 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:41:02,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205410 states. [2019-09-08 09:41:13,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205410 to 148480. [2019-09-08 09:41:13,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148480 states. [2019-09-08 09:41:13,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148480 states to 148480 states and 240417 transitions. [2019-09-08 09:41:13,303 INFO L78 Accepts]: Start accepts. Automaton has 148480 states and 240417 transitions. Word has length 121 [2019-09-08 09:41:13,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:13,303 INFO L475 AbstractCegarLoop]: Abstraction has 148480 states and 240417 transitions. [2019-09-08 09:41:13,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:41:13,303 INFO L276 IsEmpty]: Start isEmpty. Operand 148480 states and 240417 transitions. [2019-09-08 09:41:13,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 09:41:13,304 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:13,304 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:41:13,305 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:13,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:13,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1710390244, now seen corresponding path program 1 times [2019-09-08 09:41:13,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:13,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:13,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:13,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:13,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:13,534 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 09:41:13,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:13,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:41:13,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:41:13,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:41:13,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:41:13,536 INFO L87 Difference]: Start difference. First operand 148480 states and 240417 transitions. Second operand 6 states. [2019-09-08 09:41:30,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:30,975 INFO L93 Difference]: Finished difference Result 436032 states and 707863 transitions. [2019-09-08 09:41:30,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:41:30,976 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2019-09-08 09:41:30,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:31,390 INFO L225 Difference]: With dead ends: 436032 [2019-09-08 09:41:31,390 INFO L226 Difference]: Without dead ends: 287789 [2019-09-08 09:41:31,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:41:31,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287789 states. [2019-09-08 09:41:53,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287789 to 287785. [2019-09-08 09:41:53,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287785 states. [2019-09-08 09:41:53,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287785 states to 287785 states and 465943 transitions. [2019-09-08 09:41:53,562 INFO L78 Accepts]: Start accepts. Automaton has 287785 states and 465943 transitions. Word has length 124 [2019-09-08 09:41:53,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:53,562 INFO L475 AbstractCegarLoop]: Abstraction has 287785 states and 465943 transitions. [2019-09-08 09:41:53,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:41:53,563 INFO L276 IsEmpty]: Start isEmpty. Operand 287785 states and 465943 transitions. [2019-09-08 09:41:53,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 09:41:53,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:53,564 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] [2019-09-08 09:41:53,564 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:53,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:53,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1484399164, now seen corresponding path program 1 times [2019-09-08 09:41:53,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:53,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:53,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:53,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:53,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:53,701 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 09:41:53,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:53,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:41:53,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:41:53,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:41:53,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:41:53,703 INFO L87 Difference]: Start difference. First operand 287785 states and 465943 transitions. Second operand 5 states. [2019-09-08 09:42:21,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:21,656 INFO L93 Difference]: Finished difference Result 473693 states and 763138 transitions. [2019-09-08 09:42:21,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:42:21,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2019-09-08 09:42:21,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:22,476 INFO L225 Difference]: With dead ends: 473693 [2019-09-08 09:42:22,476 INFO L226 Difference]: Without dead ends: 473691 [2019-09-08 09:42:22,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:42:22,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473691 states. [2019-09-08 09:42:54,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473691 to 292385. [2019-09-08 09:42:54,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292385 states. [2019-09-08 09:42:55,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292385 states to 292385 states and 470498 transitions. [2019-09-08 09:42:55,995 INFO L78 Accepts]: Start accepts. Automaton has 292385 states and 470498 transitions. Word has length 125 [2019-09-08 09:42:55,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:55,996 INFO L475 AbstractCegarLoop]: Abstraction has 292385 states and 470498 transitions. [2019-09-08 09:42:55,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:42:55,996 INFO L276 IsEmpty]: Start isEmpty. Operand 292385 states and 470498 transitions. [2019-09-08 09:42:56,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 09:42:56,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:56,006 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:42:56,006 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:56,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:56,006 INFO L82 PathProgramCache]: Analyzing trace with hash 508061634, now seen corresponding path program 1 times [2019-09-08 09:42:56,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:56,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:56,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:56,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:56,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:56,193 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 09:42:56,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:56,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:42:56,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:42:56,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:42:56,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:42:56,195 INFO L87 Difference]: Start difference. First operand 292385 states and 470498 transitions. Second operand 6 states. [2019-09-08 09:43:22,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:22,705 INFO L93 Difference]: Finished difference Result 563000 states and 911390 transitions. [2019-09-08 09:43:22,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:43:22,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2019-09-08 09:43:22,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:23,364 INFO L225 Difference]: With dead ends: 563000 [2019-09-08 09:43:23,365 INFO L226 Difference]: Without dead ends: 394618 [2019-09-08 09:43:23,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:43:23,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394618 states. [2019-09-08 09:43:53,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394618 to 348013. [2019-09-08 09:43:53,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348013 states. [2019-09-08 09:43:53,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348013 states to 348013 states and 560075 transitions. [2019-09-08 09:43:53,678 INFO L78 Accepts]: Start accepts. Automaton has 348013 states and 560075 transitions. Word has length 155 [2019-09-08 09:43:53,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:53,679 INFO L475 AbstractCegarLoop]: Abstraction has 348013 states and 560075 transitions. [2019-09-08 09:43:53,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:43:53,679 INFO L276 IsEmpty]: Start isEmpty. Operand 348013 states and 560075 transitions. [2019-09-08 09:43:53,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 09:43:53,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:53,688 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:43:53,688 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:53,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:53,689 INFO L82 PathProgramCache]: Analyzing trace with hash -511865934, now seen corresponding path program 1 times [2019-09-08 09:43:53,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:53,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:53,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:53,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:53,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:54,007 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 09:43:54,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:54,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:43:54,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:43:54,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:43:54,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:43:54,009 INFO L87 Difference]: Start difference. First operand 348013 states and 560075 transitions. Second operand 4 states. [2019-09-08 09:44:39,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:44:39,904 INFO L93 Difference]: Finished difference Result 725806 states and 1173632 transitions. [2019-09-08 09:44:39,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:44:39,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-08 09:44:39,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:44:40,882 INFO L225 Difference]: With dead ends: 725806 [2019-09-08 09:44:40,882 INFO L226 Difference]: Without dead ends: 567936 [2019-09-08 09:44:41,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 09:44:41,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567936 states. [2019-09-08 09:45:25,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567936 to 500988. [2019-09-08 09:45:25,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500988 states. [2019-09-08 09:45:34,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500988 states to 500988 states and 808340 transitions. [2019-09-08 09:45:34,864 INFO L78 Accepts]: Start accepts. Automaton has 500988 states and 808340 transitions. Word has length 155 [2019-09-08 09:45:34,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:45:34,865 INFO L475 AbstractCegarLoop]: Abstraction has 500988 states and 808340 transitions. [2019-09-08 09:45:34,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:45:34,865 INFO L276 IsEmpty]: Start isEmpty. Operand 500988 states and 808340 transitions. [2019-09-08 09:45:34,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 09:45:34,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:45:34,871 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:45:34,871 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:45:34,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:45:34,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1925692450, now seen corresponding path program 1 times [2019-09-08 09:45:34,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:45:34,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:45:34,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:34,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:45:34,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:45:35,141 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 09:45:35,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:45:35,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:45:35,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:45:35,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:45:35,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:45:35,143 INFO L87 Difference]: Start difference. First operand 500988 states and 808340 transitions. Second operand 4 states. [2019-09-08 09:46:43,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:46:43,893 INFO L93 Difference]: Finished difference Result 1023227 states and 1659293 transitions. [2019-09-08 09:46:43,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:46:43,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-08 09:46:43,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:46:45,302 INFO L225 Difference]: With dead ends: 1023227 [2019-09-08 09:46:45,302 INFO L226 Difference]: Without dead ends: 804041 [2019-09-08 09:46:45,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 09:46:46,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804041 states. [2019-09-08 09:48:02,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804041 to 711055. [2019-09-08 09:48:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711055 states. [2019-09-08 09:48:04,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711055 states to 711055 states and 1150235 transitions. [2019-09-08 09:48:04,356 INFO L78 Accepts]: Start accepts. Automaton has 711055 states and 1150235 transitions. Word has length 155 [2019-09-08 09:48:04,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:04,357 INFO L475 AbstractCegarLoop]: Abstraction has 711055 states and 1150235 transitions. [2019-09-08 09:48:04,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:48:04,357 INFO L276 IsEmpty]: Start isEmpty. Operand 711055 states and 1150235 transitions. [2019-09-08 09:48:04,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 09:48:04,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:04,360 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:48:04,361 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:04,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:04,361 INFO L82 PathProgramCache]: Analyzing trace with hash -711378670, now seen corresponding path program 1 times [2019-09-08 09:48:04,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:04,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:04,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:04,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:04,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:04,494 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:48:04,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 09:48:04,495 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 09:48:04,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 09:48:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:04,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 1381 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 09:48:04,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 09:48:04,896 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 09:48:04,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 09:48:04,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2019-09-08 09:48:04,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 09:48:04,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 09:48:04,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:48:04,914 INFO L87 Difference]: Start difference. First operand 711055 states and 1150235 transitions. Second operand 9 states.