java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:16:24,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:16:24,519 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:16:24,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:16:24,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:16:24,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:16:24,534 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:16:24,536 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:16:24,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:16:24,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:16:24,540 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:16:24,541 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:16:24,542 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:16:24,543 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:16:24,544 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:16:24,545 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:16:24,546 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:16:24,547 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:16:24,549 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:16:24,551 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:16:24,553 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:16:24,554 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:16:24,555 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:16:24,556 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:16:24,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:16:24,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:16:24,560 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:16:24,561 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:16:24,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:16:24,562 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:16:24,562 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:16:24,563 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:16:24,564 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:16:24,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:16:24,566 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:16:24,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:16:24,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:16:24,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:16:24,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:16:24,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:16:24,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:16:24,571 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 10:16:24,587 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:16:24,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:16:24,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:16:24,589 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:16:24,589 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:16:24,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:16:24,589 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:16:24,590 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:16:24,590 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:16:24,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:16:24,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:16:24,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:16:24,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:16:24,591 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:16:24,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:16:24,591 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:16:24,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:16:24,592 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:16:24,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:16:24,592 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:16:24,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:16:24,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:16:24,593 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:16:24,593 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:16:24,593 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:16:24,593 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:16:24,594 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:16:24,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:16:24,594 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:16:24,635 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:16:24,647 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:16:24,651 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:16:24,652 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:16:24,653 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:16:24,653 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-08 10:16:24,719 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d96fc7ec5/ec7056919d8948188db71208dfe2e550/FLAG811c33d0e [2019-09-08 10:16:25,287 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:16:25,288 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-08 10:16:25,300 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d96fc7ec5/ec7056919d8948188db71208dfe2e550/FLAG811c33d0e [2019-09-08 10:16:25,597 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d96fc7ec5/ec7056919d8948188db71208dfe2e550 [2019-09-08 10:16:25,609 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:16:25,611 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:16:25,613 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:16:25,613 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:16:25,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:16:25,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:16:25" (1/1) ... [2019-09-08 10:16:25,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f4a9bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:16:25, skipping insertion in model container [2019-09-08 10:16:25,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:16:25" (1/1) ... [2019-09-08 10:16:25,633 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:16:25,703 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:16:26,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:16:26,157 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:16:26,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:16:26,270 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:16:26,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:16:26 WrapperNode [2019-09-08 10:16:26,270 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:16:26,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:16:26,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:16:26,272 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:16:26,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:16:26" (1/1) ... [2019-09-08 10:16:26,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:16:26" (1/1) ... [2019-09-08 10:16:26,311 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:16:26" (1/1) ... [2019-09-08 10:16:26,312 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:16:26" (1/1) ... [2019-09-08 10:16:26,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:16:26" (1/1) ... [2019-09-08 10:16:26,353 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:16:26" (1/1) ... [2019-09-08 10:16:26,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:16:26" (1/1) ... [2019-09-08 10:16:26,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:16:26,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:16:26,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:16:26,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:16:26,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:16:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:16:26,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:16:26,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:16:26,413 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:16:26,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:16:26,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:16:26,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:16:26,414 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:16:26,415 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:16:26,416 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:16:26,416 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:16:26,416 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:16:26,417 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:16:26,417 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:16:26,417 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:16:26,418 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:16:26,418 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:16:26,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:16:26,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:16:27,257 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:16:27,257 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:16:27,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:16:27 BoogieIcfgContainer [2019-09-08 10:16:27,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:16:27,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:16:27,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:16:27,264 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:16:27,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:16:25" (1/3) ... [2019-09-08 10:16:27,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27eb43c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:16:27, skipping insertion in model container [2019-09-08 10:16:27,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:16:26" (2/3) ... [2019-09-08 10:16:27,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27eb43c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:16:27, skipping insertion in model container [2019-09-08 10:16:27,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:16:27" (3/3) ... [2019-09-08 10:16:27,268 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-09-08 10:16:27,283 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:16:27,305 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:16:27,326 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:16:27,373 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:16:27,374 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:16:27,375 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:16:27,375 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:16:27,375 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:16:27,376 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:16:27,376 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:16:27,376 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:16:27,376 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:16:27,423 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states. [2019-09-08 10:16:27,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 10:16:27,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:16:27,432 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:16:27,435 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:16:27,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:16:27,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1995893501, now seen corresponding path program 1 times [2019-09-08 10:16:27,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:16:27,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:16:27,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:27,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:16:27,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:16:27,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:16:28,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:16:28,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:16:28,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:16:28,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:16:28,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:16:28,033 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 6 states. [2019-09-08 10:16:28,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:16:28,518 INFO L93 Difference]: Finished difference Result 800 states and 1262 transitions. [2019-09-08 10:16:28,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 10:16:28,520 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-09-08 10:16:28,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:16:28,541 INFO L225 Difference]: With dead ends: 800 [2019-09-08 10:16:28,541 INFO L226 Difference]: Without dead ends: 696 [2019-09-08 10:16:28,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-09-08 10:16:28,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2019-09-08 10:16:28,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 469. [2019-09-08 10:16:28,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-09-08 10:16:28,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 711 transitions. [2019-09-08 10:16:28,665 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 711 transitions. Word has length 54 [2019-09-08 10:16:28,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:16:28,665 INFO L475 AbstractCegarLoop]: Abstraction has 469 states and 711 transitions. [2019-09-08 10:16:28,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:16:28,666 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 711 transitions. [2019-09-08 10:16:28,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:16:28,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:16:28,669 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:16:28,669 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:16:28,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:16:28,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1306112853, now seen corresponding path program 1 times [2019-09-08 10:16:28,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:16:28,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:16:28,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:28,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:16:28,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:16:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:16:28,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:16:28,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:16:28,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:16:28,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:16:28,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:16:28,820 INFO L87 Difference]: Start difference. First operand 469 states and 711 transitions. Second operand 3 states. [2019-09-08 10:16:28,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:16:28,890 INFO L93 Difference]: Finished difference Result 1232 states and 1891 transitions. [2019-09-08 10:16:28,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:16:28,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-09-08 10:16:28,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:16:28,896 INFO L225 Difference]: With dead ends: 1232 [2019-09-08 10:16:28,897 INFO L226 Difference]: Without dead ends: 835 [2019-09-08 10:16:28,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:16:28,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-09-08 10:16:28,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 833. [2019-09-08 10:16:28,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-09-08 10:16:28,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1259 transitions. [2019-09-08 10:16:28,971 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1259 transitions. Word has length 57 [2019-09-08 10:16:28,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:16:28,972 INFO L475 AbstractCegarLoop]: Abstraction has 833 states and 1259 transitions. [2019-09-08 10:16:28,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:16:28,972 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1259 transitions. [2019-09-08 10:16:28,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-08 10:16:28,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:16:28,984 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:16:28,984 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:16:28,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:16:28,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1081311145, now seen corresponding path program 1 times [2019-09-08 10:16:28,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:16:28,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:16:28,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:28,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:16:28,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:16:29,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:16:29,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:16:29,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:16:29,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:16:29,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:16:29,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:16:29,095 INFO L87 Difference]: Start difference. First operand 833 states and 1259 transitions. Second operand 3 states. [2019-09-08 10:16:29,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:16:29,229 INFO L93 Difference]: Finished difference Result 2176 states and 3300 transitions. [2019-09-08 10:16:29,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:16:29,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-09-08 10:16:29,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:16:29,242 INFO L225 Difference]: With dead ends: 2176 [2019-09-08 10:16:29,244 INFO L226 Difference]: Without dead ends: 1423 [2019-09-08 10:16:29,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:16:29,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2019-09-08 10:16:29,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1421. [2019-09-08 10:16:29,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2019-09-08 10:16:29,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2108 transitions. [2019-09-08 10:16:29,339 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2108 transitions. Word has length 57 [2019-09-08 10:16:29,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:16:29,342 INFO L475 AbstractCegarLoop]: Abstraction has 1421 states and 2108 transitions. [2019-09-08 10:16:29,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:16:29,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2108 transitions. [2019-09-08 10:16:29,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:16:29,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:16:29,344 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:16:29,344 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:16:29,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:16:29,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1811397466, now seen corresponding path program 1 times [2019-09-08 10:16:29,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:16:29,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:16:29,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:29,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:16:29,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:16:29,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:16:29,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:16:29,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:16:29,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:16:29,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:16:29,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:16:29,450 INFO L87 Difference]: Start difference. First operand 1421 states and 2108 transitions. Second operand 5 states. [2019-09-08 10:16:29,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:16:29,884 INFO L93 Difference]: Finished difference Result 4062 states and 6060 transitions. [2019-09-08 10:16:29,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:16:29,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-09-08 10:16:29,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:16:29,902 INFO L225 Difference]: With dead ends: 4062 [2019-09-08 10:16:29,903 INFO L226 Difference]: Without dead ends: 2673 [2019-09-08 10:16:29,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:16:29,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2019-09-08 10:16:30,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2656. [2019-09-08 10:16:30,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2656 states. [2019-09-08 10:16:30,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2656 states to 2656 states and 3938 transitions. [2019-09-08 10:16:30,110 INFO L78 Accepts]: Start accepts. Automaton has 2656 states and 3938 transitions. Word has length 58 [2019-09-08 10:16:30,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:16:30,110 INFO L475 AbstractCegarLoop]: Abstraction has 2656 states and 3938 transitions. [2019-09-08 10:16:30,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:16:30,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2656 states and 3938 transitions. [2019-09-08 10:16:30,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 10:16:30,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:16:30,114 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:16:30,114 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:16:30,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:16:30,115 INFO L82 PathProgramCache]: Analyzing trace with hash -211164811, now seen corresponding path program 1 times [2019-09-08 10:16:30,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:16:30,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:16:30,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:30,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:16:30,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:16:30,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:16:30,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:16:30,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:16:30,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:16:30,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:16:30,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:16:30,291 INFO L87 Difference]: Start difference. First operand 2656 states and 3938 transitions. Second operand 6 states. [2019-09-08 10:16:31,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:16:31,011 INFO L93 Difference]: Finished difference Result 8559 states and 12711 transitions. [2019-09-08 10:16:31,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:16:31,012 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-09-08 10:16:31,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:16:31,043 INFO L225 Difference]: With dead ends: 8559 [2019-09-08 10:16:31,044 INFO L226 Difference]: Without dead ends: 5953 [2019-09-08 10:16:31,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:16:31,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5953 states. [2019-09-08 10:16:31,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5953 to 5909. [2019-09-08 10:16:31,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5909 states. [2019-09-08 10:16:31,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5909 states to 5909 states and 8747 transitions. [2019-09-08 10:16:31,584 INFO L78 Accepts]: Start accepts. Automaton has 5909 states and 8747 transitions. Word has length 58 [2019-09-08 10:16:31,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:16:31,584 INFO L475 AbstractCegarLoop]: Abstraction has 5909 states and 8747 transitions. [2019-09-08 10:16:31,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:16:31,585 INFO L276 IsEmpty]: Start isEmpty. Operand 5909 states and 8747 transitions. [2019-09-08 10:16:31,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:16:31,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:16:31,588 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:16:31,588 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:16:31,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:16:31,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1182977442, now seen corresponding path program 1 times [2019-09-08 10:16:31,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:16:31,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:16:31,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:31,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:16:31,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:16:31,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:16:31,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:16:31,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:16:31,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:16:31,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:16:31,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:16:31,731 INFO L87 Difference]: Start difference. First operand 5909 states and 8747 transitions. Second operand 7 states. [2019-09-08 10:16:33,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:16:33,446 INFO L93 Difference]: Finished difference Result 26563 states and 39097 transitions. [2019-09-08 10:16:33,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:16:33,446 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-09-08 10:16:33,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:16:33,560 INFO L225 Difference]: With dead ends: 26563 [2019-09-08 10:16:33,561 INFO L226 Difference]: Without dead ends: 21272 [2019-09-08 10:16:33,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:16:33,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21272 states. [2019-09-08 10:16:34,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21272 to 5929. [2019-09-08 10:16:34,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5929 states. [2019-09-08 10:16:34,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5929 states to 5929 states and 8771 transitions. [2019-09-08 10:16:34,353 INFO L78 Accepts]: Start accepts. Automaton has 5929 states and 8771 transitions. Word has length 59 [2019-09-08 10:16:34,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:16:34,354 INFO L475 AbstractCegarLoop]: Abstraction has 5929 states and 8771 transitions. [2019-09-08 10:16:34,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:16:34,354 INFO L276 IsEmpty]: Start isEmpty. Operand 5929 states and 8771 transitions. [2019-09-08 10:16:34,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 10:16:34,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:16:34,356 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:16:34,357 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:16:34,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:16:34,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1225107520, now seen corresponding path program 1 times [2019-09-08 10:16:34,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:16:34,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:16:34,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:34,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:16:34,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:16:34,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:16:34,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:16:34,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:16:34,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:16:34,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:16:34,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:16:34,491 INFO L87 Difference]: Start difference. First operand 5929 states and 8771 transitions. Second operand 7 states. [2019-09-08 10:16:36,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:16:36,759 INFO L93 Difference]: Finished difference Result 34528 states and 51522 transitions. [2019-09-08 10:16:36,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:16:36,759 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-09-08 10:16:36,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:16:36,837 INFO L225 Difference]: With dead ends: 34528 [2019-09-08 10:16:36,837 INFO L226 Difference]: Without dead ends: 32008 [2019-09-08 10:16:36,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:16:36,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32008 states. [2019-09-08 10:16:37,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32008 to 5965. [2019-09-08 10:16:37,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5965 states. [2019-09-08 10:16:37,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5965 states to 5965 states and 8817 transitions. [2019-09-08 10:16:37,564 INFO L78 Accepts]: Start accepts. Automaton has 5965 states and 8817 transitions. Word has length 59 [2019-09-08 10:16:37,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:16:37,565 INFO L475 AbstractCegarLoop]: Abstraction has 5965 states and 8817 transitions. [2019-09-08 10:16:37,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:16:37,566 INFO L276 IsEmpty]: Start isEmpty. Operand 5965 states and 8817 transitions. [2019-09-08 10:16:37,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-08 10:16:37,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:16:37,568 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:16:37,568 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:16:37,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:16:37,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1930518435, now seen corresponding path program 1 times [2019-09-08 10:16:37,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:16:37,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:16:37,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:37,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:16:37,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:16:37,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:16:37,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:16:37,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:16:37,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:16:37,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:16:37,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:16:37,677 INFO L87 Difference]: Start difference. First operand 5965 states and 8817 transitions. Second operand 6 states. [2019-09-08 10:16:38,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:16:38,800 INFO L93 Difference]: Finished difference Result 21740 states and 32099 transitions. [2019-09-08 10:16:38,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:16:38,800 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-09-08 10:16:38,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:16:38,842 INFO L225 Difference]: With dead ends: 21740 [2019-09-08 10:16:38,843 INFO L226 Difference]: Without dead ends: 15895 [2019-09-08 10:16:38,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:16:38,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15895 states. [2019-09-08 10:16:40,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15895 to 15891. [2019-09-08 10:16:40,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15891 states. [2019-09-08 10:16:40,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15891 states to 15891 states and 23221 transitions. [2019-09-08 10:16:40,467 INFO L78 Accepts]: Start accepts. Automaton has 15891 states and 23221 transitions. Word has length 60 [2019-09-08 10:16:40,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:16:40,467 INFO L475 AbstractCegarLoop]: Abstraction has 15891 states and 23221 transitions. [2019-09-08 10:16:40,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:16:40,467 INFO L276 IsEmpty]: Start isEmpty. Operand 15891 states and 23221 transitions. [2019-09-08 10:16:40,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:16:40,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:16:40,471 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:16:40,471 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:16:40,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:16:40,471 INFO L82 PathProgramCache]: Analyzing trace with hash -341979445, now seen corresponding path program 1 times [2019-09-08 10:16:40,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:16:40,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:16:40,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:40,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:16:40,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:16:40,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:16:40,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:16:40,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:16:40,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:16:40,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:16:40,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:16:40,546 INFO L87 Difference]: Start difference. First operand 15891 states and 23221 transitions. Second operand 5 states. [2019-09-08 10:16:42,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:16:42,600 INFO L93 Difference]: Finished difference Result 41496 states and 60996 transitions. [2019-09-08 10:16:42,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:16:42,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-09-08 10:16:42,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:16:42,676 INFO L225 Difference]: With dead ends: 41496 [2019-09-08 10:16:42,676 INFO L226 Difference]: Without dead ends: 33205 [2019-09-08 10:16:42,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:16:42,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33205 states. [2019-09-08 10:16:43,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33205 to 19510. [2019-09-08 10:16:43,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19510 states. [2019-09-08 10:16:43,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19510 states to 19510 states and 28608 transitions. [2019-09-08 10:16:43,990 INFO L78 Accepts]: Start accepts. Automaton has 19510 states and 28608 transitions. Word has length 61 [2019-09-08 10:16:43,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:16:43,990 INFO L475 AbstractCegarLoop]: Abstraction has 19510 states and 28608 transitions. [2019-09-08 10:16:43,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:16:43,990 INFO L276 IsEmpty]: Start isEmpty. Operand 19510 states and 28608 transitions. [2019-09-08 10:16:43,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 10:16:43,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:16:43,993 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:16:43,994 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:16:43,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:16:43,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1558281363, now seen corresponding path program 1 times [2019-09-08 10:16:43,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:16:43,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:16:43,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:43,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:16:43,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:16:44,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:16:44,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:16:44,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:16:44,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:16:44,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:16:44,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:16:44,062 INFO L87 Difference]: Start difference. First operand 19510 states and 28608 transitions. Second operand 5 states. [2019-09-08 10:16:47,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:16:47,078 INFO L93 Difference]: Finished difference Result 44494 states and 65414 transitions. [2019-09-08 10:16:47,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:16:47,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-09-08 10:16:47,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:16:47,133 INFO L225 Difference]: With dead ends: 44494 [2019-09-08 10:16:47,133 INFO L226 Difference]: Without dead ends: 36203 [2019-09-08 10:16:47,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:16:47,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36203 states. [2019-09-08 10:16:48,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36203 to 23294. [2019-09-08 10:16:48,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23294 states. [2019-09-08 10:16:48,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23294 states to 23294 states and 34245 transitions. [2019-09-08 10:16:48,950 INFO L78 Accepts]: Start accepts. Automaton has 23294 states and 34245 transitions. Word has length 61 [2019-09-08 10:16:48,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:16:48,950 INFO L475 AbstractCegarLoop]: Abstraction has 23294 states and 34245 transitions. [2019-09-08 10:16:48,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:16:48,950 INFO L276 IsEmpty]: Start isEmpty. Operand 23294 states and 34245 transitions. [2019-09-08 10:16:48,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 10:16:48,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:16:48,960 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:16:48,961 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:16:48,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:16:48,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1561793871, now seen corresponding path program 1 times [2019-09-08 10:16:48,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:16:48,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:16:48,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:48,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:16:48,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:16:49,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:16:49,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:16:49,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:16:49,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:16:49,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:16:49,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:16:49,016 INFO L87 Difference]: Start difference. First operand 23294 states and 34245 transitions. Second operand 3 states. [2019-09-08 10:16:51,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:16:51,199 INFO L93 Difference]: Finished difference Result 57152 states and 83956 transitions. [2019-09-08 10:16:51,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:16:51,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-08 10:16:51,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:16:51,252 INFO L225 Difference]: With dead ends: 57152 [2019-09-08 10:16:51,252 INFO L226 Difference]: Without dead ends: 34679 [2019-09-08 10:16:51,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:16:51,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34679 states. [2019-09-08 10:16:54,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34679 to 28265. [2019-09-08 10:16:54,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28265 states. [2019-09-08 10:16:54,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28265 states to 28265 states and 40900 transitions. [2019-09-08 10:16:54,282 INFO L78 Accepts]: Start accepts. Automaton has 28265 states and 40900 transitions. Word has length 64 [2019-09-08 10:16:54,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:16:54,282 INFO L475 AbstractCegarLoop]: Abstraction has 28265 states and 40900 transitions. [2019-09-08 10:16:54,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:16:54,282 INFO L276 IsEmpty]: Start isEmpty. Operand 28265 states and 40900 transitions. [2019-09-08 10:16:54,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 10:16:54,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:16:54,287 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:16:54,287 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:16:54,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:16:54,288 INFO L82 PathProgramCache]: Analyzing trace with hash -944536211, now seen corresponding path program 1 times [2019-09-08 10:16:54,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:16:54,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:16:54,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:54,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:16:54,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:16:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:16:54,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:16:54,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:16:54,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:16:54,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:16:54,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:16:54,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:16:54,378 INFO L87 Difference]: Start difference. First operand 28265 states and 40900 transitions. Second operand 7 states. [2019-09-08 10:17:03,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:17:03,951 INFO L93 Difference]: Finished difference Result 129322 states and 185387 transitions. [2019-09-08 10:17:03,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 10:17:03,951 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-09-08 10:17:03,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:17:04,141 INFO L225 Difference]: With dead ends: 129322 [2019-09-08 10:17:04,141 INFO L226 Difference]: Without dead ends: 116669 [2019-09-08 10:17:04,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:17:04,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116669 states. [2019-09-08 10:17:07,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116669 to 28375. [2019-09-08 10:17:07,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28375 states. [2019-09-08 10:17:07,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28375 states to 28375 states and 41042 transitions. [2019-09-08 10:17:07,205 INFO L78 Accepts]: Start accepts. Automaton has 28375 states and 41042 transitions. Word has length 64 [2019-09-08 10:17:07,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:17:07,206 INFO L475 AbstractCegarLoop]: Abstraction has 28375 states and 41042 transitions. [2019-09-08 10:17:07,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:17:07,206 INFO L276 IsEmpty]: Start isEmpty. Operand 28375 states and 41042 transitions. [2019-09-08 10:17:07,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 10:17:07,210 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:17:07,210 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:17:07,210 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:17:07,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:17:07,210 INFO L82 PathProgramCache]: Analyzing trace with hash -2106073500, now seen corresponding path program 1 times [2019-09-08 10:17:07,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:17:07,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:17:07,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:07,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:17:07,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:17:07,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:17:07,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:17:07,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:17:07,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:17:07,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:17:07,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:17:07,483 INFO L87 Difference]: Start difference. First operand 28375 states and 41042 transitions. Second operand 10 states. [2019-09-08 10:17:16,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:17:16,856 INFO L93 Difference]: Finished difference Result 100537 states and 144549 transitions. [2019-09-08 10:17:16,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 10:17:16,856 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-09-08 10:17:16,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:17:16,995 INFO L225 Difference]: With dead ends: 100537 [2019-09-08 10:17:16,995 INFO L226 Difference]: Without dead ends: 74258 [2019-09-08 10:17:17,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:17:17,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74258 states. [2019-09-08 10:17:20,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74258 to 28178. [2019-09-08 10:17:20,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28178 states. [2019-09-08 10:17:20,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28178 states to 28178 states and 40775 transitions. [2019-09-08 10:17:20,151 INFO L78 Accepts]: Start accepts. Automaton has 28178 states and 40775 transitions. Word has length 66 [2019-09-08 10:17:20,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:17:20,151 INFO L475 AbstractCegarLoop]: Abstraction has 28178 states and 40775 transitions. [2019-09-08 10:17:20,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:17:20,151 INFO L276 IsEmpty]: Start isEmpty. Operand 28178 states and 40775 transitions. [2019-09-08 10:17:20,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 10:17:20,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:17:20,155 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:17:20,155 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:17:20,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:17:20,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1562834592, now seen corresponding path program 1 times [2019-09-08 10:17:20,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:17:20,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:17:20,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:20,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:17:20,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:17:20,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:17:20,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:17:20,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:17:20,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:17:20,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:17:20,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:17:20,340 INFO L87 Difference]: Start difference. First operand 28178 states and 40775 transitions. Second operand 10 states. [2019-09-08 10:17:31,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:17:31,187 INFO L93 Difference]: Finished difference Result 99844 states and 143675 transitions. [2019-09-08 10:17:31,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 10:17:31,188 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-09-08 10:17:31,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:17:31,330 INFO L225 Difference]: With dead ends: 99844 [2019-09-08 10:17:31,330 INFO L226 Difference]: Without dead ends: 73761 [2019-09-08 10:17:31,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=236, Invalid=694, Unknown=0, NotChecked=0, Total=930 [2019-09-08 10:17:31,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73761 states. [2019-09-08 10:17:35,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73761 to 27916. [2019-09-08 10:17:35,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27916 states. [2019-09-08 10:17:35,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27916 states to 27916 states and 40388 transitions. [2019-09-08 10:17:35,429 INFO L78 Accepts]: Start accepts. Automaton has 27916 states and 40388 transitions. Word has length 66 [2019-09-08 10:17:35,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:17:35,429 INFO L475 AbstractCegarLoop]: Abstraction has 27916 states and 40388 transitions. [2019-09-08 10:17:35,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:17:35,429 INFO L276 IsEmpty]: Start isEmpty. Operand 27916 states and 40388 transitions. [2019-09-08 10:17:35,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 10:17:35,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:17:35,433 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:17:35,433 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:17:35,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:17:35,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1195976158, now seen corresponding path program 1 times [2019-09-08 10:17:35,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:17:35,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:17:35,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:35,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:17:35,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:17:35,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:17:35,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:17:35,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:17:35,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:17:35,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:17:35,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:17:35,607 INFO L87 Difference]: Start difference. First operand 27916 states and 40388 transitions. Second operand 10 states. [2019-09-08 10:17:51,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:17:51,074 INFO L93 Difference]: Finished difference Result 126764 states and 181190 transitions. [2019-09-08 10:17:51,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 10:17:51,075 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-09-08 10:17:51,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:17:51,221 INFO L225 Difference]: With dead ends: 126764 [2019-09-08 10:17:51,222 INFO L226 Difference]: Without dead ends: 100524 [2019-09-08 10:17:51,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 10:17:51,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100524 states. [2019-09-08 10:17:55,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100524 to 27548. [2019-09-08 10:17:55,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27548 states. [2019-09-08 10:17:55,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27548 states to 27548 states and 39859 transitions. [2019-09-08 10:17:55,389 INFO L78 Accepts]: Start accepts. Automaton has 27548 states and 39859 transitions. Word has length 66 [2019-09-08 10:17:55,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:17:55,389 INFO L475 AbstractCegarLoop]: Abstraction has 27548 states and 39859 transitions. [2019-09-08 10:17:55,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:17:55,389 INFO L276 IsEmpty]: Start isEmpty. Operand 27548 states and 39859 transitions. [2019-09-08 10:17:55,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 10:17:55,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:17:55,393 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:17:55,393 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:17:55,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:17:55,394 INFO L82 PathProgramCache]: Analyzing trace with hash -22489909, now seen corresponding path program 1 times [2019-09-08 10:17:55,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:17:55,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:17:55,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:55,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:17:55,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:17:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:17:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:17:55,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:17:55,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:17:55,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:17:55,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:17:55,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:17:55,441 INFO L87 Difference]: Start difference. First operand 27548 states and 39859 transitions. Second operand 3 states. [2019-09-08 10:18:00,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:18:00,273 INFO L93 Difference]: Finished difference Result 40173 states and 57952 transitions. [2019-09-08 10:18:00,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:18:00,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-08 10:18:00,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:18:00,309 INFO L225 Difference]: With dead ends: 40173 [2019-09-08 10:18:00,309 INFO L226 Difference]: Without dead ends: 27550 [2019-09-08 10:18:00,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:18:00,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27550 states. [2019-09-08 10:18:03,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27550 to 27548. [2019-09-08 10:18:03,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27548 states. [2019-09-08 10:18:03,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27548 states to 27548 states and 39237 transitions. [2019-09-08 10:18:03,849 INFO L78 Accepts]: Start accepts. Automaton has 27548 states and 39237 transitions. Word has length 67 [2019-09-08 10:18:03,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:18:03,849 INFO L475 AbstractCegarLoop]: Abstraction has 27548 states and 39237 transitions. [2019-09-08 10:18:03,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:18:03,849 INFO L276 IsEmpty]: Start isEmpty. Operand 27548 states and 39237 transitions. [2019-09-08 10:18:03,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 10:18:03,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:03,852 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:18:03,852 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:03,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:03,852 INFO L82 PathProgramCache]: Analyzing trace with hash 910047089, now seen corresponding path program 1 times [2019-09-08 10:18:03,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:03,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:03,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:03,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:03,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:03,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:18:03,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:18:03,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:18:03,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:18:03,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:18:03,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:18:03,894 INFO L87 Difference]: Start difference. First operand 27548 states and 39237 transitions. Second operand 3 states. [2019-09-08 10:18:07,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:18:07,267 INFO L93 Difference]: Finished difference Result 37375 states and 53049 transitions. [2019-09-08 10:18:07,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:18:07,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-08 10:18:07,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:18:07,298 INFO L225 Difference]: With dead ends: 37375 [2019-09-08 10:18:07,299 INFO L226 Difference]: Without dead ends: 24718 [2019-09-08 10:18:07,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:18:07,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24718 states. [2019-09-08 10:18:10,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24718 to 24716. [2019-09-08 10:18:10,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24716 states. [2019-09-08 10:18:10,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24716 states to 24716 states and 34617 transitions. [2019-09-08 10:18:10,513 INFO L78 Accepts]: Start accepts. Automaton has 24716 states and 34617 transitions. Word has length 67 [2019-09-08 10:18:10,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:18:10,513 INFO L475 AbstractCegarLoop]: Abstraction has 24716 states and 34617 transitions. [2019-09-08 10:18:10,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:18:10,514 INFO L276 IsEmpty]: Start isEmpty. Operand 24716 states and 34617 transitions. [2019-09-08 10:18:10,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 10:18:10,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:10,516 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:18:10,517 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:10,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:10,517 INFO L82 PathProgramCache]: Analyzing trace with hash 807080215, now seen corresponding path program 1 times [2019-09-08 10:18:10,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:10,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:10,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:10,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:10,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:10,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:18:10,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:18:10,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:18:10,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:18:10,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:18:10,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:18:10,567 INFO L87 Difference]: Start difference. First operand 24716 states and 34617 transitions. Second operand 3 states. [2019-09-08 10:18:13,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:18:13,925 INFO L93 Difference]: Finished difference Result 30654 states and 42745 transitions. [2019-09-08 10:18:13,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:18:13,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-08 10:18:13,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:18:13,954 INFO L225 Difference]: With dead ends: 30654 [2019-09-08 10:18:13,954 INFO L226 Difference]: Without dead ends: 20911 [2019-09-08 10:18:13,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:18:13,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20911 states. [2019-09-08 10:18:16,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20911 to 20909. [2019-09-08 10:18:16,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20909 states. [2019-09-08 10:18:16,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20909 states to 20909 states and 28666 transitions. [2019-09-08 10:18:16,679 INFO L78 Accepts]: Start accepts. Automaton has 20909 states and 28666 transitions. Word has length 67 [2019-09-08 10:18:16,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:18:16,679 INFO L475 AbstractCegarLoop]: Abstraction has 20909 states and 28666 transitions. [2019-09-08 10:18:16,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:18:16,680 INFO L276 IsEmpty]: Start isEmpty. Operand 20909 states and 28666 transitions. [2019-09-08 10:18:16,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 10:18:16,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:16,682 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:18:16,683 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:16,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:16,683 INFO L82 PathProgramCache]: Analyzing trace with hash 951021968, now seen corresponding path program 1 times [2019-09-08 10:18:16,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:16,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:16,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:16,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:16,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:17,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:18:17,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:18:17,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 10:18:17,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 10:18:17,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 10:18:17,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-09-08 10:18:17,426 INFO L87 Difference]: Start difference. First operand 20909 states and 28666 transitions. Second operand 17 states. [2019-09-08 10:18:18,024 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2019-09-08 10:18:18,211 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-09-08 10:18:18,633 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-09-08 10:18:18,876 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 67 [2019-09-08 10:18:19,050 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-08 10:18:19,271 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-08 10:18:19,539 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-08 10:18:19,706 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-08 10:18:20,046 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-09-08 10:18:28,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:18:28,816 INFO L93 Difference]: Finished difference Result 45596 states and 62607 transitions. [2019-09-08 10:18:28,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 10:18:28,817 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2019-09-08 10:18:28,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:18:28,869 INFO L225 Difference]: With dead ends: 45596 [2019-09-08 10:18:28,870 INFO L226 Difference]: Without dead ends: 43652 [2019-09-08 10:18:28,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=282, Invalid=978, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 10:18:28,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43652 states. [2019-09-08 10:18:31,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43652 to 20825. [2019-09-08 10:18:31,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20825 states. [2019-09-08 10:18:31,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20825 states to 20825 states and 28554 transitions. [2019-09-08 10:18:31,897 INFO L78 Accepts]: Start accepts. Automaton has 20825 states and 28554 transitions. Word has length 68 [2019-09-08 10:18:31,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:18:31,897 INFO L475 AbstractCegarLoop]: Abstraction has 20825 states and 28554 transitions. [2019-09-08 10:18:31,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 10:18:31,898 INFO L276 IsEmpty]: Start isEmpty. Operand 20825 states and 28554 transitions. [2019-09-08 10:18:31,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 10:18:31,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:31,902 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:18:31,902 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:31,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:31,903 INFO L82 PathProgramCache]: Analyzing trace with hash 313084076, now seen corresponding path program 1 times [2019-09-08 10:18:31,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:31,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:31,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:31,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:31,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:32,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:18:32,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:18:32,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 10:18:32,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 10:18:32,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 10:18:32,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-09-08 10:18:32,583 INFO L87 Difference]: Start difference. First operand 20825 states and 28554 transitions. Second operand 16 states. [2019-09-08 10:18:33,011 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-08 10:18:33,298 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-08 10:18:33,426 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-08 10:18:40,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:18:40,506 INFO L93 Difference]: Finished difference Result 41528 states and 57185 transitions. [2019-09-08 10:18:40,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:18:40,506 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2019-09-08 10:18:40,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:18:40,557 INFO L225 Difference]: With dead ends: 41528 [2019-09-08 10:18:40,557 INFO L226 Difference]: Without dead ends: 37765 [2019-09-08 10:18:40,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2019-09-08 10:18:40,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37765 states. [2019-09-08 10:18:43,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37765 to 20656. [2019-09-08 10:18:43,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20656 states. [2019-09-08 10:18:43,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20656 states to 20656 states and 28324 transitions. [2019-09-08 10:18:43,741 INFO L78 Accepts]: Start accepts. Automaton has 20656 states and 28324 transitions. Word has length 68 [2019-09-08 10:18:43,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:18:43,741 INFO L475 AbstractCegarLoop]: Abstraction has 20656 states and 28324 transitions. [2019-09-08 10:18:43,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 10:18:43,741 INFO L276 IsEmpty]: Start isEmpty. Operand 20656 states and 28324 transitions. [2019-09-08 10:18:43,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 10:18:43,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:43,744 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:18:43,744 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:43,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:43,744 INFO L82 PathProgramCache]: Analyzing trace with hash 717078376, now seen corresponding path program 1 times [2019-09-08 10:18:43,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:43,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:43,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:43,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:43,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:43,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:18:43,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:18:43,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:18:43,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:18:43,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:18:43,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:18:43,777 INFO L87 Difference]: Start difference. First operand 20656 states and 28324 transitions. Second operand 3 states. [2019-09-08 10:18:48,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:18:48,550 INFO L93 Difference]: Finished difference Result 38922 states and 53498 transitions. [2019-09-08 10:18:48,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:18:48,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-08 10:18:48,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:18:48,580 INFO L225 Difference]: With dead ends: 38922 [2019-09-08 10:18:48,580 INFO L226 Difference]: Without dead ends: 30925 [2019-09-08 10:18:48,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:18:48,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30925 states. [2019-09-08 10:18:51,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30925 to 20511. [2019-09-08 10:18:51,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20511 states. [2019-09-08 10:18:51,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20511 states to 20511 states and 28081 transitions. [2019-09-08 10:18:51,966 INFO L78 Accepts]: Start accepts. Automaton has 20511 states and 28081 transitions. Word has length 68 [2019-09-08 10:18:51,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:18:51,966 INFO L475 AbstractCegarLoop]: Abstraction has 20511 states and 28081 transitions. [2019-09-08 10:18:51,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:18:51,966 INFO L276 IsEmpty]: Start isEmpty. Operand 20511 states and 28081 transitions. [2019-09-08 10:18:51,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 10:18:51,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:18:51,969 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:18:51,969 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:18:51,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:18:51,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1369153575, now seen corresponding path program 1 times [2019-09-08 10:18:51,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:18:51,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:18:51,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:51,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:18:51,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:18:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:18:52,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:18:52,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:18:52,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:18:52,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:18:52,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:18:52,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:18:52,014 INFO L87 Difference]: Start difference. First operand 20511 states and 28081 transitions. Second operand 3 states. [2019-09-08 10:18:56,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:18:56,915 INFO L93 Difference]: Finished difference Result 38564 states and 52945 transitions. [2019-09-08 10:18:56,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:18:56,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-08 10:18:56,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:18:56,952 INFO L225 Difference]: With dead ends: 38564 [2019-09-08 10:18:56,953 INFO L226 Difference]: Without dead ends: 30651 [2019-09-08 10:18:56,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:18:56,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30651 states. [2019-09-08 10:19:00,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30651 to 20237. [2019-09-08 10:19:00,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20237 states. [2019-09-08 10:19:00,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20237 states to 20237 states and 27674 transitions. [2019-09-08 10:19:00,595 INFO L78 Accepts]: Start accepts. Automaton has 20237 states and 27674 transitions. Word has length 68 [2019-09-08 10:19:00,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:00,595 INFO L475 AbstractCegarLoop]: Abstraction has 20237 states and 27674 transitions. [2019-09-08 10:19:00,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:19:00,596 INFO L276 IsEmpty]: Start isEmpty. Operand 20237 states and 27674 transitions. [2019-09-08 10:19:00,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:19:00,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:00,601 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:19:00,601 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:00,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:00,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1358366886, now seen corresponding path program 1 times [2019-09-08 10:19:00,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:00,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:00,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:00,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:00,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:00,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:19:00,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:19:00,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:19:00,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:19:00,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:19:00,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:19:00,778 INFO L87 Difference]: Start difference. First operand 20237 states and 27674 transitions. Second operand 5 states. [2019-09-08 10:19:04,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:04,840 INFO L93 Difference]: Finished difference Result 20243 states and 27677 transitions. [2019-09-08 10:19:04,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:19:04,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-09-08 10:19:04,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:04,860 INFO L225 Difference]: With dead ends: 20243 [2019-09-08 10:19:04,860 INFO L226 Difference]: Without dead ends: 19377 [2019-09-08 10:19:04,865 INFO L628 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-09-08 10:19:04,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19377 states. [2019-09-08 10:19:08,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19377 to 19373. [2019-09-08 10:19:08,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19373 states. [2019-09-08 10:19:08,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19373 states to 19373 states and 26529 transitions. [2019-09-08 10:19:08,197 INFO L78 Accepts]: Start accepts. Automaton has 19373 states and 26529 transitions. Word has length 73 [2019-09-08 10:19:08,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:08,197 INFO L475 AbstractCegarLoop]: Abstraction has 19373 states and 26529 transitions. [2019-09-08 10:19:08,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:19:08,197 INFO L276 IsEmpty]: Start isEmpty. Operand 19373 states and 26529 transitions. [2019-09-08 10:19:08,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:19:08,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:08,202 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:19:08,202 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:08,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:08,203 INFO L82 PathProgramCache]: Analyzing trace with hash -168810636, now seen corresponding path program 1 times [2019-09-08 10:19:08,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:08,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:08,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:08,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:08,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:08,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:19:08,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:19:08,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:19:08,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:19:08,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:19:08,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:19:08,288 INFO L87 Difference]: Start difference. First operand 19373 states and 26529 transitions. Second operand 6 states. [2019-09-08 10:19:15,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:15,603 INFO L93 Difference]: Finished difference Result 36927 states and 49999 transitions. [2019-09-08 10:19:15,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:19:15,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-09-08 10:19:15,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:15,652 INFO L225 Difference]: With dead ends: 36927 [2019-09-08 10:19:15,653 INFO L226 Difference]: Without dead ends: 36925 [2019-09-08 10:19:15,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:19:15,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36925 states. [2019-09-08 10:19:19,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36925 to 20003. [2019-09-08 10:19:19,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20003 states. [2019-09-08 10:19:19,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20003 states to 20003 states and 26989 transitions. [2019-09-08 10:19:19,464 INFO L78 Accepts]: Start accepts. Automaton has 20003 states and 26989 transitions. Word has length 76 [2019-09-08 10:19:19,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:19,465 INFO L475 AbstractCegarLoop]: Abstraction has 20003 states and 26989 transitions. [2019-09-08 10:19:19,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:19:19,465 INFO L276 IsEmpty]: Start isEmpty. Operand 20003 states and 26989 transitions. [2019-09-08 10:19:19,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 10:19:19,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:19,470 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:19:19,470 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:19,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:19,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1576523007, now seen corresponding path program 1 times [2019-09-08 10:19:19,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:19,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:19,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:19,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:19,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:19,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:19:19,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:19:19,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:19:19,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:19:19,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:19:19,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:19:19,513 INFO L87 Difference]: Start difference. First operand 20003 states and 26989 transitions. Second operand 3 states. [2019-09-08 10:19:26,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:26,829 INFO L93 Difference]: Finished difference Result 55864 states and 75248 transitions. [2019-09-08 10:19:26,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:19:26,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-08 10:19:26,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:26,870 INFO L225 Difference]: With dead ends: 55864 [2019-09-08 10:19:26,870 INFO L226 Difference]: Without dead ends: 36787 [2019-09-08 10:19:26,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:19:26,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36787 states. [2019-09-08 10:19:33,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36787 to 34153. [2019-09-08 10:19:33,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34153 states. [2019-09-08 10:19:33,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34153 states to 34153 states and 45523 transitions. [2019-09-08 10:19:33,619 INFO L78 Accepts]: Start accepts. Automaton has 34153 states and 45523 transitions. Word has length 77 [2019-09-08 10:19:33,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:33,619 INFO L475 AbstractCegarLoop]: Abstraction has 34153 states and 45523 transitions. [2019-09-08 10:19:33,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:19:33,619 INFO L276 IsEmpty]: Start isEmpty. Operand 34153 states and 45523 transitions. [2019-09-08 10:19:33,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 10:19:33,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:33,623 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:19:33,623 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:33,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:33,623 INFO L82 PathProgramCache]: Analyzing trace with hash 175965857, now seen corresponding path program 1 times [2019-09-08 10:19:33,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:33,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:33,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:33,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:33,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:33,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:19:33,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:19:33,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:19:33,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:19:33,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:19:33,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:19:33,676 INFO L87 Difference]: Start difference. First operand 34153 states and 45523 transitions. Second operand 3 states. [2019-09-08 10:19:44,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:19:44,598 INFO L93 Difference]: Finished difference Result 83969 states and 111877 transitions. [2019-09-08 10:19:44,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:19:44,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-08 10:19:44,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:19:44,676 INFO L225 Difference]: With dead ends: 83969 [2019-09-08 10:19:44,677 INFO L226 Difference]: Without dead ends: 50783 [2019-09-08 10:19:44,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:19:44,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50783 states. [2019-09-08 10:19:54,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50783 to 50781. [2019-09-08 10:19:54,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50781 states. [2019-09-08 10:19:54,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50781 states to 50781 states and 67073 transitions. [2019-09-08 10:19:54,551 INFO L78 Accepts]: Start accepts. Automaton has 50781 states and 67073 transitions. Word has length 78 [2019-09-08 10:19:54,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:19:54,551 INFO L475 AbstractCegarLoop]: Abstraction has 50781 states and 67073 transitions. [2019-09-08 10:19:54,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:19:54,552 INFO L276 IsEmpty]: Start isEmpty. Operand 50781 states and 67073 transitions. [2019-09-08 10:19:54,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 10:19:54,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:19:54,560 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:19:54,560 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:19:54,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:19:54,561 INFO L82 PathProgramCache]: Analyzing trace with hash -847980887, now seen corresponding path program 1 times [2019-09-08 10:19:54,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:19:54,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:19:54,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:54,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:19:54,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:19:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:19:54,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:19:54,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:19:54,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:19:54,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:19:54,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:19:54,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:19:54,609 INFO L87 Difference]: Start difference. First operand 50781 states and 67073 transitions. Second operand 5 states. [2019-09-08 10:20:32,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:20:32,287 INFO L93 Difference]: Finished difference Result 220699 states and 290117 transitions. [2019-09-08 10:20:32,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:20:32,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-08 10:20:32,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:20:32,536 INFO L225 Difference]: With dead ends: 220699 [2019-09-08 10:20:32,536 INFO L226 Difference]: Without dead ends: 170885 [2019-09-08 10:20:32,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:20:32,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170885 states. [2019-09-08 10:20:54,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170885 to 101189. [2019-09-08 10:20:54,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101189 states. [2019-09-08 10:20:54,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101189 states to 101189 states and 133237 transitions. [2019-09-08 10:20:54,932 INFO L78 Accepts]: Start accepts. Automaton has 101189 states and 133237 transitions. Word has length 86 [2019-09-08 10:20:54,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:20:54,933 INFO L475 AbstractCegarLoop]: Abstraction has 101189 states and 133237 transitions. [2019-09-08 10:20:54,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:20:54,933 INFO L276 IsEmpty]: Start isEmpty. Operand 101189 states and 133237 transitions. [2019-09-08 10:20:54,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 10:20:54,944 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:20:54,944 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:20:54,944 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:20:54,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:20:54,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1083848738, now seen corresponding path program 1 times [2019-09-08 10:20:54,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:20:54,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:20:54,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:20:54,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:20:54,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:20:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:20:55,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:20:55,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:20:55,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:20:55,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:20:55,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:20:55,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:20:55,011 INFO L87 Difference]: Start difference. First operand 101189 states and 133237 transitions. Second operand 5 states. [2019-09-08 10:21:39,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:21:39,255 INFO L93 Difference]: Finished difference Result 292396 states and 383434 transitions. [2019-09-08 10:21:39,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 10:21:39,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-08 10:21:39,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:21:39,600 INFO L225 Difference]: With dead ends: 292396 [2019-09-08 10:21:39,600 INFO L226 Difference]: Without dead ends: 192010 [2019-09-08 10:21:39,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:21:39,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192010 states. [2019-09-08 10:22:06,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192010 to 125479. [2019-09-08 10:22:06,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125479 states. [2019-09-08 10:22:06,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125479 states to 125479 states and 161716 transitions. [2019-09-08 10:22:06,312 INFO L78 Accepts]: Start accepts. Automaton has 125479 states and 161716 transitions. Word has length 92 [2019-09-08 10:22:06,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:22:06,312 INFO L475 AbstractCegarLoop]: Abstraction has 125479 states and 161716 transitions. [2019-09-08 10:22:06,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:22:06,312 INFO L276 IsEmpty]: Start isEmpty. Operand 125479 states and 161716 transitions. [2019-09-08 10:22:06,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 10:22:06,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:22:06,331 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:22:06,332 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:22:06,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:22:06,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1080560380, now seen corresponding path program 1 times [2019-09-08 10:22:06,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:22:06,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:22:06,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:22:06,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:22:06,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:22:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:22:06,390 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 10:22:06,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:22:06,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:22:06,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:22:06,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:22:06,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:22:06,391 INFO L87 Difference]: Start difference. First operand 125479 states and 161716 transitions. Second operand 3 states. [2019-09-08 10:22:58,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:22:58,266 INFO L93 Difference]: Finished difference Result 361575 states and 464258 transitions. [2019-09-08 10:22:58,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:22:58,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-08 10:22:58,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:22:58,632 INFO L225 Difference]: With dead ends: 361575 [2019-09-08 10:22:58,632 INFO L226 Difference]: Without dead ends: 237051 [2019-09-08 10:22:58,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:22:58,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237051 states. [2019-09-08 10:23:38,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237051 to 170555. [2019-09-08 10:23:38,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170555 states. [2019-09-08 10:23:38,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170555 states to 170555 states and 215732 transitions. [2019-09-08 10:23:38,807 INFO L78 Accepts]: Start accepts. Automaton has 170555 states and 215732 transitions. Word has length 97 [2019-09-08 10:23:38,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:23:38,807 INFO L475 AbstractCegarLoop]: Abstraction has 170555 states and 215732 transitions. [2019-09-08 10:23:38,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:23:38,807 INFO L276 IsEmpty]: Start isEmpty. Operand 170555 states and 215732 transitions. [2019-09-08 10:23:38,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 10:23:38,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:23:38,820 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 10:23:38,820 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:23:38,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:23:38,820 INFO L82 PathProgramCache]: Analyzing trace with hash 143028520, now seen corresponding path program 1 times [2019-09-08 10:23:38,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:23:38,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:23:38,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:38,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:23:38,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:23:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:23:38,874 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:23:38,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:23:38,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:23:38,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:23:38,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:23:38,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:23:38,876 INFO L87 Difference]: Start difference. First operand 170555 states and 215732 transitions. Second operand 3 states. [2019-09-08 10:24:29,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:24:29,301 INFO L93 Difference]: Finished difference Result 382903 states and 481618 transitions. [2019-09-08 10:24:29,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:24:29,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-08 10:24:29,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:24:29,609 INFO L225 Difference]: With dead ends: 382903 [2019-09-08 10:24:29,609 INFO L226 Difference]: Without dead ends: 213303 [2019-09-08 10:24:29,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:24:29,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213303 states. [2019-09-08 10:25:09,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213303 to 185161. [2019-09-08 10:25:09,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185161 states. [2019-09-08 10:25:10,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185161 states to 185161 states and 230164 transitions. [2019-09-08 10:25:10,096 INFO L78 Accepts]: Start accepts. Automaton has 185161 states and 230164 transitions. Word has length 98 [2019-09-08 10:25:10,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:25:10,096 INFO L475 AbstractCegarLoop]: Abstraction has 185161 states and 230164 transitions. [2019-09-08 10:25:10,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:25:10,096 INFO L276 IsEmpty]: Start isEmpty. Operand 185161 states and 230164 transitions. [2019-09-08 10:25:10,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 10:25:10,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:25:10,106 INFO L399 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] [2019-09-08 10:25:10,106 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:25:10,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:25:10,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1368780627, now seen corresponding path program 1 times [2019-09-08 10:25:10,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:25:10,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:25:10,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:25:10,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:25:10,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:25:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:25:10,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:25:10,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:25:10,228 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:25:10,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:25:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:25:10,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 10:25:10,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:25:11,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 10:25:11,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 10:25:11,906 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:25:11,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 10:25:11,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12] total 15 [2019-09-08 10:25:11,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 10:25:11,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 10:25:11,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-08 10:25:11,923 INFO L87 Difference]: Start difference. First operand 185161 states and 230164 transitions. Second operand 15 states. [2019-09-08 10:25:12,064 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-08 10:25:14,262 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-08 10:25:15,644 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-08 10:25:16,797 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-08 10:27:09,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:27:09,124 INFO L93 Difference]: Finished difference Result 600140 states and 747075 transitions. [2019-09-08 10:27:09,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 10:27:09,124 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 101 [2019-09-08 10:27:09,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:27:10,093 INFO L225 Difference]: With dead ends: 600140 [2019-09-08 10:27:10,093 INFO L226 Difference]: Without dead ends: 415934 [2019-09-08 10:27:10,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 80 SyntacticMatches, 12 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=296, Invalid=1110, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 10:27:10,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415934 states. [2019-09-08 10:28:10,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415934 to 243747. [2019-09-08 10:28:10,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243747 states. [2019-09-08 10:28:18,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243747 states to 243747 states and 303093 transitions. [2019-09-08 10:28:18,317 INFO L78 Accepts]: Start accepts. Automaton has 243747 states and 303093 transitions. Word has length 101 [2019-09-08 10:28:18,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:28:18,318 INFO L475 AbstractCegarLoop]: Abstraction has 243747 states and 303093 transitions. [2019-09-08 10:28:18,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 10:28:18,318 INFO L276 IsEmpty]: Start isEmpty. Operand 243747 states and 303093 transitions. [2019-09-08 10:28:18,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 10:28:18,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:28:18,352 INFO L399 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-09-08 10:28:18,352 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:28:18,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:28:18,353 INFO L82 PathProgramCache]: Analyzing trace with hash -498710089, now seen corresponding path program 1 times [2019-09-08 10:28:18,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:28:18,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:28:18,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:28:18,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:28:18,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:28:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:28:18,437 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 10:28:18,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:28:18,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:28:18,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:28:18,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:28:18,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:28:18,438 INFO L87 Difference]: Start difference. First operand 243747 states and 303093 transitions. Second operand 4 states.