java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 15:00:50,460 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 15:00:50,462 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 15:00:50,476 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 15:00:50,476 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 15:00:50,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 15:00:50,480 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 15:00:50,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 15:00:50,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 15:00:50,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 15:00:50,499 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 15:00:50,501 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 15:00:50,501 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 15:00:50,503 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 15:00:50,504 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 15:00:50,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 15:00:50,508 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 15:00:50,511 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 15:00:50,512 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 15:00:50,515 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 15:00:50,519 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 15:00:50,520 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 15:00:50,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 15:00:50,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 15:00:50,527 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 15:00:50,527 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 15:00:50,528 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 15:00:50,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 15:00:50,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 15:00:50,535 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 15:00:50,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 15:00:50,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 15:00:50,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 15:00:50,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 15:00:50,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 15:00:50,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 15:00:50,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 15:00:50,540 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 15:00:50,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 15:00:50,542 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 15:00:50,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 15:00:50,544 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-10-02 15:00:50,557 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 15:00:50,558 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 15:00:50,559 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 15:00:50,559 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 15:00:50,559 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 15:00:50,560 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 15:00:50,560 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 15:00:50,560 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 15:00:50,560 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 15:00:50,560 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 15:00:50,561 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 15:00:50,561 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 15:00:50,561 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 15:00:50,561 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 15:00:50,561 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 15:00:50,562 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 15:00:50,562 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 15:00:50,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 15:00:50,562 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 15:00:50,563 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 15:00:50,563 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 15:00:50,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 15:00:50,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 15:00:50,563 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 15:00:50,564 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 15:00:50,564 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 15:00:50,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 15:00:50,564 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 15:00:50,564 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 15:00:50,603 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 15:00:50,621 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 15:00:50,624 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 15:00:50,626 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 15:00:50,626 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 15:00:50,627 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-10-02 15:00:50,700 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35d03b3f3/a8e60a84300441399a6374344a466206/FLAGe895f85ec [2019-10-02 15:00:51,204 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 15:00:51,205 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-10-02 15:00:51,220 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35d03b3f3/a8e60a84300441399a6374344a466206/FLAGe895f85ec [2019-10-02 15:00:51,487 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35d03b3f3/a8e60a84300441399a6374344a466206 [2019-10-02 15:00:51,498 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 15:00:51,499 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 15:00:51,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 15:00:51,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 15:00:51,503 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 15:00:51,504 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 03:00:51" (1/1) ... [2019-10-02 15:00:51,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68dbe3bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:51, skipping insertion in model container [2019-10-02 15:00:51,508 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 03:00:51" (1/1) ... [2019-10-02 15:00:51,516 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 15:00:51,581 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 15:00:52,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 15:00:52,093 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 15:00:52,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 15:00:52,204 INFO L192 MainTranslator]: Completed translation [2019-10-02 15:00:52,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:52 WrapperNode [2019-10-02 15:00:52,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 15:00:52,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 15:00:52,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 15:00:52,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 15:00:52,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:52" (1/1) ... [2019-10-02 15:00:52,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:52" (1/1) ... [2019-10-02 15:00:52,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:52" (1/1) ... [2019-10-02 15:00:52,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:52" (1/1) ... [2019-10-02 15:00:52,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:52" (1/1) ... [2019-10-02 15:00:52,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:52" (1/1) ... [2019-10-02 15:00:52,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:52" (1/1) ... [2019-10-02 15:00:52,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 15:00:52,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 15:00:52,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 15:00:52,280 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 15:00:52,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:52" (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-10-02 15:00:52,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 15:00:52,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 15:00:52,334 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 15:00:52,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 15:00:52,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-02 15:00:52,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-02 15:00:52,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-02 15:00:52,335 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-02 15:00:52,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 15:00:52,335 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-02 15:00:52,335 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-02 15:00:52,335 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-02 15:00:52,335 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-02 15:00:52,336 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-02 15:00:52,336 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-02 15:00:52,336 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-02 15:00:52,336 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 15:00:52,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 15:00:52,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 15:00:53,244 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 15:00:53,244 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 15:00:53,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 03:00:53 BoogieIcfgContainer [2019-10-02 15:00:53,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 15:00:53,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 15:00:53,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 15:00:53,250 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 15:00:53,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 03:00:51" (1/3) ... [2019-10-02 15:00:53,251 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3513930d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 03:00:53, skipping insertion in model container [2019-10-02 15:00:53,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 03:00:52" (2/3) ... [2019-10-02 15:00:53,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3513930d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 03:00:53, skipping insertion in model container [2019-10-02 15:00:53,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 03:00:53" (3/3) ... [2019-10-02 15:00:53,254 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-10-02 15:00:53,264 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 15:00:53,273 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 15:00:53,290 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 15:00:53,324 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 15:00:53,325 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 15:00:53,325 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 15:00:53,325 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 15:00:53,326 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 15:00:53,326 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 15:00:53,326 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 15:00:53,326 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 15:00:53,327 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 15:00:53,350 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-10-02 15:00:53,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 15:00:53,362 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:53,363 INFO L411 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] [2019-10-02 15:00:53,365 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:53,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:53,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1085569870, now seen corresponding path program 1 times [2019-10-02 15:00:53,374 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:53,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:53,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:53,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:53,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:53,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:53,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:53,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:00:53,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:00:53,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:00:53,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:53,896 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 3 states. [2019-10-02 15:00:54,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:54,042 INFO L93 Difference]: Finished difference Result 342 states and 566 transitions. [2019-10-02 15:00:54,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:00:54,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-02 15:00:54,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:54,059 INFO L225 Difference]: With dead ends: 342 [2019-10-02 15:00:54,060 INFO L226 Difference]: Without dead ends: 235 [2019-10-02 15:00:54,066 INFO L640 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-10-02 15:00:54,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-02 15:00:54,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2019-10-02 15:00:54,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-02 15:00:54,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 363 transitions. [2019-10-02 15:00:54,157 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 363 transitions. Word has length 60 [2019-10-02 15:00:54,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:54,157 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 363 transitions. [2019-10-02 15:00:54,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:00:54,158 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 363 transitions. [2019-10-02 15:00:54,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-02 15:00:54,161 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:54,161 INFO L411 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] [2019-10-02 15:00:54,161 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:54,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:54,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1093309265, now seen corresponding path program 1 times [2019-10-02 15:00:54,162 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:54,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:54,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:54,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:54,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:54,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:54,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:54,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:00:54,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:00:54,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:00:54,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:54,332 INFO L87 Difference]: Start difference. First operand 232 states and 363 transitions. Second operand 3 states. [2019-10-02 15:00:54,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:54,404 INFO L93 Difference]: Finished difference Result 570 states and 915 transitions. [2019-10-02 15:00:54,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:00:54,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-10-02 15:00:54,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:54,409 INFO L225 Difference]: With dead ends: 570 [2019-10-02 15:00:54,409 INFO L226 Difference]: Without dead ends: 393 [2019-10-02 15:00:54,411 INFO L640 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-10-02 15:00:54,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-10-02 15:00:54,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 389. [2019-10-02 15:00:54,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-10-02 15:00:54,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 618 transitions. [2019-10-02 15:00:54,454 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 618 transitions. Word has length 62 [2019-10-02 15:00:54,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:54,455 INFO L475 AbstractCegarLoop]: Abstraction has 389 states and 618 transitions. [2019-10-02 15:00:54,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:00:54,455 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 618 transitions. [2019-10-02 15:00:54,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-02 15:00:54,461 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:54,461 INFO L411 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] [2019-10-02 15:00:54,464 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:54,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:54,465 INFO L82 PathProgramCache]: Analyzing trace with hash 647852560, now seen corresponding path program 1 times [2019-10-02 15:00:54,465 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:54,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:54,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:54,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:54,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:54,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:54,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:54,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:00:54,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:00:54,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:00:54,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:54,647 INFO L87 Difference]: Start difference. First operand 389 states and 618 transitions. Second operand 3 states. [2019-10-02 15:00:54,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:54,730 INFO L93 Difference]: Finished difference Result 1025 states and 1652 transitions. [2019-10-02 15:00:54,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:00:54,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-10-02 15:00:54,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:54,739 INFO L225 Difference]: With dead ends: 1025 [2019-10-02 15:00:54,739 INFO L226 Difference]: Without dead ends: 691 [2019-10-02 15:00:54,746 INFO L640 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-10-02 15:00:54,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-10-02 15:00:54,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 685. [2019-10-02 15:00:54,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-10-02 15:00:54,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1094 transitions. [2019-10-02 15:00:54,822 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1094 transitions. Word has length 64 [2019-10-02 15:00:54,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:54,823 INFO L475 AbstractCegarLoop]: Abstraction has 685 states and 1094 transitions. [2019-10-02 15:00:54,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:00:54,823 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1094 transitions. [2019-10-02 15:00:54,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-02 15:00:54,826 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:54,826 INFO L411 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] [2019-10-02 15:00:54,827 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:54,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:54,827 INFO L82 PathProgramCache]: Analyzing trace with hash -971934415, now seen corresponding path program 1 times [2019-10-02 15:00:54,827 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:54,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:54,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:54,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:54,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:54,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:54,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:54,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:00:54,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:00:54,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:00:54,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:00:54,974 INFO L87 Difference]: Start difference. First operand 685 states and 1094 transitions. Second operand 5 states. [2019-10-02 15:00:55,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:55,205 INFO L93 Difference]: Finished difference Result 2313 states and 3756 transitions. [2019-10-02 15:00:55,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 15:00:55,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-10-02 15:00:55,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:55,215 INFO L225 Difference]: With dead ends: 2313 [2019-10-02 15:00:55,216 INFO L226 Difference]: Without dead ends: 1683 [2019-10-02 15:00:55,218 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:00:55,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2019-10-02 15:00:55,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1500. [2019-10-02 15:00:55,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1500 states. [2019-10-02 15:00:55,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 2423 transitions. [2019-10-02 15:00:55,303 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 2423 transitions. Word has length 66 [2019-10-02 15:00:55,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:55,304 INFO L475 AbstractCegarLoop]: Abstraction has 1500 states and 2423 transitions. [2019-10-02 15:00:55,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:00:55,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 2423 transitions. [2019-10-02 15:00:55,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-02 15:00:55,306 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:55,306 INFO L411 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] [2019-10-02 15:00:55,306 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:55,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:55,307 INFO L82 PathProgramCache]: Analyzing trace with hash -126806256, now seen corresponding path program 1 times [2019-10-02 15:00:55,307 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:55,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:55,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:55,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:55,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:55,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:55,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:55,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 15:00:55,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 15:00:55,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 15:00:55,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 15:00:55,415 INFO L87 Difference]: Start difference. First operand 1500 states and 2423 transitions. Second operand 6 states. [2019-10-02 15:00:55,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:55,842 INFO L93 Difference]: Finished difference Result 5957 states and 9657 transitions. [2019-10-02 15:00:55,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 15:00:55,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-10-02 15:00:55,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:55,867 INFO L225 Difference]: With dead ends: 5957 [2019-10-02 15:00:55,868 INFO L226 Difference]: Without dead ends: 4512 [2019-10-02 15:00:55,872 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:00:55,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4512 states. [2019-10-02 15:00:56,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4512 to 4409. [2019-10-02 15:00:56,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4409 states. [2019-10-02 15:00:56,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 7126 transitions. [2019-10-02 15:00:56,114 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 7126 transitions. Word has length 67 [2019-10-02 15:00:56,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:56,115 INFO L475 AbstractCegarLoop]: Abstraction has 4409 states and 7126 transitions. [2019-10-02 15:00:56,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 15:00:56,116 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 7126 transitions. [2019-10-02 15:00:56,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-02 15:00:56,118 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:56,118 INFO L411 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] [2019-10-02 15:00:56,119 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:56,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:56,119 INFO L82 PathProgramCache]: Analyzing trace with hash 306920920, now seen corresponding path program 1 times [2019-10-02 15:00:56,119 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:56,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:56,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:56,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:56,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:56,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:56,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:56,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:00:56,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:00:56,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:00:56,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:00:56,228 INFO L87 Difference]: Start difference. First operand 4409 states and 7126 transitions. Second operand 4 states. [2019-10-02 15:00:56,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:56,600 INFO L93 Difference]: Finished difference Result 10298 states and 16697 transitions. [2019-10-02 15:00:56,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:00:56,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-10-02 15:00:56,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:56,634 INFO L225 Difference]: With dead ends: 10298 [2019-10-02 15:00:56,634 INFO L226 Difference]: Without dead ends: 6343 [2019-10-02 15:00:56,644 INFO L640 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-10-02 15:00:56,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6343 states. [2019-10-02 15:00:56,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6343 to 6316. [2019-10-02 15:00:56,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6316 states. [2019-10-02 15:00:57,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6316 states to 6316 states and 10205 transitions. [2019-10-02 15:00:57,097 INFO L78 Accepts]: Start accepts. Automaton has 6316 states and 10205 transitions. Word has length 68 [2019-10-02 15:00:57,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:57,098 INFO L475 AbstractCegarLoop]: Abstraction has 6316 states and 10205 transitions. [2019-10-02 15:00:57,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:00:57,098 INFO L276 IsEmpty]: Start isEmpty. Operand 6316 states and 10205 transitions. [2019-10-02 15:00:57,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-02 15:00:57,100 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:57,101 INFO L411 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] [2019-10-02 15:00:57,101 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:57,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:57,101 INFO L82 PathProgramCache]: Analyzing trace with hash 872119511, now seen corresponding path program 1 times [2019-10-02 15:00:57,102 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:57,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:57,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:57,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:57,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:57,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:57,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:00:57,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:00:57,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:00:57,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:00:57,256 INFO L87 Difference]: Start difference. First operand 6316 states and 10205 transitions. Second operand 4 states. [2019-10-02 15:00:57,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:57,972 INFO L93 Difference]: Finished difference Result 18451 states and 29920 transitions. [2019-10-02 15:00:57,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:00:57,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-10-02 15:00:57,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:58,049 INFO L225 Difference]: With dead ends: 18451 [2019-10-02 15:00:58,049 INFO L226 Difference]: Without dead ends: 12686 [2019-10-02 15:00:58,066 INFO L640 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-10-02 15:00:58,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12686 states. [2019-10-02 15:00:58,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12686 to 8636. [2019-10-02 15:00:58,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8636 states. [2019-10-02 15:00:58,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8636 states to 8636 states and 13951 transitions. [2019-10-02 15:00:58,577 INFO L78 Accepts]: Start accepts. Automaton has 8636 states and 13951 transitions. Word has length 69 [2019-10-02 15:00:58,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:58,578 INFO L475 AbstractCegarLoop]: Abstraction has 8636 states and 13951 transitions. [2019-10-02 15:00:58,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:00:58,578 INFO L276 IsEmpty]: Start isEmpty. Operand 8636 states and 13951 transitions. [2019-10-02 15:00:58,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-02 15:00:58,580 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:58,580 INFO L411 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] [2019-10-02 15:00:58,581 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:58,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:58,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1806428220, now seen corresponding path program 1 times [2019-10-02 15:00:58,581 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:58,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:58,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:58,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:58,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:58,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:58,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:58,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:00:58,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:00:58,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:00:58,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:58,658 INFO L87 Difference]: Start difference. First operand 8636 states and 13951 transitions. Second operand 3 states. [2019-10-02 15:00:59,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:59,222 INFO L93 Difference]: Finished difference Result 19227 states and 31095 transitions. [2019-10-02 15:00:59,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:00:59,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-10-02 15:00:59,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:59,258 INFO L225 Difference]: With dead ends: 19227 [2019-10-02 15:00:59,258 INFO L226 Difference]: Without dead ends: 12825 [2019-10-02 15:00:59,274 INFO L640 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-10-02 15:00:59,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12825 states. [2019-10-02 15:00:59,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12825 to 12823. [2019-10-02 15:00:59,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12823 states. [2019-10-02 15:00:59,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12823 states to 12823 states and 20604 transitions. [2019-10-02 15:00:59,912 INFO L78 Accepts]: Start accepts. Automaton has 12823 states and 20604 transitions. Word has length 70 [2019-10-02 15:00:59,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:59,913 INFO L475 AbstractCegarLoop]: Abstraction has 12823 states and 20604 transitions. [2019-10-02 15:00:59,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:00:59,913 INFO L276 IsEmpty]: Start isEmpty. Operand 12823 states and 20604 transitions. [2019-10-02 15:00:59,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-02 15:00:59,915 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:59,916 INFO L411 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] [2019-10-02 15:00:59,916 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:59,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:59,917 INFO L82 PathProgramCache]: Analyzing trace with hash -552777714, now seen corresponding path program 1 times [2019-10-02 15:00:59,917 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:59,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:59,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:59,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:59,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:59,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:59,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:59,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:00:59,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:00:59,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:00:59,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:59,994 INFO L87 Difference]: Start difference. First operand 12823 states and 20604 transitions. Second operand 3 states. [2019-10-02 15:01:01,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:01,182 INFO L93 Difference]: Finished difference Result 27737 states and 44670 transitions. [2019-10-02 15:01:01,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:01:01,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-10-02 15:01:01,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:01,244 INFO L225 Difference]: With dead ends: 27737 [2019-10-02 15:01:01,244 INFO L226 Difference]: Without dead ends: 18500 [2019-10-02 15:01:01,277 INFO L640 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-10-02 15:01:01,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18500 states. [2019-10-02 15:01:02,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18500 to 18498. [2019-10-02 15:01:02,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18498 states. [2019-10-02 15:01:02,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18498 states to 18498 states and 29596 transitions. [2019-10-02 15:01:02,177 INFO L78 Accepts]: Start accepts. Automaton has 18498 states and 29596 transitions. Word has length 70 [2019-10-02 15:01:02,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:02,178 INFO L475 AbstractCegarLoop]: Abstraction has 18498 states and 29596 transitions. [2019-10-02 15:01:02,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:01:02,178 INFO L276 IsEmpty]: Start isEmpty. Operand 18498 states and 29596 transitions. [2019-10-02 15:01:02,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-02 15:01:02,179 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:02,179 INFO L411 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] [2019-10-02 15:01:02,179 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:02,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:02,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1170468960, now seen corresponding path program 1 times [2019-10-02 15:01:02,180 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:02,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:02,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:02,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:02,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:02,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:02,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:02,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:01:02,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:01:02,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:01:02,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:01:02,236 INFO L87 Difference]: Start difference. First operand 18498 states and 29596 transitions. Second operand 3 states. [2019-10-02 15:01:03,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:03,266 INFO L93 Difference]: Finished difference Result 42427 states and 68162 transitions. [2019-10-02 15:01:03,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:01:03,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-10-02 15:01:03,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:03,344 INFO L225 Difference]: With dead ends: 42427 [2019-10-02 15:01:03,344 INFO L226 Difference]: Without dead ends: 27744 [2019-10-02 15:01:03,375 INFO L640 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-10-02 15:01:03,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27744 states. [2019-10-02 15:01:04,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27744 to 27742. [2019-10-02 15:01:04,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-10-02 15:01:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 44151 transitions. [2019-10-02 15:01:05,018 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 44151 transitions. Word has length 70 [2019-10-02 15:01:05,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:05,019 INFO L475 AbstractCegarLoop]: Abstraction has 27742 states and 44151 transitions. [2019-10-02 15:01:05,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:01:05,019 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 44151 transitions. [2019-10-02 15:01:05,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-02 15:01:05,020 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:05,020 INFO L411 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] [2019-10-02 15:01:05,021 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:05,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:05,021 INFO L82 PathProgramCache]: Analyzing trace with hash -901408249, now seen corresponding path program 1 times [2019-10-02 15:01:05,021 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:05,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:05,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:05,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:05,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:05,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:05,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:05,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:01:05,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:01:05,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:01:05,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:01:05,203 INFO L87 Difference]: Start difference. First operand 27742 states and 44151 transitions. Second operand 5 states. [2019-10-02 15:01:06,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:06,477 INFO L93 Difference]: Finished difference Result 57487 states and 91562 transitions. [2019-10-02 15:01:06,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 15:01:06,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-10-02 15:01:06,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:06,546 INFO L225 Difference]: With dead ends: 57487 [2019-10-02 15:01:06,546 INFO L226 Difference]: Without dead ends: 29834 [2019-10-02 15:01:06,596 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:01:06,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29834 states. [2019-10-02 15:01:07,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29834 to 27742. [2019-10-02 15:01:07,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-10-02 15:01:07,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 44016 transitions. [2019-10-02 15:01:07,685 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 44016 transitions. Word has length 71 [2019-10-02 15:01:07,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:07,686 INFO L475 AbstractCegarLoop]: Abstraction has 27742 states and 44016 transitions. [2019-10-02 15:01:07,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:01:07,686 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 44016 transitions. [2019-10-02 15:01:07,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-02 15:01:07,687 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:07,687 INFO L411 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] [2019-10-02 15:01:07,687 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:07,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:07,688 INFO L82 PathProgramCache]: Analyzing trace with hash 527849417, now seen corresponding path program 1 times [2019-10-02 15:01:07,688 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:07,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:07,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:07,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:07,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:07,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:07,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:07,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:01:07,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:01:07,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:01:07,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:01:07,854 INFO L87 Difference]: Start difference. First operand 27742 states and 44016 transitions. Second operand 5 states. [2019-10-02 15:01:10,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:10,781 INFO L93 Difference]: Finished difference Result 89911 states and 143015 transitions. [2019-10-02 15:01:10,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 15:01:10,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-10-02 15:01:10,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:10,900 INFO L225 Difference]: With dead ends: 89911 [2019-10-02 15:01:10,900 INFO L226 Difference]: Without dead ends: 62258 [2019-10-02 15:01:10,939 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:01:10,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62258 states. [2019-10-02 15:01:12,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62258 to 38998. [2019-10-02 15:01:12,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38998 states. [2019-10-02 15:01:12,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38998 states to 38998 states and 61670 transitions. [2019-10-02 15:01:12,485 INFO L78 Accepts]: Start accepts. Automaton has 38998 states and 61670 transitions. Word has length 74 [2019-10-02 15:01:12,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:12,487 INFO L475 AbstractCegarLoop]: Abstraction has 38998 states and 61670 transitions. [2019-10-02 15:01:12,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:01:12,487 INFO L276 IsEmpty]: Start isEmpty. Operand 38998 states and 61670 transitions. [2019-10-02 15:01:12,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-02 15:01:12,488 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:12,488 INFO L411 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] [2019-10-02 15:01:12,489 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:12,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:12,489 INFO L82 PathProgramCache]: Analyzing trace with hash -818446556, now seen corresponding path program 1 times [2019-10-02 15:01:12,489 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:12,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:12,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:12,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:12,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:12,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:12,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:12,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:01:12,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:01:12,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:01:12,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:01:12,598 INFO L87 Difference]: Start difference. First operand 38998 states and 61670 transitions. Second operand 5 states. [2019-10-02 15:01:15,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:15,888 INFO L93 Difference]: Finished difference Result 68965 states and 108517 transitions. [2019-10-02 15:01:15,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 15:01:15,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-10-02 15:01:15,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:15,976 INFO L225 Difference]: With dead ends: 68965 [2019-10-02 15:01:15,976 INFO L226 Difference]: Without dead ends: 68963 [2019-10-02 15:01:15,992 INFO L640 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-10-02 15:01:16,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68963 states. [2019-10-02 15:01:17,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68963 to 39854. [2019-10-02 15:01:17,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39854 states. [2019-10-02 15:01:17,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39854 states to 39854 states and 62517 transitions. [2019-10-02 15:01:17,846 INFO L78 Accepts]: Start accepts. Automaton has 39854 states and 62517 transitions. Word has length 75 [2019-10-02 15:01:17,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:17,847 INFO L475 AbstractCegarLoop]: Abstraction has 39854 states and 62517 transitions. [2019-10-02 15:01:17,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:01:17,847 INFO L276 IsEmpty]: Start isEmpty. Operand 39854 states and 62517 transitions. [2019-10-02 15:01:17,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 15:01:17,849 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:17,849 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 15:01:17,850 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:17,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:17,850 INFO L82 PathProgramCache]: Analyzing trace with hash -886490076, now seen corresponding path program 1 times [2019-10-02 15:01:17,850 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:17,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:17,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:17,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:17,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:17,924 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:17,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:17,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:01:17,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:01:17,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:01:17,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:01:17,925 INFO L87 Difference]: Start difference. First operand 39854 states and 62517 transitions. Second operand 3 states. [2019-10-02 15:01:19,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:19,170 INFO L93 Difference]: Finished difference Result 73854 states and 116239 transitions. [2019-10-02 15:01:19,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:01:19,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-10-02 15:01:19,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:19,220 INFO L225 Difference]: With dead ends: 73854 [2019-10-02 15:01:19,221 INFO L226 Difference]: Without dead ends: 34089 [2019-10-02 15:01:19,273 INFO L640 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-10-02 15:01:19,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34089 states. [2019-10-02 15:01:20,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34089 to 34087. [2019-10-02 15:01:20,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34087 states. [2019-10-02 15:01:20,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34087 states to 34087 states and 53532 transitions. [2019-10-02 15:01:20,772 INFO L78 Accepts]: Start accepts. Automaton has 34087 states and 53532 transitions. Word has length 101 [2019-10-02 15:01:20,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:20,772 INFO L475 AbstractCegarLoop]: Abstraction has 34087 states and 53532 transitions. [2019-10-02 15:01:20,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:01:20,772 INFO L276 IsEmpty]: Start isEmpty. Operand 34087 states and 53532 transitions. [2019-10-02 15:01:20,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 15:01:20,774 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:20,774 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 15:01:20,774 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:20,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:20,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1522449336, now seen corresponding path program 1 times [2019-10-02 15:01:20,775 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:20,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:20,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:20,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:20,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:20,848 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:20,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:20,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:01:20,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:01:20,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:01:20,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:01:20,850 INFO L87 Difference]: Start difference. First operand 34087 states and 53532 transitions. Second operand 3 states. [2019-10-02 15:01:21,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:21,444 INFO L93 Difference]: Finished difference Result 47480 states and 74651 transitions. [2019-10-02 15:01:21,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:01:21,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-10-02 15:01:21,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:21,463 INFO L225 Difference]: With dead ends: 47480 [2019-10-02 15:01:21,464 INFO L226 Difference]: Without dead ends: 13512 [2019-10-02 15:01:21,494 INFO L640 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-10-02 15:01:21,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13512 states. [2019-10-02 15:01:22,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13512 to 13510. [2019-10-02 15:01:22,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13510 states. [2019-10-02 15:01:22,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13510 states to 13510 states and 21152 transitions. [2019-10-02 15:01:22,354 INFO L78 Accepts]: Start accepts. Automaton has 13510 states and 21152 transitions. Word has length 101 [2019-10-02 15:01:22,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:22,354 INFO L475 AbstractCegarLoop]: Abstraction has 13510 states and 21152 transitions. [2019-10-02 15:01:22,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:01:22,354 INFO L276 IsEmpty]: Start isEmpty. Operand 13510 states and 21152 transitions. [2019-10-02 15:01:22,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-02 15:01:22,356 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:22,356 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 15:01:22,357 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:22,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:22,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1365075631, now seen corresponding path program 1 times [2019-10-02 15:01:22,357 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:22,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:22,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:22,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:22,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:22,456 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:22,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 15:01:22,459 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 15:01:22,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:22,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 870 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 15:01:22,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 15:01:22,821 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 15:01:22,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 15:01:22,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-10-02 15:01:22,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 15:01:22,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 15:01:22,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 15:01:22,832 INFO L87 Difference]: Start difference. First operand 13510 states and 21152 transitions. Second operand 8 states. [2019-10-02 15:01:25,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:25,059 INFO L93 Difference]: Finished difference Result 31098 states and 48931 transitions. [2019-10-02 15:01:25,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 15:01:25,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 104 [2019-10-02 15:01:25,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:25,174 INFO L225 Difference]: With dead ends: 31098 [2019-10-02 15:01:25,174 INFO L226 Difference]: Without dead ends: 23283 [2019-10-02 15:01:25,197 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 15:01:25,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23283 states. [2019-10-02 15:01:27,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23283 to 20346. [2019-10-02 15:01:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20346 states. [2019-10-02 15:01:27,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20346 states to 20346 states and 31832 transitions. [2019-10-02 15:01:27,571 INFO L78 Accepts]: Start accepts. Automaton has 20346 states and 31832 transitions. Word has length 104 [2019-10-02 15:01:27,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:27,571 INFO L475 AbstractCegarLoop]: Abstraction has 20346 states and 31832 transitions. [2019-10-02 15:01:27,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 15:01:27,572 INFO L276 IsEmpty]: Start isEmpty. Operand 20346 states and 31832 transitions. [2019-10-02 15:01:27,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-02 15:01:27,574 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:27,574 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 15:01:27,574 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:27,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:27,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1972121887, now seen corresponding path program 1 times [2019-10-02 15:01:27,575 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:27,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:27,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:27,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:27,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:27,683 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 15:01:27,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:27,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 15:01:27,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 15:01:27,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 15:01:27,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:01:27,685 INFO L87 Difference]: Start difference. First operand 20346 states and 31832 transitions. Second operand 5 states. [2019-10-02 15:01:28,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:28,631 INFO L93 Difference]: Finished difference Result 30080 states and 47102 transitions. [2019-10-02 15:01:28,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 15:01:28,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-02 15:01:28,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:28,723 INFO L225 Difference]: With dead ends: 30080 [2019-10-02 15:01:28,724 INFO L226 Difference]: Without dead ends: 22512 [2019-10-02 15:01:28,742 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:01:28,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22512 states. [2019-10-02 15:01:29,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22512 to 22506. [2019-10-02 15:01:29,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22506 states. [2019-10-02 15:01:29,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22506 states to 22506 states and 35198 transitions. [2019-10-02 15:01:29,844 INFO L78 Accepts]: Start accepts. Automaton has 22506 states and 35198 transitions. Word has length 104 [2019-10-02 15:01:29,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:29,845 INFO L475 AbstractCegarLoop]: Abstraction has 22506 states and 35198 transitions. [2019-10-02 15:01:29,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 15:01:29,845 INFO L276 IsEmpty]: Start isEmpty. Operand 22506 states and 35198 transitions. [2019-10-02 15:01:29,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 15:01:29,846 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:29,847 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 15:01:29,847 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:29,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:29,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1335838415, now seen corresponding path program 1 times [2019-10-02 15:01:29,848 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:29,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:29,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:29,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:29,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:29,925 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 15:01:29,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:29,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:01:29,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:01:29,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:01:29,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:01:29,927 INFO L87 Difference]: Start difference. First operand 22506 states and 35198 transitions. Second operand 3 states. [2019-10-02 15:01:31,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:31,549 INFO L93 Difference]: Finished difference Result 55438 states and 86893 transitions. [2019-10-02 15:01:31,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:01:31,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-10-02 15:01:31,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:31,641 INFO L225 Difference]: With dead ends: 55438 [2019-10-02 15:01:31,641 INFO L226 Difference]: Without dead ends: 40460 [2019-10-02 15:01:31,672 INFO L640 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-10-02 15:01:31,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40460 states. [2019-10-02 15:01:33,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40460 to 40400. [2019-10-02 15:01:33,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40400 states. [2019-10-02 15:01:33,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40400 states to 40400 states and 63171 transitions. [2019-10-02 15:01:33,754 INFO L78 Accepts]: Start accepts. Automaton has 40400 states and 63171 transitions. Word has length 105 [2019-10-02 15:01:33,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:33,754 INFO L475 AbstractCegarLoop]: Abstraction has 40400 states and 63171 transitions. [2019-10-02 15:01:33,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:01:33,755 INFO L276 IsEmpty]: Start isEmpty. Operand 40400 states and 63171 transitions. [2019-10-02 15:01:33,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-02 15:01:33,756 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:33,756 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 15:01:33,756 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:33,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:33,757 INFO L82 PathProgramCache]: Analyzing trace with hash -184437851, now seen corresponding path program 1 times [2019-10-02 15:01:33,757 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:33,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:33,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:33,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:33,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:33,842 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:33,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:33,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:01:33,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:01:33,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:01:33,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:01:33,844 INFO L87 Difference]: Start difference. First operand 40400 states and 63171 transitions. Second operand 3 states. [2019-10-02 15:01:34,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:34,640 INFO L93 Difference]: Finished difference Result 57851 states and 90536 transitions. [2019-10-02 15:01:34,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:01:34,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-10-02 15:01:34,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:34,671 INFO L225 Difference]: With dead ends: 57851 [2019-10-02 15:01:34,672 INFO L226 Difference]: Without dead ends: 17599 [2019-10-02 15:01:34,716 INFO L640 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-10-02 15:01:34,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17599 states. [2019-10-02 15:01:35,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17599 to 17597. [2019-10-02 15:01:35,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17597 states. [2019-10-02 15:01:35,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17597 states to 17597 states and 27387 transitions. [2019-10-02 15:01:35,504 INFO L78 Accepts]: Start accepts. Automaton has 17597 states and 27387 transitions. Word has length 105 [2019-10-02 15:01:35,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:35,504 INFO L475 AbstractCegarLoop]: Abstraction has 17597 states and 27387 transitions. [2019-10-02 15:01:35,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:01:35,504 INFO L276 IsEmpty]: Start isEmpty. Operand 17597 states and 27387 transitions. [2019-10-02 15:01:35,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-02 15:01:35,507 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:35,507 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 15:01:35,507 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:35,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:35,507 INFO L82 PathProgramCache]: Analyzing trace with hash -897759328, now seen corresponding path program 1 times [2019-10-02 15:01:35,508 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:35,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:35,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:35,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:35,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:35,605 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:35,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 15:01:35,605 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 15:01:35,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:35,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 15:01:35,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 15:01:35,866 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 15:01:35,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 15:01:35,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-10-02 15:01:35,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 15:01:35,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 15:01:35,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-02 15:01:35,883 INFO L87 Difference]: Start difference. First operand 17597 states and 27387 transitions. Second operand 8 states. [2019-10-02 15:01:37,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:37,567 INFO L93 Difference]: Finished difference Result 38269 states and 59768 transitions. [2019-10-02 15:01:37,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 15:01:37,567 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 107 [2019-10-02 15:01:37,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:37,602 INFO L225 Difference]: With dead ends: 38269 [2019-10-02 15:01:37,602 INFO L226 Difference]: Without dead ends: 27720 [2019-10-02 15:01:37,617 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-10-02 15:01:37,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27720 states. [2019-10-02 15:01:38,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27720 to 27082. [2019-10-02 15:01:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27082 states. [2019-10-02 15:01:38,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27082 states to 27082 states and 42229 transitions. [2019-10-02 15:01:38,747 INFO L78 Accepts]: Start accepts. Automaton has 27082 states and 42229 transitions. Word has length 107 [2019-10-02 15:01:38,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:38,747 INFO L475 AbstractCegarLoop]: Abstraction has 27082 states and 42229 transitions. [2019-10-02 15:01:38,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 15:01:38,747 INFO L276 IsEmpty]: Start isEmpty. Operand 27082 states and 42229 transitions. [2019-10-02 15:01:38,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-02 15:01:38,749 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:38,749 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:01:38,749 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:38,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:38,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1597113252, now seen corresponding path program 1 times [2019-10-02 15:01:38,750 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:38,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:38,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:38,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:38,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:38,897 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 15:01:38,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:38,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:01:38,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:01:38,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:01:38,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:01:38,898 INFO L87 Difference]: Start difference. First operand 27082 states and 42229 transitions. Second operand 4 states. [2019-10-02 15:01:41,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:41,873 INFO L93 Difference]: Finished difference Result 79756 states and 124206 transitions. [2019-10-02 15:01:41,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:01:41,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-10-02 15:01:41,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:41,948 INFO L225 Difference]: With dead ends: 79756 [2019-10-02 15:01:41,948 INFO L226 Difference]: Without dead ends: 52687 [2019-10-02 15:01:41,981 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:01:42,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52687 states. [2019-10-02 15:01:44,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52687 to 52685. [2019-10-02 15:01:44,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52685 states. [2019-10-02 15:01:44,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52685 states to 52685 states and 81498 transitions. [2019-10-02 15:01:44,721 INFO L78 Accepts]: Start accepts. Automaton has 52685 states and 81498 transitions. Word has length 108 [2019-10-02 15:01:44,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:44,721 INFO L475 AbstractCegarLoop]: Abstraction has 52685 states and 81498 transitions. [2019-10-02 15:01:44,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:01:44,721 INFO L276 IsEmpty]: Start isEmpty. Operand 52685 states and 81498 transitions. [2019-10-02 15:01:44,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-02 15:01:44,723 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:44,723 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 15:01:44,723 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:44,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:44,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1440328626, now seen corresponding path program 1 times [2019-10-02 15:01:44,724 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:44,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:44,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:44,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:44,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:44,771 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 15:01:44,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:44,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:01:44,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:01:44,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:01:44,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:01:44,772 INFO L87 Difference]: Start difference. First operand 52685 states and 81498 transitions. Second operand 3 states. [2019-10-02 15:01:50,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:50,596 INFO L93 Difference]: Finished difference Result 158009 states and 244424 transitions. [2019-10-02 15:01:50,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:01:50,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-10-02 15:01:50,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:50,749 INFO L225 Difference]: With dead ends: 158009 [2019-10-02 15:01:50,750 INFO L226 Difference]: Without dead ends: 105356 [2019-10-02 15:01:50,806 INFO L640 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-10-02 15:01:50,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105356 states. [2019-10-02 15:01:54,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105356 to 52687. [2019-10-02 15:01:54,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52687 states. [2019-10-02 15:01:54,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52687 states to 52687 states and 81500 transitions. [2019-10-02 15:01:54,199 INFO L78 Accepts]: Start accepts. Automaton has 52687 states and 81500 transitions. Word has length 109 [2019-10-02 15:01:54,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:54,199 INFO L475 AbstractCegarLoop]: Abstraction has 52687 states and 81500 transitions. [2019-10-02 15:01:54,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:01:54,199 INFO L276 IsEmpty]: Start isEmpty. Operand 52687 states and 81500 transitions. [2019-10-02 15:01:54,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-02 15:01:54,201 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:54,201 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 15:01:54,201 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:54,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:54,202 INFO L82 PathProgramCache]: Analyzing trace with hash -2049070452, now seen corresponding path program 1 times [2019-10-02 15:01:54,202 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:54,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:54,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:54,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:54,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:54,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 15:01:54,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:54,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:01:54,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:01:54,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:01:54,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:01:54,264 INFO L87 Difference]: Start difference. First operand 52687 states and 81500 transitions. Second operand 3 states. [2019-10-02 15:01:58,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:58,344 INFO L93 Difference]: Finished difference Result 132699 states and 205552 transitions. [2019-10-02 15:01:58,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:01:58,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-10-02 15:01:58,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:58,462 INFO L225 Difference]: With dead ends: 132699 [2019-10-02 15:01:58,462 INFO L226 Difference]: Without dead ends: 80133 [2019-10-02 15:02:00,182 INFO L640 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-10-02 15:02:00,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80133 states. [2019-10-02 15:02:03,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80133 to 53171. [2019-10-02 15:02:03,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53171 states. [2019-10-02 15:02:03,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53171 states to 53171 states and 82223 transitions. [2019-10-02 15:02:03,299 INFO L78 Accepts]: Start accepts. Automaton has 53171 states and 82223 transitions. Word has length 110 [2019-10-02 15:02:03,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:02:03,299 INFO L475 AbstractCegarLoop]: Abstraction has 53171 states and 82223 transitions. [2019-10-02 15:02:03,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:02:03,299 INFO L276 IsEmpty]: Start isEmpty. Operand 53171 states and 82223 transitions. [2019-10-02 15:02:03,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-02 15:02:03,301 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:02:03,302 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 15:02:03,302 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:02:03,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:02:03,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1144401443, now seen corresponding path program 1 times [2019-10-02 15:02:03,302 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:02:03,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:02:03,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:03,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:02:03,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:02:03,408 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 15:02:03,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:02:03,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:02:03,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:02:03,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:02:03,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:02:03,410 INFO L87 Difference]: Start difference. First operand 53171 states and 82223 transitions. Second operand 4 states. [2019-10-02 15:02:09,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:02:09,338 INFO L93 Difference]: Finished difference Result 156531 states and 241705 transitions. [2019-10-02 15:02:09,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:02:09,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-10-02 15:02:09,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:02:09,483 INFO L225 Difference]: With dead ends: 156531 [2019-10-02 15:02:09,483 INFO L226 Difference]: Without dead ends: 103394 [2019-10-02 15:02:09,529 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:02:09,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103394 states. [2019-10-02 15:02:17,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103394 to 103392. [2019-10-02 15:02:17,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103392 states. [2019-10-02 15:02:17,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103392 states to 103392 states and 158558 transitions. [2019-10-02 15:02:17,784 INFO L78 Accepts]: Start accepts. Automaton has 103392 states and 158558 transitions. Word has length 110 [2019-10-02 15:02:17,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:02:17,785 INFO L475 AbstractCegarLoop]: Abstraction has 103392 states and 158558 transitions. [2019-10-02 15:02:17,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:02:17,785 INFO L276 IsEmpty]: Start isEmpty. Operand 103392 states and 158558 transitions. [2019-10-02 15:02:17,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-02 15:02:17,789 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:02:17,789 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 15:02:17,789 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:02:17,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:02:17,789 INFO L82 PathProgramCache]: Analyzing trace with hash -437565009, now seen corresponding path program 1 times [2019-10-02 15:02:17,790 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:02:17,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:02:17,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:17,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:02:17,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:02:17,835 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 15:02:17,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:02:17,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:02:17,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:02:17,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:02:17,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:02:17,837 INFO L87 Difference]: Start difference. First operand 103392 states and 158558 transitions. Second operand 3 states. [2019-10-02 15:02:31,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:02:31,552 INFO L93 Difference]: Finished difference Result 310092 states and 475546 transitions. [2019-10-02 15:02:31,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:02:31,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-10-02 15:02:31,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:02:31,885 INFO L225 Difference]: With dead ends: 310092 [2019-10-02 15:02:31,885 INFO L226 Difference]: Without dead ends: 206748 [2019-10-02 15:02:31,982 INFO L640 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-10-02 15:02:32,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206748 states. [2019-10-02 15:02:40,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206748 to 103396. [2019-10-02 15:02:40,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103396 states. [2019-10-02 15:02:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103396 states to 103396 states and 158562 transitions. [2019-10-02 15:02:40,435 INFO L78 Accepts]: Start accepts. Automaton has 103396 states and 158562 transitions. Word has length 111 [2019-10-02 15:02:40,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:02:40,435 INFO L475 AbstractCegarLoop]: Abstraction has 103396 states and 158562 transitions. [2019-10-02 15:02:40,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:02:40,435 INFO L276 IsEmpty]: Start isEmpty. Operand 103396 states and 158562 transitions. [2019-10-02 15:02:40,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-02 15:02:40,439 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:02:40,439 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 15:02:40,440 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:02:40,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:02:40,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1133517964, now seen corresponding path program 1 times [2019-10-02 15:02:40,440 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:02:40,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:02:40,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:40,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:02:40,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:02:40,496 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 15:02:40,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:02:40,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:02:40,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:02:40,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:02:40,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:02:40,498 INFO L87 Difference]: Start difference. First operand 103396 states and 158562 transitions. Second operand 3 states. [2019-10-02 15:02:51,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:02:51,935 INFO L93 Difference]: Finished difference Result 256290 states and 392694 transitions. [2019-10-02 15:02:51,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:02:51,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-10-02 15:02:51,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:02:52,154 INFO L225 Difference]: With dead ends: 256290 [2019-10-02 15:02:52,154 INFO L226 Difference]: Without dead ends: 153166 [2019-10-02 15:02:52,241 INFO L640 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-10-02 15:02:52,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153166 states. [2019-10-02 15:03:03,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153166 to 104364. [2019-10-02 15:03:03,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104364 states. [2019-10-02 15:03:03,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104364 states to 104364 states and 160008 transitions. [2019-10-02 15:03:03,862 INFO L78 Accepts]: Start accepts. Automaton has 104364 states and 160008 transitions. Word has length 112 [2019-10-02 15:03:03,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:03:03,862 INFO L475 AbstractCegarLoop]: Abstraction has 104364 states and 160008 transitions. [2019-10-02 15:03:03,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:03:03,862 INFO L276 IsEmpty]: Start isEmpty. Operand 104364 states and 160008 transitions. [2019-10-02 15:03:03,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-02 15:03:03,865 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:03:03,866 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 15:03:03,866 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:03:03,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:03:03,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1659918376, now seen corresponding path program 1 times [2019-10-02 15:03:03,866 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:03:03,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:03:03,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:03,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:03:03,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:03:03,937 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 15:03:03,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:03:03,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:03:03,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:03:03,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:03:03,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:03:03,939 INFO L87 Difference]: Start difference. First operand 104364 states and 160008 transitions. Second operand 3 states. [2019-10-02 15:03:15,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:03:15,868 INFO L93 Difference]: Finished difference Result 279229 states and 427442 transitions. [2019-10-02 15:03:15,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:03:15,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-10-02 15:03:15,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:03:16,109 INFO L225 Difference]: With dead ends: 279229 [2019-10-02 15:03:16,109 INFO L226 Difference]: Without dead ends: 175189 [2019-10-02 15:03:16,191 INFO L640 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-10-02 15:03:16,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175189 states. [2019-10-02 15:03:32,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175189 to 175187. [2019-10-02 15:03:32,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175187 states. [2019-10-02 15:03:33,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175187 states to 175187 states and 265904 transitions. [2019-10-02 15:03:33,105 INFO L78 Accepts]: Start accepts. Automaton has 175187 states and 265904 transitions. Word has length 112 [2019-10-02 15:03:33,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:03:33,106 INFO L475 AbstractCegarLoop]: Abstraction has 175187 states and 265904 transitions. [2019-10-02 15:03:33,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:03:33,106 INFO L276 IsEmpty]: Start isEmpty. Operand 175187 states and 265904 transitions. [2019-10-02 15:03:33,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-02 15:03:33,112 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:03:33,112 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 15:03:33,113 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:03:33,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:03:33,113 INFO L82 PathProgramCache]: Analyzing trace with hash -224555979, now seen corresponding path program 1 times [2019-10-02 15:03:33,113 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:03:33,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:03:33,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:33,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:03:33,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:03:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:03:33,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 15:03:33,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:03:33,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:03:33,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:03:33,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:03:33,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:03:33,222 INFO L87 Difference]: Start difference. First operand 175187 states and 265904 transitions. Second operand 4 states. [2019-10-02 15:03:50,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:03:50,501 INFO L93 Difference]: Finished difference Result 350772 states and 532250 transitions. [2019-10-02 15:03:50,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:03:50,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-02 15:03:50,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:03:50,776 INFO L225 Difference]: With dead ends: 350772 [2019-10-02 15:03:50,776 INFO L226 Difference]: Without dead ends: 175433 [2019-10-02 15:03:50,900 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:03:51,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175433 states. [2019-10-02 15:04:04,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175433 to 175431. [2019-10-02 15:04:04,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175431 states. [2019-10-02 15:04:05,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175431 states to 175431 states and 264816 transitions. [2019-10-02 15:04:05,045 INFO L78 Accepts]: Start accepts. Automaton has 175431 states and 264816 transitions. Word has length 112 [2019-10-02 15:04:05,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:04:05,045 INFO L475 AbstractCegarLoop]: Abstraction has 175431 states and 264816 transitions. [2019-10-02 15:04:05,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:04:05,046 INFO L276 IsEmpty]: Start isEmpty. Operand 175431 states and 264816 transitions. [2019-10-02 15:04:05,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-02 15:04:05,053 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:04:05,053 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 15:04:05,053 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:04:05,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:04:05,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1300532190, now seen corresponding path program 1 times [2019-10-02 15:04:05,054 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:04:05,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:04:05,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:04:05,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:04:05,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:04:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:04:05,161 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 15:04:05,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:04:05,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:04:05,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:04:05,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:04:05,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:04:05,163 INFO L87 Difference]: Start difference. First operand 175431 states and 264816 transitions. Second operand 4 states. [2019-10-02 15:04:21,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:04:21,621 INFO L93 Difference]: Finished difference Result 246218 states and 371228 transitions. [2019-10-02 15:04:21,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:04:21,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-02 15:04:21,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:04:21,870 INFO L225 Difference]: With dead ends: 246218 [2019-10-02 15:04:21,871 INFO L226 Difference]: Without dead ends: 175433 [2019-10-02 15:04:21,942 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:04:22,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175433 states. [2019-10-02 15:04:36,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175433 to 175187. [2019-10-02 15:04:36,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175187 states. [2019-10-02 15:04:36,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175187 states to 175187 states and 264522 transitions. [2019-10-02 15:04:36,520 INFO L78 Accepts]: Start accepts. Automaton has 175187 states and 264522 transitions. Word has length 112 [2019-10-02 15:04:36,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:04:36,521 INFO L475 AbstractCegarLoop]: Abstraction has 175187 states and 264522 transitions. [2019-10-02 15:04:36,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:04:36,521 INFO L276 IsEmpty]: Start isEmpty. Operand 175187 states and 264522 transitions. [2019-10-02 15:04:36,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-02 15:04:36,527 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:04:36,527 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 15:04:36,527 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:04:36,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:04:36,527 INFO L82 PathProgramCache]: Analyzing trace with hash -858599, now seen corresponding path program 1 times [2019-10-02 15:04:36,527 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:04:36,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:04:36,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:04:36,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:04:36,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:04:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:04:36,571 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 15:04:36,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:04:36,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:04:36,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:04:36,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:04:36,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:04:36,573 INFO L87 Difference]: Start difference. First operand 175187 states and 264522 transitions. Second operand 3 states. [2019-10-02 15:05:05,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:05:05,844 INFO L93 Difference]: Finished difference Result 421051 states and 635300 transitions. [2019-10-02 15:05:05,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:05:05,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-10-02 15:05:05,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:05:06,424 INFO L225 Difference]: With dead ends: 421051 [2019-10-02 15:05:06,424 INFO L226 Difference]: Without dead ends: 350266 [2019-10-02 15:05:06,546 INFO L640 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-10-02 15:05:06,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350266 states. [2019-10-02 15:05:28,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350266 to 175195. [2019-10-02 15:05:28,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175195 states. [2019-10-02 15:05:28,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175195 states to 175195 states and 264530 transitions. [2019-10-02 15:05:28,760 INFO L78 Accepts]: Start accepts. Automaton has 175195 states and 264530 transitions. Word has length 113 [2019-10-02 15:05:28,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:05:28,760 INFO L475 AbstractCegarLoop]: Abstraction has 175195 states and 264530 transitions. [2019-10-02 15:05:28,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:05:28,760 INFO L276 IsEmpty]: Start isEmpty. Operand 175195 states and 264530 transitions. [2019-10-02 15:05:28,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-02 15:05:28,766 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:05:28,766 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 15:05:28,766 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:05:28,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:05:28,767 INFO L82 PathProgramCache]: Analyzing trace with hash 739385807, now seen corresponding path program 1 times [2019-10-02 15:05:28,767 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:05:28,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:05:28,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:28,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:05:28,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:05:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:05:28,831 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-02 15:05:28,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:05:28,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:05:28,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:05:28,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:05:28,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:05:28,833 INFO L87 Difference]: Start difference. First operand 175195 states and 264530 transitions. Second operand 3 states. [2019-10-02 15:05:50,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:05:50,085 INFO L93 Difference]: Finished difference Result 427960 states and 645648 transitions. [2019-10-02 15:05:50,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:05:50,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-10-02 15:05:50,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:05:50,467 INFO L225 Difference]: With dead ends: 427960 [2019-10-02 15:05:50,467 INFO L226 Difference]: Without dead ends: 253389 [2019-10-02 15:05:50,609 INFO L640 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-10-02 15:05:50,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253389 states. [2019-10-02 15:06:11,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253389 to 177131. [2019-10-02 15:06:11,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177131 states. [2019-10-02 15:06:11,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177131 states to 177131 states and 267422 transitions. [2019-10-02 15:06:11,863 INFO L78 Accepts]: Start accepts. Automaton has 177131 states and 267422 transitions. Word has length 114 [2019-10-02 15:06:11,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:06:11,864 INFO L475 AbstractCegarLoop]: Abstraction has 177131 states and 267422 transitions. [2019-10-02 15:06:11,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:06:11,864 INFO L276 IsEmpty]: Start isEmpty. Operand 177131 states and 267422 transitions. [2019-10-02 15:06:11,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-02 15:06:11,869 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:06:11,869 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 15:06:11,869 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:06:11,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:06:11,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1647857418, now seen corresponding path program 1 times [2019-10-02 15:06:11,870 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:06:11,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:06:11,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:06:11,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:06:11,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:06:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:06:11,991 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 15:06:11,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:06:11,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:06:11,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:06:11,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:06:11,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:06:11,992 INFO L87 Difference]: Start difference. First operand 177131 states and 267422 transitions. Second operand 4 states. [2019-10-02 15:06:46,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:06:46,870 INFO L93 Difference]: Finished difference Result 520329 states and 784495 transitions. [2019-10-02 15:06:46,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 15:06:46,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-02 15:06:46,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:06:47,443 INFO L225 Difference]: With dead ends: 520329 [2019-10-02 15:06:47,443 INFO L226 Difference]: Without dead ends: 343245 [2019-10-02 15:06:47,623 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:06:47,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343245 states. [2019-10-02 15:07:25,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343245 to 343243. [2019-10-02 15:07:25,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343243 states. [2019-10-02 15:07:26,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343243 states to 343243 states and 512822 transitions. [2019-10-02 15:07:26,205 INFO L78 Accepts]: Start accepts. Automaton has 343243 states and 512822 transitions. Word has length 114 [2019-10-02 15:07:26,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:07:26,206 INFO L475 AbstractCegarLoop]: Abstraction has 343243 states and 512822 transitions. [2019-10-02 15:07:26,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:07:26,206 INFO L276 IsEmpty]: Start isEmpty. Operand 343243 states and 512822 transitions. [2019-10-02 15:07:26,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-02 15:07:26,216 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:07:26,216 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 15:07:26,216 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:07:26,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:07:26,216 INFO L82 PathProgramCache]: Analyzing trace with hash -621974945, now seen corresponding path program 1 times [2019-10-02 15:07:26,216 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:07:26,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:07:26,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:07:26,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:07:26,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:07:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:07:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 15:07:26,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:07:26,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:07:26,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:07:26,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:07:26,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:07:26,333 INFO L87 Difference]: Start difference. First operand 343243 states and 512822 transitions. Second operand 4 states. [2019-10-02 15:08:07,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:08:07,911 INFO L93 Difference]: Finished difference Result 711193 states and 1062892 transitions. [2019-10-02 15:08:07,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 15:08:07,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-02 15:08:07,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:08:08,524 INFO L225 Difference]: With dead ends: 711193 [2019-10-02 15:08:08,525 INFO L226 Difference]: Without dead ends: 370181 [2019-10-02 15:08:08,759 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:08:09,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370181 states. [2019-10-02 15:08:50,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370181 to 369787. [2019-10-02 15:08:50,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369787 states. [2019-10-02 15:08:51,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369787 states to 369787 states and 549378 transitions. [2019-10-02 15:08:51,637 INFO L78 Accepts]: Start accepts. Automaton has 369787 states and 549378 transitions. Word has length 114 [2019-10-02 15:08:51,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:08:51,637 INFO L475 AbstractCegarLoop]: Abstraction has 369787 states and 549378 transitions. [2019-10-02 15:08:51,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:08:51,637 INFO L276 IsEmpty]: Start isEmpty. Operand 369787 states and 549378 transitions. [2019-10-02 15:08:51,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-02 15:08:51,643 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:08:51,643 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 15:08:51,643 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:08:51,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:08:51,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1493784559, now seen corresponding path program 1 times [2019-10-02 15:08:51,644 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:08:51,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:08:51,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:08:51,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:08:51,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:08:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:08:51,765 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 15:08:51,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:08:51,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 15:08:51,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 15:08:51,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 15:08:51,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 15:08:51,767 INFO L87 Difference]: Start difference. First operand 369787 states and 549378 transitions. Second operand 4 states. [2019-10-02 15:09:32,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:09:32,478 INFO L93 Difference]: Finished difference Result 715619 states and 1065798 transitions. [2019-10-02 15:09:32,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 15:09:32,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-02 15:09:32,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:09:33,078 INFO L225 Difference]: With dead ends: 715619 [2019-10-02 15:09:33,079 INFO L226 Difference]: Without dead ends: 352189 [2019-10-02 15:09:33,349 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 15:09:33,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352189 states. [2019-10-02 15:10:06,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352189 to 351963. [2019-10-02 15:10:06,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351963 states. [2019-10-02 15:10:07,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351963 states to 351963 states and 524214 transitions. [2019-10-02 15:10:07,407 INFO L78 Accepts]: Start accepts. Automaton has 351963 states and 524214 transitions. Word has length 114 [2019-10-02 15:10:07,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:10:07,407 INFO L475 AbstractCegarLoop]: Abstraction has 351963 states and 524214 transitions. [2019-10-02 15:10:07,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 15:10:07,407 INFO L276 IsEmpty]: Start isEmpty. Operand 351963 states and 524214 transitions. [2019-10-02 15:10:07,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 15:10:07,411 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:10:07,411 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 15:10:07,411 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:10:07,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:10:07,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1567350686, now seen corresponding path program 1 times [2019-10-02 15:10:07,412 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:10:07,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:10:07,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:10:07,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:10:07,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:10:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:10:07,471 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 15:10:07,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:10:07,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:10:07,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:10:07,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:10:07,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:10:07,472 INFO L87 Difference]: Start difference. First operand 351963 states and 524214 transitions. Second operand 3 states. [2019-10-02 15:11:13,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:11:13,132 INFO L93 Difference]: Finished difference Result 843525 states and 1261152 transitions. [2019-10-02 15:11:13,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:11:13,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-10-02 15:11:13,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:11:14,302 INFO L225 Difference]: With dead ends: 843525 [2019-10-02 15:11:14,302 INFO L226 Difference]: Without dead ends: 675999 [2019-10-02 15:11:14,511 INFO L640 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-10-02 15:11:15,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675999 states. [2019-10-02 15:12:36,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675999 to 674229. [2019-10-02 15:12:36,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674229 states. [2019-10-02 15:12:37,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674229 states to 674229 states and 1004424 transitions. [2019-10-02 15:12:37,391 INFO L78 Accepts]: Start accepts. Automaton has 674229 states and 1004424 transitions. Word has length 116 [2019-10-02 15:12:37,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:12:37,392 INFO L475 AbstractCegarLoop]: Abstraction has 674229 states and 1004424 transitions. [2019-10-02 15:12:37,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:12:37,392 INFO L276 IsEmpty]: Start isEmpty. Operand 674229 states and 1004424 transitions. [2019-10-02 15:12:37,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 15:12:37,397 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:12:37,397 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 15:12:37,397 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:12:37,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:12:37,398 INFO L82 PathProgramCache]: Analyzing trace with hash -480978613, now seen corresponding path program 1 times [2019-10-02 15:12:37,398 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:12:37,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:12:37,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:12:37,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:12:37,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:12:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:12:38,610 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:12:38,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 15:12:38,612 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 15:12:38,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:12:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:12:38,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 15:12:38,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 15:12:38,872 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 15:12:38,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 15:12:38,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-10-02 15:12:38,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 15:12:38,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 15:12:38,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-02 15:12:38,882 INFO L87 Difference]: Start difference. First operand 674229 states and 1004424 transitions. Second operand 10 states.