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.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:55:43,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:55:43,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:55:43,350 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:55:43,351 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:55:43,352 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:55:43,353 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:55:43,355 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:55:43,357 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:55:43,358 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:55:43,359 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:55:43,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:55:43,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:55:43,361 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:55:43,362 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:55:43,363 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:55:43,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:55:43,365 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:55:43,367 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:55:43,369 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:55:43,371 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:55:43,372 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:55:43,373 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:55:43,374 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:55:43,382 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:55:43,383 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:55:43,383 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:55:43,389 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:55:43,389 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:55:43,390 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:55:43,390 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:55:43,391 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:55:43,392 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:55:43,392 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:55:43,395 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:55:43,395 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:55:43,396 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:55:43,396 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:55:43,397 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:55:43,398 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:55:43,398 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:55:43,399 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 14:55:43,428 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:55:43,431 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:55:43,432 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:55:43,432 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:55:43,433 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:55:43,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:55:43,434 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:55:43,434 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:55:43,435 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:55:43,435 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:55:43,436 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:55:43,436 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:55:43,437 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:55:43,437 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:55:43,437 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:55:43,437 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:55:43,438 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:55:43,438 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:55:43,438 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:55:43,438 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:55:43,439 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:55:43,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:55:43,439 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:55:43,440 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:55:43,440 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:55:43,440 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:55:43,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:55:43,441 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:55:43,441 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:55:43,502 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:55:43,519 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:55:43,523 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:55:43,525 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:55:43,525 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:55:43,526 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.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-02 14:55:43,593 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddedfca7a/686c10e410b5443bbeeb315c336d39e0/FLAGb5da7dbfa [2019-10-02 14:55:44,254 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:55:44,256 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-02 14:55:44,293 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddedfca7a/686c10e410b5443bbeeb315c336d39e0/FLAGb5da7dbfa [2019-10-02 14:55:44,419 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddedfca7a/686c10e410b5443bbeeb315c336d39e0 [2019-10-02 14:55:44,432 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:55:44,433 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:55:44,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:55:44,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:55:44,438 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:55:44,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:55:44" (1/1) ... [2019-10-02 14:55:44,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62309fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:44, skipping insertion in model container [2019-10-02 14:55:44,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:55:44" (1/1) ... [2019-10-02 14:55:44,451 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:55:44,614 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:55:45,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:55:45,775 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:55:46,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:55:46,117 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:55:46,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:46 WrapperNode [2019-10-02 14:55:46,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:55:46,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:55:46,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:55:46,119 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:55:46,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:46" (1/1) ... [2019-10-02 14:55:46,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:46" (1/1) ... [2019-10-02 14:55:46,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:46" (1/1) ... [2019-10-02 14:55:46,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:46" (1/1) ... [2019-10-02 14:55:46,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:46" (1/1) ... [2019-10-02 14:55:46,292 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:46" (1/1) ... [2019-10-02 14:55:46,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:46" (1/1) ... [2019-10-02 14:55:46,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:55:46,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:55:46,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:55:46,340 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:55:46,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:55:46,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:55:46,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:55:46,413 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:55:46,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:55:46,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-02 14:55:46,415 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-02 14:55:46,415 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-02 14:55:46,415 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-02 14:55:46,415 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 14:55:46,415 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-02 14:55:46,416 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-02 14:55:46,416 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-02 14:55:46,417 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-02 14:55:46,417 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-02 14:55:46,418 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-02 14:55:46,418 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-02 14:55:46,420 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:55:46,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:55:46,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:55:50,483 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:55:50,484 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 14:55:50,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:55:50 BoogieIcfgContainer [2019-10-02 14:55:50,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:55:50,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:55:50,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:55:50,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:55:50,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:55:44" (1/3) ... [2019-10-02 14:55:50,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ea5815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:55:50, skipping insertion in model container [2019-10-02 14:55:50,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:55:46" (2/3) ... [2019-10-02 14:55:50,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50ea5815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:55:50, skipping insertion in model container [2019-10-02 14:55:50,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:55:50" (3/3) ... [2019-10-02 14:55:50,495 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-02 14:55:50,505 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:55:50,515 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-02 14:55:50,533 INFO L252 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-02 14:55:50,572 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:55:50,573 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:55:50,573 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:55:50,573 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:55:50,573 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:55:50,573 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:55:50,573 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:55:50,574 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:55:50,574 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:55:50,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states. [2019-10-02 14:55:50,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 14:55:50,636 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:55:50,637 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:55:50,640 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:55:50,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:55:50,646 INFO L82 PathProgramCache]: Analyzing trace with hash -261683, now seen corresponding path program 1 times [2019-10-02 14:55:50,648 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:55:50,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:55:50,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:55:50,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:55:50,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:55:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:55:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:55:51,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:55:51,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:55:51,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:55:51,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:55:51,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:55:51,257 INFO L87 Difference]: Start difference. First operand 1259 states. Second operand 5 states. [2019-10-02 14:55:53,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:55:53,708 INFO L93 Difference]: Finished difference Result 2483 states and 4339 transitions. [2019-10-02 14:55:53,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:55:53,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-10-02 14:55:53,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:55:53,742 INFO L225 Difference]: With dead ends: 2483 [2019-10-02 14:55:53,742 INFO L226 Difference]: Without dead ends: 1562 [2019-10-02 14:55:53,754 INFO L640 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-10-02 14:55:53,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2019-10-02 14:55:53,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1556. [2019-10-02 14:55:53,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1556 states. [2019-10-02 14:55:53,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2098 transitions. [2019-10-02 14:55:53,906 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2098 transitions. Word has length 55 [2019-10-02 14:55:53,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:55:53,907 INFO L475 AbstractCegarLoop]: Abstraction has 1556 states and 2098 transitions. [2019-10-02 14:55:53,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:55:53,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2098 transitions. [2019-10-02 14:55:53,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 14:55:53,912 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:55:53,912 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:55:53,912 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:55:53,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:55:53,913 INFO L82 PathProgramCache]: Analyzing trace with hash -19234945, now seen corresponding path program 1 times [2019-10-02 14:55:53,913 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:55:53,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:55:53,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:55:53,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:55:53,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:55:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:55:54,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:55:54,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:55:54,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:55:54,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:55:54,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:55:54,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:55:54,079 INFO L87 Difference]: Start difference. First operand 1556 states and 2098 transitions. Second operand 6 states. [2019-10-02 14:55:55,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:55:55,626 INFO L93 Difference]: Finished difference Result 3394 states and 4672 transitions. [2019-10-02 14:55:55,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:55:55,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-02 14:55:55,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:55:55,640 INFO L225 Difference]: With dead ends: 3394 [2019-10-02 14:55:55,641 INFO L226 Difference]: Without dead ends: 2302 [2019-10-02 14:55:55,646 INFO L640 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-10-02 14:55:55,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2019-10-02 14:55:55,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2286. [2019-10-02 14:55:55,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2286 states. [2019-10-02 14:55:55,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2286 states to 2286 states and 3132 transitions. [2019-10-02 14:55:55,766 INFO L78 Accepts]: Start accepts. Automaton has 2286 states and 3132 transitions. Word has length 56 [2019-10-02 14:55:55,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:55:55,766 INFO L475 AbstractCegarLoop]: Abstraction has 2286 states and 3132 transitions. [2019-10-02 14:55:55,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:55:55,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2286 states and 3132 transitions. [2019-10-02 14:55:55,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 14:55:55,773 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:55:55,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:55:55,773 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:55:55,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:55:55,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1128300978, now seen corresponding path program 1 times [2019-10-02 14:55:55,774 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:55:55,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:55:55,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:55:55,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:55:55,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:55:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:55:55,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:55:55,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:55:55,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:55:55,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:55:55,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:55:55,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:55:55,948 INFO L87 Difference]: Start difference. First operand 2286 states and 3132 transitions. Second operand 6 states. [2019-10-02 14:55:57,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:55:57,733 INFO L93 Difference]: Finished difference Result 5902 states and 8156 transitions. [2019-10-02 14:55:57,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:55:57,734 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-10-02 14:55:57,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:55:57,757 INFO L225 Difference]: With dead ends: 5902 [2019-10-02 14:55:57,757 INFO L226 Difference]: Without dead ends: 4341 [2019-10-02 14:55:57,763 INFO L640 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-10-02 14:55:57,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4341 states. [2019-10-02 14:55:57,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4341 to 4321. [2019-10-02 14:55:57,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2019-10-02 14:55:57,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 5977 transitions. [2019-10-02 14:55:57,970 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 5977 transitions. Word has length 56 [2019-10-02 14:55:57,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:55:57,971 INFO L475 AbstractCegarLoop]: Abstraction has 4321 states and 5977 transitions. [2019-10-02 14:55:57,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:55:57,971 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 5977 transitions. [2019-10-02 14:55:57,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 14:55:57,975 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:55:57,976 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:55:57,976 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:55:57,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:55:57,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1514896090, now seen corresponding path program 1 times [2019-10-02 14:55:57,977 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:55:57,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:55:57,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:55:57,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:55:57,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:55:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:55:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:55:58,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:55:58,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:55:58,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:55:58,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:55:58,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:55:58,250 INFO L87 Difference]: Start difference. First operand 4321 states and 5977 transitions. Second operand 9 states. [2019-10-02 14:56:02,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:02,317 INFO L93 Difference]: Finished difference Result 8366 states and 12155 transitions. [2019-10-02 14:56:02,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 14:56:02,318 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-10-02 14:56:02,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:02,358 INFO L225 Difference]: With dead ends: 8366 [2019-10-02 14:56:02,358 INFO L226 Difference]: Without dead ends: 8361 [2019-10-02 14:56:02,362 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-10-02 14:56:02,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8361 states. [2019-10-02 14:56:02,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8361 to 4321. [2019-10-02 14:56:02,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2019-10-02 14:56:02,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 5976 transitions. [2019-10-02 14:56:02,624 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 5976 transitions. Word has length 57 [2019-10-02 14:56:02,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:02,625 INFO L475 AbstractCegarLoop]: Abstraction has 4321 states and 5976 transitions. [2019-10-02 14:56:02,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:56:02,625 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 5976 transitions. [2019-10-02 14:56:02,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 14:56:02,629 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:02,629 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:56:02,630 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:02,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:02,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1846472251, now seen corresponding path program 1 times [2019-10-02 14:56:02,630 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:02,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:02,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:02,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:02,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:02,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:02,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:02,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 14:56:02,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:56:02,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:56:02,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:56:02,821 INFO L87 Difference]: Start difference. First operand 4321 states and 5976 transitions. Second operand 9 states. [2019-10-02 14:56:07,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:07,237 INFO L93 Difference]: Finished difference Result 12184 states and 17666 transitions. [2019-10-02 14:56:07,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 14:56:07,238 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-10-02 14:56:07,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:07,297 INFO L225 Difference]: With dead ends: 12184 [2019-10-02 14:56:07,297 INFO L226 Difference]: Without dead ends: 11066 [2019-10-02 14:56:07,304 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-10-02 14:56:07,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11066 states. [2019-10-02 14:56:07,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11066 to 4321. [2019-10-02 14:56:07,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2019-10-02 14:56:07,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 5975 transitions. [2019-10-02 14:56:07,630 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 5975 transitions. Word has length 57 [2019-10-02 14:56:07,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:07,631 INFO L475 AbstractCegarLoop]: Abstraction has 4321 states and 5975 transitions. [2019-10-02 14:56:07,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:56:07,631 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 5975 transitions. [2019-10-02 14:56:07,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 14:56:07,639 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:07,639 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:56:07,639 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:07,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:07,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1057258768, now seen corresponding path program 1 times [2019-10-02 14:56:07,640 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:07,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:07,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:07,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:07,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:07,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:07,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:07,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 14:56:07,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:56:07,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:56:07,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:56:07,868 INFO L87 Difference]: Start difference. First operand 4321 states and 5975 transitions. Second operand 8 states. [2019-10-02 14:56:11,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:11,182 INFO L93 Difference]: Finished difference Result 9393 states and 13829 transitions. [2019-10-02 14:56:11,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 14:56:11,183 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-10-02 14:56:11,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:11,202 INFO L225 Difference]: With dead ends: 9393 [2019-10-02 14:56:11,202 INFO L226 Difference]: Without dead ends: 8067 [2019-10-02 14:56:11,210 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:56:11,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8067 states. [2019-10-02 14:56:11,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8067 to 4321. [2019-10-02 14:56:11,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4321 states. [2019-10-02 14:56:11,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4321 states to 4321 states and 5974 transitions. [2019-10-02 14:56:11,601 INFO L78 Accepts]: Start accepts. Automaton has 4321 states and 5974 transitions. Word has length 57 [2019-10-02 14:56:11,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:11,602 INFO L475 AbstractCegarLoop]: Abstraction has 4321 states and 5974 transitions. [2019-10-02 14:56:11,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:56:11,602 INFO L276 IsEmpty]: Start isEmpty. Operand 4321 states and 5974 transitions. [2019-10-02 14:56:11,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 14:56:11,606 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:11,606 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:56:11,607 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:11,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:11,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1610727569, now seen corresponding path program 1 times [2019-10-02 14:56:11,607 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:11,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:11,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:11,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:11,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:11,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:11,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:11,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:56:11,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:56:11,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:56:11,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:11,716 INFO L87 Difference]: Start difference. First operand 4321 states and 5974 transitions. Second operand 3 states. [2019-10-02 14:56:12,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:12,293 INFO L93 Difference]: Finished difference Result 8351 states and 11768 transitions. [2019-10-02 14:56:12,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:56:12,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-02 14:56:12,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:12,309 INFO L225 Difference]: With dead ends: 8351 [2019-10-02 14:56:12,309 INFO L226 Difference]: Without dead ends: 5831 [2019-10-02 14:56:12,317 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:12,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5831 states. [2019-10-02 14:56:12,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5831 to 5825. [2019-10-02 14:56:12,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5825 states. [2019-10-02 14:56:12,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5825 states to 5825 states and 7963 transitions. [2019-10-02 14:56:12,672 INFO L78 Accepts]: Start accepts. Automaton has 5825 states and 7963 transitions. Word has length 58 [2019-10-02 14:56:12,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:12,674 INFO L475 AbstractCegarLoop]: Abstraction has 5825 states and 7963 transitions. [2019-10-02 14:56:12,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:56:12,674 INFO L276 IsEmpty]: Start isEmpty. Operand 5825 states and 7963 transitions. [2019-10-02 14:56:12,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 14:56:12,679 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:12,679 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:56:12,679 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:12,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:12,680 INFO L82 PathProgramCache]: Analyzing trace with hash 616197657, now seen corresponding path program 1 times [2019-10-02 14:56:12,680 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:12,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:12,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:12,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:12,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:12,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:12,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:12,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:56:12,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:56:12,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:56:12,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:12,763 INFO L87 Difference]: Start difference. First operand 5825 states and 7963 transitions. Second operand 3 states. [2019-10-02 14:56:13,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:13,359 INFO L93 Difference]: Finished difference Result 9254 states and 13261 transitions. [2019-10-02 14:56:13,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:56:13,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-02 14:56:13,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:13,374 INFO L225 Difference]: With dead ends: 9254 [2019-10-02 14:56:13,375 INFO L226 Difference]: Without dead ends: 6946 [2019-10-02 14:56:13,381 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:13,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2019-10-02 14:56:13,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 6354. [2019-10-02 14:56:13,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6354 states. [2019-10-02 14:56:13,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6354 states to 6354 states and 8829 transitions. [2019-10-02 14:56:13,892 INFO L78 Accepts]: Start accepts. Automaton has 6354 states and 8829 transitions. Word has length 58 [2019-10-02 14:56:13,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:13,893 INFO L475 AbstractCegarLoop]: Abstraction has 6354 states and 8829 transitions. [2019-10-02 14:56:13,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:56:13,893 INFO L276 IsEmpty]: Start isEmpty. Operand 6354 states and 8829 transitions. [2019-10-02 14:56:13,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-02 14:56:13,899 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:13,899 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:56:13,900 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:13,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:13,900 INFO L82 PathProgramCache]: Analyzing trace with hash -700313303, now seen corresponding path program 1 times [2019-10-02 14:56:13,900 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:13,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:13,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:13,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:13,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:13,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:13,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:13,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:56:13,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:56:13,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:56:13,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:13,993 INFO L87 Difference]: Start difference. First operand 6354 states and 8829 transitions. Second operand 3 states. [2019-10-02 14:56:14,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:14,577 INFO L93 Difference]: Finished difference Result 11578 states and 16758 transitions. [2019-10-02 14:56:14,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:56:14,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-02 14:56:14,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:14,593 INFO L225 Difference]: With dead ends: 11578 [2019-10-02 14:56:14,593 INFO L226 Difference]: Without dead ends: 8287 [2019-10-02 14:56:14,602 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:14,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8287 states. [2019-10-02 14:56:15,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8287 to 7385. [2019-10-02 14:56:15,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7385 states. [2019-10-02 14:56:15,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7385 states to 7385 states and 10353 transitions. [2019-10-02 14:56:15,175 INFO L78 Accepts]: Start accepts. Automaton has 7385 states and 10353 transitions. Word has length 58 [2019-10-02 14:56:15,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:15,175 INFO L475 AbstractCegarLoop]: Abstraction has 7385 states and 10353 transitions. [2019-10-02 14:56:15,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:56:15,175 INFO L276 IsEmpty]: Start isEmpty. Operand 7385 states and 10353 transitions. [2019-10-02 14:56:15,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 14:56:15,184 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:15,185 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:56:15,185 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:15,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:15,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1592896813, now seen corresponding path program 1 times [2019-10-02 14:56:15,185 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:15,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:15,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:15,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:15,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:15,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:15,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:15,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:56:15,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:56:15,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:56:15,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:15,248 INFO L87 Difference]: Start difference. First operand 7385 states and 10353 transitions. Second operand 3 states. [2019-10-02 14:56:16,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:16,268 INFO L93 Difference]: Finished difference Result 14377 states and 20411 transitions. [2019-10-02 14:56:16,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:56:16,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-02 14:56:16,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:16,285 INFO L225 Difference]: With dead ends: 14377 [2019-10-02 14:56:16,285 INFO L226 Difference]: Without dead ends: 7581 [2019-10-02 14:56:16,306 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:16,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7581 states. [2019-10-02 14:56:16,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7581 to 6187. [2019-10-02 14:56:16,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6187 states. [2019-10-02 14:56:16,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6187 states to 6187 states and 8753 transitions. [2019-10-02 14:56:16,976 INFO L78 Accepts]: Start accepts. Automaton has 6187 states and 8753 transitions. Word has length 59 [2019-10-02 14:56:16,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:16,976 INFO L475 AbstractCegarLoop]: Abstraction has 6187 states and 8753 transitions. [2019-10-02 14:56:16,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:56:16,978 INFO L276 IsEmpty]: Start isEmpty. Operand 6187 states and 8753 transitions. [2019-10-02 14:56:16,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 14:56:16,981 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:16,981 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:56:16,982 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:16,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:16,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1119557590, now seen corresponding path program 1 times [2019-10-02 14:56:16,983 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:16,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:16,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:16,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:16,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:17,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:17,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:17,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:56:17,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:56:17,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:56:17,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:17,097 INFO L87 Difference]: Start difference. First operand 6187 states and 8753 transitions. Second operand 3 states. [2019-10-02 14:56:18,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:18,055 INFO L93 Difference]: Finished difference Result 13899 states and 20290 transitions. [2019-10-02 14:56:18,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:56:18,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-02 14:56:18,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:18,073 INFO L225 Difference]: With dead ends: 13899 [2019-10-02 14:56:18,073 INFO L226 Difference]: Without dead ends: 8813 [2019-10-02 14:56:18,085 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:18,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8813 states. [2019-10-02 14:56:18,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8813 to 7035. [2019-10-02 14:56:18,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7035 states. [2019-10-02 14:56:18,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7035 states to 7035 states and 10173 transitions. [2019-10-02 14:56:18,663 INFO L78 Accepts]: Start accepts. Automaton has 7035 states and 10173 transitions. Word has length 59 [2019-10-02 14:56:18,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:18,663 INFO L475 AbstractCegarLoop]: Abstraction has 7035 states and 10173 transitions. [2019-10-02 14:56:18,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:56:18,663 INFO L276 IsEmpty]: Start isEmpty. Operand 7035 states and 10173 transitions. [2019-10-02 14:56:18,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 14:56:18,666 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:18,666 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:56:18,666 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:18,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:18,667 INFO L82 PathProgramCache]: Analyzing trace with hash 926744535, now seen corresponding path program 1 times [2019-10-02 14:56:18,667 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:18,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:18,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:18,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:18,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:18,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:18,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:18,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:56:18,731 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:56:18,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:56:18,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:18,732 INFO L87 Difference]: Start difference. First operand 7035 states and 10173 transitions. Second operand 3 states. [2019-10-02 14:56:20,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:20,096 INFO L93 Difference]: Finished difference Result 17264 states and 25514 transitions. [2019-10-02 14:56:20,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:56:20,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-02 14:56:20,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:20,119 INFO L225 Difference]: With dead ends: 17264 [2019-10-02 14:56:20,120 INFO L226 Difference]: Without dead ends: 10987 [2019-10-02 14:56:20,133 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:56:20,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10987 states. [2019-10-02 14:56:20,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10987 to 8587. [2019-10-02 14:56:20,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8587 states. [2019-10-02 14:56:20,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8587 states to 8587 states and 12623 transitions. [2019-10-02 14:56:20,922 INFO L78 Accepts]: Start accepts. Automaton has 8587 states and 12623 transitions. Word has length 59 [2019-10-02 14:56:20,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:20,922 INFO L475 AbstractCegarLoop]: Abstraction has 8587 states and 12623 transitions. [2019-10-02 14:56:20,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:56:20,923 INFO L276 IsEmpty]: Start isEmpty. Operand 8587 states and 12623 transitions. [2019-10-02 14:56:20,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 14:56:20,925 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:20,925 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:56:20,926 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:20,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:20,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1408819210, now seen corresponding path program 1 times [2019-10-02 14:56:20,926 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:20,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:20,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:20,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:20,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:21,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:21,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:21,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 14:56:21,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 14:56:21,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 14:56:21,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:56:21,699 INFO L87 Difference]: Start difference. First operand 8587 states and 12623 transitions. Second operand 19 states. [2019-10-02 14:56:21,908 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-10-02 14:56:22,823 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-10-02 14:56:23,065 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-10-02 14:56:23,378 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-10-02 14:56:23,569 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-10-02 14:56:23,868 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-10-02 14:56:24,803 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-10-02 14:56:25,783 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-10-02 14:56:28,897 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-10-02 14:56:34,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:34,344 INFO L93 Difference]: Finished difference Result 31080 states and 46398 transitions. [2019-10-02 14:56:34,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 14:56:34,345 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2019-10-02 14:56:34,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:34,382 INFO L225 Difference]: With dead ends: 31080 [2019-10-02 14:56:34,383 INFO L226 Difference]: Without dead ends: 31076 [2019-10-02 14:56:34,392 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=310, Invalid=1412, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 14:56:34,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31076 states. [2019-10-02 14:56:35,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31076 to 8587. [2019-10-02 14:56:35,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8587 states. [2019-10-02 14:56:35,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8587 states to 8587 states and 12622 transitions. [2019-10-02 14:56:35,356 INFO L78 Accepts]: Start accepts. Automaton has 8587 states and 12622 transitions. Word has length 60 [2019-10-02 14:56:35,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:35,356 INFO L475 AbstractCegarLoop]: Abstraction has 8587 states and 12622 transitions. [2019-10-02 14:56:35,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 14:56:35,356 INFO L276 IsEmpty]: Start isEmpty. Operand 8587 states and 12622 transitions. [2019-10-02 14:56:35,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 14:56:35,358 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:35,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:56:35,358 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:35,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:35,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1965728590, now seen corresponding path program 1 times [2019-10-02 14:56:35,358 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:35,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:35,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:35,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:35,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:35,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:35,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:35,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 14:56:35,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 14:56:35,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 14:56:35,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:56:35,938 INFO L87 Difference]: Start difference. First operand 8587 states and 12622 transitions. Second operand 19 states. [2019-10-02 14:56:36,170 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2019-10-02 14:56:37,075 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-10-02 14:56:38,322 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-10-02 14:56:38,542 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-10-02 14:56:45,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:45,484 INFO L93 Difference]: Finished difference Result 18907 states and 28010 transitions. [2019-10-02 14:56:45,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 14:56:45,484 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2019-10-02 14:56:45,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:45,507 INFO L225 Difference]: With dead ends: 18907 [2019-10-02 14:56:45,507 INFO L226 Difference]: Without dead ends: 18903 [2019-10-02 14:56:45,513 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=311, Invalid=1249, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 14:56:45,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18903 states. [2019-10-02 14:56:46,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18903 to 8587. [2019-10-02 14:56:46,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8587 states. [2019-10-02 14:56:46,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8587 states to 8587 states and 12621 transitions. [2019-10-02 14:56:46,518 INFO L78 Accepts]: Start accepts. Automaton has 8587 states and 12621 transitions. Word has length 60 [2019-10-02 14:56:46,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:46,518 INFO L475 AbstractCegarLoop]: Abstraction has 8587 states and 12621 transitions. [2019-10-02 14:56:46,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 14:56:46,518 INFO L276 IsEmpty]: Start isEmpty. Operand 8587 states and 12621 transitions. [2019-10-02 14:56:46,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 14:56:46,519 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:46,520 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:56:46,520 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:46,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:46,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1464680332, now seen corresponding path program 1 times [2019-10-02 14:56:46,520 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:46,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:46,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:46,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:46,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:47,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:47,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:47,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 14:56:47,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 14:56:47,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 14:56:47,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:56:47,313 INFO L87 Difference]: Start difference. First operand 8587 states and 12621 transitions. Second operand 19 states. [2019-10-02 14:56:47,558 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-10-02 14:56:48,373 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-10-02 14:56:48,623 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-10-02 14:56:48,911 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-10-02 14:56:49,100 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-10-02 14:56:49,390 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-10-02 14:56:49,602 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-10-02 14:56:49,833 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-10-02 14:56:50,278 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-10-02 14:56:50,498 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-10-02 14:56:57,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:56:57,667 INFO L93 Difference]: Finished difference Result 22839 states and 34049 transitions. [2019-10-02 14:56:57,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 14:56:57,668 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2019-10-02 14:56:57,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:56:57,689 INFO L225 Difference]: With dead ends: 22839 [2019-10-02 14:56:57,689 INFO L226 Difference]: Without dead ends: 22833 [2019-10-02 14:56:57,693 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=335, Invalid=1147, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 14:56:57,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22833 states. [2019-10-02 14:56:58,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22833 to 8587. [2019-10-02 14:56:58,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8587 states. [2019-10-02 14:56:58,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8587 states to 8587 states and 12620 transitions. [2019-10-02 14:56:58,699 INFO L78 Accepts]: Start accepts. Automaton has 8587 states and 12620 transitions. Word has length 60 [2019-10-02 14:56:58,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:56:58,699 INFO L475 AbstractCegarLoop]: Abstraction has 8587 states and 12620 transitions. [2019-10-02 14:56:58,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 14:56:58,699 INFO L276 IsEmpty]: Start isEmpty. Operand 8587 states and 12620 transitions. [2019-10-02 14:56:58,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 14:56:58,700 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:56:58,701 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:56:58,701 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:56:58,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:56:58,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1506240748, now seen corresponding path program 1 times [2019-10-02 14:56:58,701 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:56:58,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:56:58,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:58,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:56:58,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:56:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:56:59,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:56:59,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:56:59,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 14:56:59,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:56:59,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:56:59,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:56:59,136 INFO L87 Difference]: Start difference. First operand 8587 states and 12620 transitions. Second operand 11 states. [2019-10-02 14:56:59,756 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-10-02 14:57:00,049 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-10-02 14:57:00,316 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-10-02 14:57:06,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:06,941 INFO L93 Difference]: Finished difference Result 33471 states and 49641 transitions. [2019-10-02 14:57:06,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 14:57:06,941 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2019-10-02 14:57:06,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:06,975 INFO L225 Difference]: With dead ends: 33471 [2019-10-02 14:57:06,975 INFO L226 Difference]: Without dead ends: 32986 [2019-10-02 14:57:06,983 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=259, Invalid=671, Unknown=0, NotChecked=0, Total=930 [2019-10-02 14:57:07,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32986 states. [2019-10-02 14:57:08,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32986 to 8472. [2019-10-02 14:57:08,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8472 states. [2019-10-02 14:57:08,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8472 states to 8472 states and 12474 transitions. [2019-10-02 14:57:08,333 INFO L78 Accepts]: Start accepts. Automaton has 8472 states and 12474 transitions. Word has length 60 [2019-10-02 14:57:08,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:08,333 INFO L475 AbstractCegarLoop]: Abstraction has 8472 states and 12474 transitions. [2019-10-02 14:57:08,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:57:08,334 INFO L276 IsEmpty]: Start isEmpty. Operand 8472 states and 12474 transitions. [2019-10-02 14:57:08,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-02 14:57:08,335 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:08,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:08,335 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:08,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:08,336 INFO L82 PathProgramCache]: Analyzing trace with hash 818671798, now seen corresponding path program 1 times [2019-10-02 14:57:08,336 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:08,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:08,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:08,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:08,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:08,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:08,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:08,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 14:57:08,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 14:57:08,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 14:57:08,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-10-02 14:57:08,905 INFO L87 Difference]: Start difference. First operand 8472 states and 12474 transitions. Second operand 13 states. [2019-10-02 14:57:09,499 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-10-02 14:57:12,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:12,749 INFO L93 Difference]: Finished difference Result 13770 states and 20231 transitions. [2019-10-02 14:57:12,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 14:57:12,750 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2019-10-02 14:57:12,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:12,762 INFO L225 Difference]: With dead ends: 13770 [2019-10-02 14:57:12,762 INFO L226 Difference]: Without dead ends: 13351 [2019-10-02 14:57:12,766 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-10-02 14:57:12,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13351 states. [2019-10-02 14:57:13,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13351 to 8427. [2019-10-02 14:57:13,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8427 states. [2019-10-02 14:57:13,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8427 states to 8427 states and 12412 transitions. [2019-10-02 14:57:13,935 INFO L78 Accepts]: Start accepts. Automaton has 8427 states and 12412 transitions. Word has length 61 [2019-10-02 14:57:13,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:13,936 INFO L475 AbstractCegarLoop]: Abstraction has 8427 states and 12412 transitions. [2019-10-02 14:57:13,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 14:57:13,936 INFO L276 IsEmpty]: Start isEmpty. Operand 8427 states and 12412 transitions. [2019-10-02 14:57:13,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-02 14:57:13,938 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:13,938 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:13,939 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:13,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:13,939 INFO L82 PathProgramCache]: Analyzing trace with hash 624248826, now seen corresponding path program 1 times [2019-10-02 14:57:13,939 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:13,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:13,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:13,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:13,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:14,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:14,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:14,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:57:14,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:57:14,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:57:14,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:57:14,029 INFO L87 Difference]: Start difference. First operand 8427 states and 12412 transitions. Second operand 6 states. [2019-10-02 14:57:19,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:19,331 INFO L93 Difference]: Finished difference Result 37004 states and 54794 transitions. [2019-10-02 14:57:19,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:57:19,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-10-02 14:57:19,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:19,363 INFO L225 Difference]: With dead ends: 37004 [2019-10-02 14:57:19,364 INFO L226 Difference]: Without dead ends: 29372 [2019-10-02 14:57:19,380 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:57:19,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29372 states. [2019-10-02 14:57:23,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29372 to 25784. [2019-10-02 14:57:23,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25784 states. [2019-10-02 14:57:23,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25784 states to 25784 states and 37276 transitions. [2019-10-02 14:57:23,536 INFO L78 Accepts]: Start accepts. Automaton has 25784 states and 37276 transitions. Word has length 67 [2019-10-02 14:57:23,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:23,536 INFO L475 AbstractCegarLoop]: Abstraction has 25784 states and 37276 transitions. [2019-10-02 14:57:23,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:57:23,536 INFO L276 IsEmpty]: Start isEmpty. Operand 25784 states and 37276 transitions. [2019-10-02 14:57:23,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-02 14:57:23,540 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:23,540 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:23,541 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:23,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:23,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1849830759, now seen corresponding path program 1 times [2019-10-02 14:57:23,541 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:23,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:23,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:23,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:23,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:23,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:23,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:23,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:57:23,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:57:23,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:57:23,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:57:23,639 INFO L87 Difference]: Start difference. First operand 25784 states and 37276 transitions. Second operand 5 states. [2019-10-02 14:57:28,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:28,664 INFO L93 Difference]: Finished difference Result 52858 states and 76569 transitions. [2019-10-02 14:57:28,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:57:28,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-10-02 14:57:28,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:28,693 INFO L225 Difference]: With dead ends: 52858 [2019-10-02 14:57:28,693 INFO L226 Difference]: Without dead ends: 27844 [2019-10-02 14:57:28,720 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:57:28,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27844 states. [2019-10-02 14:57:33,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27844 to 24874. [2019-10-02 14:57:33,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24874 states. [2019-10-02 14:57:33,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24874 states to 24874 states and 35771 transitions. [2019-10-02 14:57:33,101 INFO L78 Accepts]: Start accepts. Automaton has 24874 states and 35771 transitions. Word has length 68 [2019-10-02 14:57:33,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:33,101 INFO L475 AbstractCegarLoop]: Abstraction has 24874 states and 35771 transitions. [2019-10-02 14:57:33,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:57:33,101 INFO L276 IsEmpty]: Start isEmpty. Operand 24874 states and 35771 transitions. [2019-10-02 14:57:33,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-02 14:57:33,106 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:33,106 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:33,106 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:33,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:33,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1871092716, now seen corresponding path program 1 times [2019-10-02 14:57:33,107 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:33,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:33,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:33,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:33,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:33,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:33,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:33,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:57:33,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:57:33,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:57:33,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:57:33,210 INFO L87 Difference]: Start difference. First operand 24874 states and 35771 transitions. Second operand 6 states. [2019-10-02 14:57:42,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:42,237 INFO L93 Difference]: Finished difference Result 43440 states and 61607 transitions. [2019-10-02 14:57:42,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:57:42,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-10-02 14:57:42,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:42,283 INFO L225 Difference]: With dead ends: 43440 [2019-10-02 14:57:42,284 INFO L226 Difference]: Without dead ends: 43438 [2019-10-02 14:57:42,292 INFO L640 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-10-02 14:57:42,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43438 states. [2019-10-02 14:57:47,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43438 to 25714. [2019-10-02 14:57:47,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25714 states. [2019-10-02 14:57:47,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25714 states to 25714 states and 36421 transitions. [2019-10-02 14:57:47,157 INFO L78 Accepts]: Start accepts. Automaton has 25714 states and 36421 transitions. Word has length 70 [2019-10-02 14:57:47,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:57:47,158 INFO L475 AbstractCegarLoop]: Abstraction has 25714 states and 36421 transitions. [2019-10-02 14:57:47,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:57:47,158 INFO L276 IsEmpty]: Start isEmpty. Operand 25714 states and 36421 transitions. [2019-10-02 14:57:47,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-02 14:57:47,163 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:57:47,163 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:57:47,164 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:57:47,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:57:47,164 INFO L82 PathProgramCache]: Analyzing trace with hash -2055411099, now seen corresponding path program 1 times [2019-10-02 14:57:47,164 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:57:47,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:57:47,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:47,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:57:47,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:57:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:57:47,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:57:47,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:57:47,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:57:47,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:57:47,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:57:47,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:57:47,226 INFO L87 Difference]: Start difference. First operand 25714 states and 36421 transitions. Second operand 3 states. [2019-10-02 14:57:56,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:57:56,338 INFO L93 Difference]: Finished difference Result 69254 states and 98280 transitions. [2019-10-02 14:57:56,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:57:56,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-10-02 14:57:56,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:57:56,388 INFO L225 Difference]: With dead ends: 69254 [2019-10-02 14:57:56,388 INFO L226 Difference]: Without dead ends: 44266 [2019-10-02 14:57:56,416 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:57:56,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44266 states. [2019-10-02 14:58:04,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44266 to 43660. [2019-10-02 14:58:04,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43660 states. [2019-10-02 14:58:04,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43660 states to 43660 states and 61062 transitions. [2019-10-02 14:58:04,799 INFO L78 Accepts]: Start accepts. Automaton has 43660 states and 61062 transitions. Word has length 71 [2019-10-02 14:58:04,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:04,800 INFO L475 AbstractCegarLoop]: Abstraction has 43660 states and 61062 transitions. [2019-10-02 14:58:04,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:58:04,800 INFO L276 IsEmpty]: Start isEmpty. Operand 43660 states and 61062 transitions. [2019-10-02 14:58:04,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-02 14:58:04,804 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:04,804 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:58:04,805 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:04,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:04,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1175358734, now seen corresponding path program 1 times [2019-10-02 14:58:04,805 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:04,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:04,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:04,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:04,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:04,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:04,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:04,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:58:04,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:58:04,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:58:04,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:58:04,890 INFO L87 Difference]: Start difference. First operand 43660 states and 61062 transitions. Second operand 3 states. [2019-10-02 14:58:13,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:13,786 INFO L93 Difference]: Finished difference Result 53156 states and 74236 transitions. [2019-10-02 14:58:13,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:58:13,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-10-02 14:58:13,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:13,843 INFO L225 Difference]: With dead ends: 53156 [2019-10-02 14:58:13,843 INFO L226 Difference]: Without dead ends: 43645 [2019-10-02 14:58:13,860 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:58:13,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43645 states. [2019-10-02 14:58:20,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43645 to 33345. [2019-10-02 14:58:20,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33345 states. [2019-10-02 14:58:20,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33345 states to 33345 states and 46179 transitions. [2019-10-02 14:58:20,828 INFO L78 Accepts]: Start accepts. Automaton has 33345 states and 46179 transitions. Word has length 72 [2019-10-02 14:58:20,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:20,828 INFO L475 AbstractCegarLoop]: Abstraction has 33345 states and 46179 transitions. [2019-10-02 14:58:20,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:58:20,828 INFO L276 IsEmpty]: Start isEmpty. Operand 33345 states and 46179 transitions. [2019-10-02 14:58:20,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-02 14:58:20,833 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:20,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:58:20,833 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:20,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:20,833 INFO L82 PathProgramCache]: Analyzing trace with hash 353507174, now seen corresponding path program 1 times [2019-10-02 14:58:20,833 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:20,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:20,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:20,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:20,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:20,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:20,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:20,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:58:20,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:58:20,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:58:20,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:58:20,905 INFO L87 Difference]: Start difference. First operand 33345 states and 46179 transitions. Second operand 5 states. [2019-10-02 14:58:44,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:58:44,864 INFO L93 Difference]: Finished difference Result 136211 states and 189049 transitions. [2019-10-02 14:58:44,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:58:44,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-10-02 14:58:44,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:58:45,015 INFO L225 Difference]: With dead ends: 136211 [2019-10-02 14:58:45,016 INFO L226 Difference]: Without dead ends: 103584 [2019-10-02 14:58:45,052 INFO L640 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-10-02 14:58:45,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103584 states. [2019-10-02 14:58:56,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103584 to 55175. [2019-10-02 14:58:56,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55175 states. [2019-10-02 14:58:56,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55175 states to 55175 states and 75205 transitions. [2019-10-02 14:58:56,679 INFO L78 Accepts]: Start accepts. Automaton has 55175 states and 75205 transitions. Word has length 74 [2019-10-02 14:58:56,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:58:56,679 INFO L475 AbstractCegarLoop]: Abstraction has 55175 states and 75205 transitions. [2019-10-02 14:58:56,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:58:56,680 INFO L276 IsEmpty]: Start isEmpty. Operand 55175 states and 75205 transitions. [2019-10-02 14:58:56,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-02 14:58:56,684 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:58:56,685 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:58:56,685 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:58:56,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:58:56,685 INFO L82 PathProgramCache]: Analyzing trace with hash -2143339772, now seen corresponding path program 1 times [2019-10-02 14:58:56,685 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:58:56,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:58:56,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:56,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:58:56,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:58:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:58:56,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:58:56,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:58:56,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:58:56,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:58:56,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:58:56,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:58:56,760 INFO L87 Difference]: Start difference. First operand 55175 states and 75205 transitions. Second operand 5 states. [2019-10-02 14:59:34,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:59:34,074 INFO L93 Difference]: Finished difference Result 216527 states and 295199 transitions. [2019-10-02 14:59:34,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:59:34,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-02 14:59:34,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:59:34,290 INFO L225 Difference]: With dead ends: 216527 [2019-10-02 14:59:34,290 INFO L226 Difference]: Without dead ends: 162074 [2019-10-02 14:59:34,342 INFO L640 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-10-02 14:59:34,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162074 states. [2019-10-02 14:59:59,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162074 to 107782. [2019-10-02 14:59:59,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107782 states. [2019-10-02 14:59:59,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107782 states to 107782 states and 146321 transitions. [2019-10-02 14:59:59,385 INFO L78 Accepts]: Start accepts. Automaton has 107782 states and 146321 transitions. Word has length 77 [2019-10-02 14:59:59,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:59:59,386 INFO L475 AbstractCegarLoop]: Abstraction has 107782 states and 146321 transitions. [2019-10-02 14:59:59,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:59:59,386 INFO L276 IsEmpty]: Start isEmpty. Operand 107782 states and 146321 transitions. [2019-10-02 14:59:59,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-02 14:59:59,392 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:59:59,392 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:59:59,392 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:59:59,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:59:59,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1797768461, now seen corresponding path program 1 times [2019-10-02 14:59:59,393 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:59:59,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:59:59,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:59,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:59:59,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:59:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:59:59,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:59:59,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:59:59,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:59:59,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:59:59,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:59:59,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:59:59,469 INFO L87 Difference]: Start difference. First operand 107782 states and 146321 transitions. Second operand 3 states. [2019-10-02 15:00:24,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:00:24,890 INFO L93 Difference]: Finished difference Result 214332 states and 290161 transitions. [2019-10-02 15:00:24,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:00:24,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-10-02 15:00:24,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:00:25,038 INFO L225 Difference]: With dead ends: 214332 [2019-10-02 15:00:25,038 INFO L226 Difference]: Without dead ends: 107277 [2019-10-02 15:00:25,100 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:00:25,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107277 states. [2019-10-02 15:00:46,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107277 to 87926. [2019-10-02 15:00:46,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87926 states. [2019-10-02 15:00:47,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87926 states to 87926 states and 117028 transitions. [2019-10-02 15:00:47,008 INFO L78 Accepts]: Start accepts. Automaton has 87926 states and 117028 transitions. Word has length 79 [2019-10-02 15:00:47,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:00:47,008 INFO L475 AbstractCegarLoop]: Abstraction has 87926 states and 117028 transitions. [2019-10-02 15:00:47,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:00:47,009 INFO L276 IsEmpty]: Start isEmpty. Operand 87926 states and 117028 transitions. [2019-10-02 15:00:47,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-02 15:00:47,014 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:00:47,014 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:00:47,014 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:00:47,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:00:47,015 INFO L82 PathProgramCache]: Analyzing trace with hash 250147946, now seen corresponding path program 1 times [2019-10-02 15:00:47,015 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:00:47,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:00:47,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:47,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:00:47,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:00:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:00:47,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:00:47,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:00:47,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 15:00:47,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 15:00:47,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 15:00:47,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 15:00:47,147 INFO L87 Difference]: Start difference. First operand 87926 states and 117028 transitions. Second operand 6 states. [2019-10-02 15:01:13,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:01:13,017 INFO L93 Difference]: Finished difference Result 140720 states and 187617 transitions. [2019-10-02 15:01:13,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 15:01:13,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-10-02 15:01:13,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:01:13,145 INFO L225 Difference]: With dead ends: 140720 [2019-10-02 15:01:13,145 INFO L226 Difference]: Without dead ends: 108130 [2019-10-02 15:01:13,178 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:01:13,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108130 states. [2019-10-02 15:01:38,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108130 to 99710. [2019-10-02 15:01:38,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99710 states. [2019-10-02 15:01:38,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99710 states to 99710 states and 132370 transitions. [2019-10-02 15:01:38,600 INFO L78 Accepts]: Start accepts. Automaton has 99710 states and 132370 transitions. Word has length 82 [2019-10-02 15:01:38,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:01:38,601 INFO L475 AbstractCegarLoop]: Abstraction has 99710 states and 132370 transitions. [2019-10-02 15:01:38,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 15:01:38,601 INFO L276 IsEmpty]: Start isEmpty. Operand 99710 states and 132370 transitions. [2019-10-02 15:01:38,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-02 15:01:38,606 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:01:38,606 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:01:38,606 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:01:38,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:01:38,606 INFO L82 PathProgramCache]: Analyzing trace with hash 874030055, now seen corresponding path program 1 times [2019-10-02 15:01:38,607 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:01:38,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:01:38,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:38,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:01:38,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:01:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:01:38,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:01:38,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:01:38,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:01:38,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:01:38,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:01:38,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:01:38,684 INFO L87 Difference]: Start difference. First operand 99710 states and 132370 transitions. Second operand 3 states. [2019-10-02 15:02:09,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:02:09,402 INFO L93 Difference]: Finished difference Result 215164 states and 285018 transitions. [2019-10-02 15:02:09,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:02:09,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-10-02 15:02:09,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:02:09,551 INFO L225 Difference]: With dead ends: 215164 [2019-10-02 15:02:09,551 INFO L226 Difference]: Without dead ends: 116131 [2019-10-02 15:02:09,615 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:02:09,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116131 states. [2019-10-02 15:02:35,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116131 to 110798. [2019-10-02 15:02:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110798 states. [2019-10-02 15:02:35,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110798 states to 110798 states and 145506 transitions. [2019-10-02 15:02:35,800 INFO L78 Accepts]: Start accepts. Automaton has 110798 states and 145506 transitions. Word has length 82 [2019-10-02 15:02:35,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:02:35,800 INFO L475 AbstractCegarLoop]: Abstraction has 110798 states and 145506 transitions. [2019-10-02 15:02:35,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:02:35,801 INFO L276 IsEmpty]: Start isEmpty. Operand 110798 states and 145506 transitions. [2019-10-02 15:02:35,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-02 15:02:35,810 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:02:35,810 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:02:35,810 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:02:35,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:02:35,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1798700343, now seen corresponding path program 1 times [2019-10-02 15:02:35,811 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:02:35,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:02:35,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:35,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:02:35,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:02:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:02:35,870 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:02:35,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:02:35,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 15:02:35,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 15:02:35,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 15:02:35,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:02:35,872 INFO L87 Difference]: Start difference. First operand 110798 states and 145506 transitions. Second operand 3 states. [2019-10-02 15:03:27,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:03:27,568 INFO L93 Difference]: Finished difference Result 307876 states and 402298 transitions. [2019-10-02 15:03:27,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 15:03:27,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-10-02 15:03:27,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:03:27,847 INFO L225 Difference]: With dead ends: 307876 [2019-10-02 15:03:27,848 INFO L226 Difference]: Without dead ends: 197755 [2019-10-02 15:03:27,933 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 15:03:28,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197755 states. [2019-10-02 15:04:13,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197755 to 174095. [2019-10-02 15:04:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174095 states. [2019-10-02 15:04:14,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174095 states to 174095 states and 224332 transitions. [2019-10-02 15:04:14,216 INFO L78 Accepts]: Start accepts. Automaton has 174095 states and 224332 transitions. Word has length 90 [2019-10-02 15:04:14,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:04:14,216 INFO L475 AbstractCegarLoop]: Abstraction has 174095 states and 224332 transitions. [2019-10-02 15:04:14,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 15:04:14,216 INFO L276 IsEmpty]: Start isEmpty. Operand 174095 states and 224332 transitions. [2019-10-02 15:04:14,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-02 15:04:14,227 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:04:14,227 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:04:14,228 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:04:14,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:04:14,228 INFO L82 PathProgramCache]: Analyzing trace with hash 25741144, now seen corresponding path program 1 times [2019-10-02 15:04:14,228 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:04:14,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:04:14,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:04:14,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:04:14,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:04:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:04:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 15:04:14,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:04:14,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 15:04:14,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 15:04:14,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 15:04:14,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 15:04:14,386 INFO L87 Difference]: Start difference. First operand 174095 states and 224332 transitions. Second operand 9 states. [2019-10-02 15:06:10,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 15:06:10,778 INFO L93 Difference]: Finished difference Result 501821 states and 644715 transitions. [2019-10-02 15:06:10,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 15:06:10,778 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-10-02 15:06:10,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 15:06:11,412 INFO L225 Difference]: With dead ends: 501821 [2019-10-02 15:06:11,412 INFO L226 Difference]: Without dead ends: 442583 [2019-10-02 15:06:11,509 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2019-10-02 15:06:11,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442583 states. [2019-10-02 15:07:02,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442583 to 174080. [2019-10-02 15:07:02,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174080 states. [2019-10-02 15:07:03,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174080 states to 174080 states and 224316 transitions. [2019-10-02 15:07:03,048 INFO L78 Accepts]: Start accepts. Automaton has 174080 states and 224316 transitions. Word has length 92 [2019-10-02 15:07:03,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 15:07:03,048 INFO L475 AbstractCegarLoop]: Abstraction has 174080 states and 224316 transitions. [2019-10-02 15:07:03,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 15:07:03,049 INFO L276 IsEmpty]: Start isEmpty. Operand 174080 states and 224316 transitions. [2019-10-02 15:07:03,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-02 15:07:03,059 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 15:07:03,060 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 15:07:03,060 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 15:07:03,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 15:07:03,060 INFO L82 PathProgramCache]: Analyzing trace with hash -978519268, now seen corresponding path program 1 times [2019-10-02 15:07:03,060 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 15:07:03,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 15:07:03,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:07:03,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 15:07:03,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 15:07:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 15:07:03,308 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 15:07:03,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 15:07:03,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 15:07:03,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 15:07:03,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 15:07:03,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-02 15:07:03,309 INFO L87 Difference]: Start difference. First operand 174080 states and 224316 transitions. Second operand 10 states.