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/locks/test_locks_9.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:08:27,395 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:08:27,398 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:08:27,416 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:08:27,417 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:08:27,419 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:08:27,421 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:08:27,433 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:08:27,435 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:08:27,436 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:08:27,439 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:08:27,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:08:27,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:08:27,444 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:08:27,446 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:08:27,448 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:08:27,450 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:08:27,452 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:08:27,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:08:27,460 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:08:27,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:08:27,466 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:08:27,467 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:08:27,470 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:08:27,472 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:08:27,472 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:08:27,473 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:08:27,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:08:27,474 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:08:27,475 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:08:27,475 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:08:27,475 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:08:27,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:08:27,477 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:08:27,478 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:08:27,478 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:08:27,479 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:08:27,479 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:08:27,479 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:08:27,480 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:08:27,481 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:08:27,481 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 11:08:27,496 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:08:27,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:08:27,497 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:08:27,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:08:27,498 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:08:27,498 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:08:27,498 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:08:27,498 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:08:27,499 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:08:27,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:08:27,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:08:27,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:08:27,499 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:08:27,500 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:08:27,500 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:08:27,500 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:08:27,500 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:08:27,501 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:08:27,501 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:08:27,501 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:08:27,501 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:08:27,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:08:27,502 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:08:27,502 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:08:27,502 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:08:27,502 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:08:27,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:08:27,503 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:08:27,503 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:08:27,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:08:27,543 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:08:27,547 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:08:27,549 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:08:27,549 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:08:27,550 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_9.c [2019-10-02 11:08:27,612 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/669518286/94159508687540ca8b27e66d42a622f0/FLAG9423b08d1 [2019-10-02 11:08:28,074 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:08:28,075 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c [2019-10-02 11:08:28,083 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/669518286/94159508687540ca8b27e66d42a622f0/FLAG9423b08d1 [2019-10-02 11:08:28,487 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/669518286/94159508687540ca8b27e66d42a622f0 [2019-10-02 11:08:28,497 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:08:28,499 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:08:28,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:08:28,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:08:28,503 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:08:28,504 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:08:28" (1/1) ... [2019-10-02 11:08:28,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cae9bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:28, skipping insertion in model container [2019-10-02 11:08:28,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:08:28" (1/1) ... [2019-10-02 11:08:28,514 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:08:28,538 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:08:28,750 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:08:28,754 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:08:28,782 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:08:28,889 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:08:28,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:28 WrapperNode [2019-10-02 11:08:28,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:08:28,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:08:28,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:08:28,890 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:08:28,899 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:28" (1/1) ... [2019-10-02 11:08:28,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:28" (1/1) ... [2019-10-02 11:08:28,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:28" (1/1) ... [2019-10-02 11:08:28,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:28" (1/1) ... [2019-10-02 11:08:28,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:28" (1/1) ... [2019-10-02 11:08:28,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:28" (1/1) ... [2019-10-02 11:08:28,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:28" (1/1) ... [2019-10-02 11:08:28,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:08:28,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:08:28,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:08:28,921 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:08:28,922 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:28" (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 11:08:28,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:08:28,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:08:28,972 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:08:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:08:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:08:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:08:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:08:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:08:29,323 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:08:29,323 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 11:08:29,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:08:29 BoogieIcfgContainer [2019-10-02 11:08:29,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:08:29,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:08:29,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:08:29,329 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:08:29,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:08:28" (1/3) ... [2019-10-02 11:08:29,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@745bec6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:08:29, skipping insertion in model container [2019-10-02 11:08:29,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:08:28" (2/3) ... [2019-10-02 11:08:29,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@745bec6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:08:29, skipping insertion in model container [2019-10-02 11:08:29,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:08:29" (3/3) ... [2019-10-02 11:08:29,333 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2019-10-02 11:08:29,342 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:08:29,350 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:08:29,366 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:08:29,396 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:08:29,396 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:08:29,396 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:08:29,397 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:08:29,397 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:08:29,397 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:08:29,397 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:08:29,397 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:08:29,398 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:08:29,416 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-10-02 11:08:29,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-02 11:08:29,420 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:29,421 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:29,423 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:29,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:29,429 INFO L82 PathProgramCache]: Analyzing trace with hash 691982780, now seen corresponding path program 1 times [2019-10-02 11:08:29,431 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:29,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:29,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:29,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:29,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:29,606 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 11:08:29,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:29,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:29,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:29,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:29,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:29,630 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2019-10-02 11:08:29,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:29,687 INFO L93 Difference]: Finished difference Result 81 states and 138 transitions. [2019-10-02 11:08:29,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:29,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-02 11:08:29,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:29,703 INFO L225 Difference]: With dead ends: 81 [2019-10-02 11:08:29,703 INFO L226 Difference]: Without dead ends: 66 [2019-10-02 11:08:29,707 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 11:08:29,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-02 11:08:29,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-10-02 11:08:29,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-02 11:08:29,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2019-10-02 11:08:29,755 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 81 transitions. Word has length 19 [2019-10-02 11:08:29,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:29,756 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 81 transitions. [2019-10-02 11:08:29,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:29,756 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 81 transitions. [2019-10-02 11:08:29,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-02 11:08:29,757 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:29,758 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:08:29,758 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:29,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:29,759 INFO L82 PathProgramCache]: Analyzing trace with hash 950148218, now seen corresponding path program 1 times [2019-10-02 11:08:29,759 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:29,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:29,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:29,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:29,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:29,826 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 11:08:29,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:29,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:29,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:29,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:29,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:29,829 INFO L87 Difference]: Start difference. First operand 46 states and 81 transitions. Second operand 3 states. [2019-10-02 11:08:29,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:29,855 INFO L93 Difference]: Finished difference Result 107 states and 192 transitions. [2019-10-02 11:08:29,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:29,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-02 11:08:29,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:29,858 INFO L225 Difference]: With dead ends: 107 [2019-10-02 11:08:29,858 INFO L226 Difference]: Without dead ends: 66 [2019-10-02 11:08:29,859 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 11:08:29,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-02 11:08:29,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-10-02 11:08:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-02 11:08:29,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 113 transitions. [2019-10-02 11:08:29,871 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 113 transitions. Word has length 19 [2019-10-02 11:08:29,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:29,872 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 113 transitions. [2019-10-02 11:08:29,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:29,872 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 113 transitions. [2019-10-02 11:08:29,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:08:29,873 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:29,874 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] [2019-10-02 11:08:29,874 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:29,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:29,874 INFO L82 PathProgramCache]: Analyzing trace with hash -23156596, now seen corresponding path program 1 times [2019-10-02 11:08:29,875 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:29,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:29,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:29,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:29,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:29,935 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 11:08:29,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:29,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:29,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:29,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:29,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:29,937 INFO L87 Difference]: Start difference. First operand 64 states and 113 transitions. Second operand 3 states. [2019-10-02 11:08:29,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:29,971 INFO L93 Difference]: Finished difference Result 99 states and 171 transitions. [2019-10-02 11:08:29,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:29,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-02 11:08:29,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:29,976 INFO L225 Difference]: With dead ends: 99 [2019-10-02 11:08:29,977 INFO L226 Difference]: Without dead ends: 69 [2019-10-02 11:08:29,977 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 11:08:29,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-02 11:08:29,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-10-02 11:08:29,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-02 11:08:29,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 115 transitions. [2019-10-02 11:08:29,988 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 115 transitions. Word has length 20 [2019-10-02 11:08:29,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:29,989 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 115 transitions. [2019-10-02 11:08:29,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:29,990 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2019-10-02 11:08:29,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:08:29,993 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:29,993 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] [2019-10-02 11:08:29,993 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:29,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:29,994 INFO L82 PathProgramCache]: Analyzing trace with hash -609962610, now seen corresponding path program 1 times [2019-10-02 11:08:29,994 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:29,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:29,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:29,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:29,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:30,049 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 11:08:30,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:30,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:30,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:30,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:30,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:30,051 INFO L87 Difference]: Start difference. First operand 67 states and 115 transitions. Second operand 3 states. [2019-10-02 11:08:30,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:30,071 INFO L93 Difference]: Finished difference Result 124 states and 216 transitions. [2019-10-02 11:08:30,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:30,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-02 11:08:30,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:30,074 INFO L225 Difference]: With dead ends: 124 [2019-10-02 11:08:30,074 INFO L226 Difference]: Without dead ends: 122 [2019-10-02 11:08:30,075 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 11:08:30,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-02 11:08:30,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 88. [2019-10-02 11:08:30,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-02 11:08:30,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 152 transitions. [2019-10-02 11:08:30,093 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 152 transitions. Word has length 20 [2019-10-02 11:08:30,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:30,094 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 152 transitions. [2019-10-02 11:08:30,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:30,094 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2019-10-02 11:08:30,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 11:08:30,095 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:30,095 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] [2019-10-02 11:08:30,095 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:30,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:30,096 INFO L82 PathProgramCache]: Analyzing trace with hash -351797172, now seen corresponding path program 1 times [2019-10-02 11:08:30,096 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:30,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:30,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:30,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:30,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:30,136 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 11:08:30,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:30,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:30,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:30,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:30,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:30,137 INFO L87 Difference]: Start difference. First operand 88 states and 152 transitions. Second operand 3 states. [2019-10-02 11:08:30,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:30,164 INFO L93 Difference]: Finished difference Result 204 states and 358 transitions. [2019-10-02 11:08:30,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:30,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-02 11:08:30,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:30,166 INFO L225 Difference]: With dead ends: 204 [2019-10-02 11:08:30,166 INFO L226 Difference]: Without dead ends: 124 [2019-10-02 11:08:30,169 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 11:08:30,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-10-02 11:08:30,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-10-02 11:08:30,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-02 11:08:30,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 210 transitions. [2019-10-02 11:08:30,196 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 210 transitions. Word has length 20 [2019-10-02 11:08:30,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:30,196 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 210 transitions. [2019-10-02 11:08:30,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:30,197 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 210 transitions. [2019-10-02 11:08:30,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-02 11:08:30,200 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:30,200 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] [2019-10-02 11:08:30,201 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:30,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:30,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1728757681, now seen corresponding path program 1 times [2019-10-02 11:08:30,203 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:30,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:30,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:30,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:30,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:30,267 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 11:08:30,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:30,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:30,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:30,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:30,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:30,268 INFO L87 Difference]: Start difference. First operand 122 states and 210 transitions. Second operand 3 states. [2019-10-02 11:08:30,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:30,301 INFO L93 Difference]: Finished difference Result 183 states and 313 transitions. [2019-10-02 11:08:30,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:30,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-02 11:08:30,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:30,302 INFO L225 Difference]: With dead ends: 183 [2019-10-02 11:08:30,303 INFO L226 Difference]: Without dead ends: 126 [2019-10-02 11:08:30,303 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 11:08:30,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-02 11:08:30,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2019-10-02 11:08:30,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-02 11:08:30,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 210 transitions. [2019-10-02 11:08:30,314 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 210 transitions. Word has length 21 [2019-10-02 11:08:30,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:30,315 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 210 transitions. [2019-10-02 11:08:30,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:30,315 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 210 transitions. [2019-10-02 11:08:30,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-02 11:08:30,316 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:30,316 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] [2019-10-02 11:08:30,317 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:30,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:30,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1979403601, now seen corresponding path program 1 times [2019-10-02 11:08:30,317 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:30,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:30,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:30,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:30,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:30,380 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 11:08:30,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:30,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:30,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:30,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:30,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:30,383 INFO L87 Difference]: Start difference. First operand 124 states and 210 transitions. Second operand 3 states. [2019-10-02 11:08:30,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:30,414 INFO L93 Difference]: Finished difference Result 228 states and 392 transitions. [2019-10-02 11:08:30,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:30,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-02 11:08:30,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:30,419 INFO L225 Difference]: With dead ends: 228 [2019-10-02 11:08:30,419 INFO L226 Difference]: Without dead ends: 226 [2019-10-02 11:08:30,422 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 11:08:30,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-10-02 11:08:30,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 168. [2019-10-02 11:08:30,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-10-02 11:08:30,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 282 transitions. [2019-10-02 11:08:30,444 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 282 transitions. Word has length 21 [2019-10-02 11:08:30,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:30,444 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 282 transitions. [2019-10-02 11:08:30,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:30,444 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 282 transitions. [2019-10-02 11:08:30,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-02 11:08:30,448 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:30,448 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] [2019-10-02 11:08:30,448 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:30,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:30,449 INFO L82 PathProgramCache]: Analyzing trace with hash -2057398257, now seen corresponding path program 1 times [2019-10-02 11:08:30,449 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:30,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:30,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:30,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:30,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:30,487 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 11:08:30,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:30,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:30,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:30,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:30,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:30,489 INFO L87 Difference]: Start difference. First operand 168 states and 282 transitions. Second operand 3 states. [2019-10-02 11:08:30,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:30,532 INFO L93 Difference]: Finished difference Result 392 states and 664 transitions. [2019-10-02 11:08:30,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:30,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-02 11:08:30,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:30,537 INFO L225 Difference]: With dead ends: 392 [2019-10-02 11:08:30,537 INFO L226 Difference]: Without dead ends: 234 [2019-10-02 11:08:30,539 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 11:08:30,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-10-02 11:08:30,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2019-10-02 11:08:30,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-02 11:08:30,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 386 transitions. [2019-10-02 11:08:30,567 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 386 transitions. Word has length 21 [2019-10-02 11:08:30,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:30,570 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 386 transitions. [2019-10-02 11:08:30,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:30,570 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 386 transitions. [2019-10-02 11:08:30,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-02 11:08:30,572 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:30,572 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] [2019-10-02 11:08:30,572 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:30,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:30,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1232183873, now seen corresponding path program 1 times [2019-10-02 11:08:30,573 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:30,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:30,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:30,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:30,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:30,618 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 11:08:30,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:30,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:30,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:30,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:30,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:30,632 INFO L87 Difference]: Start difference. First operand 232 states and 386 transitions. Second operand 3 states. [2019-10-02 11:08:30,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:30,655 INFO L93 Difference]: Finished difference Result 348 states and 576 transitions. [2019-10-02 11:08:30,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:30,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-02 11:08:30,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:30,657 INFO L225 Difference]: With dead ends: 348 [2019-10-02 11:08:30,657 INFO L226 Difference]: Without dead ends: 238 [2019-10-02 11:08:30,658 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 11:08:30,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-10-02 11:08:30,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2019-10-02 11:08:30,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-10-02 11:08:30,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 386 transitions. [2019-10-02 11:08:30,668 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 386 transitions. Word has length 22 [2019-10-02 11:08:30,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:30,668 INFO L475 AbstractCegarLoop]: Abstraction has 236 states and 386 transitions. [2019-10-02 11:08:30,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:30,668 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 386 transitions. [2019-10-02 11:08:30,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-02 11:08:30,670 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:30,670 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] [2019-10-02 11:08:30,670 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:30,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:30,671 INFO L82 PathProgramCache]: Analyzing trace with hash 645377859, now seen corresponding path program 1 times [2019-10-02 11:08:30,671 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:30,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:30,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:30,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:30,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:30,693 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 11:08:30,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:30,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:30,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:30,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:30,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:30,695 INFO L87 Difference]: Start difference. First operand 236 states and 386 transitions. Second operand 3 states. [2019-10-02 11:08:30,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:30,723 INFO L93 Difference]: Finished difference Result 428 states and 712 transitions. [2019-10-02 11:08:30,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:30,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-02 11:08:30,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:30,726 INFO L225 Difference]: With dead ends: 428 [2019-10-02 11:08:30,727 INFO L226 Difference]: Without dead ends: 426 [2019-10-02 11:08:30,727 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 11:08:30,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-10-02 11:08:30,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 328. [2019-10-02 11:08:30,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-10-02 11:08:30,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 526 transitions. [2019-10-02 11:08:30,739 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 526 transitions. Word has length 22 [2019-10-02 11:08:30,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:30,740 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 526 transitions. [2019-10-02 11:08:30,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:30,740 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 526 transitions. [2019-10-02 11:08:30,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-02 11:08:30,741 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:30,741 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] [2019-10-02 11:08:30,742 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:30,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:30,742 INFO L82 PathProgramCache]: Analyzing trace with hash 903543297, now seen corresponding path program 1 times [2019-10-02 11:08:30,742 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:30,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:30,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:30,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:30,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:30,762 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 11:08:30,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:30,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:30,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:30,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:30,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:30,763 INFO L87 Difference]: Start difference. First operand 328 states and 526 transitions. Second operand 3 states. [2019-10-02 11:08:30,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:30,790 INFO L93 Difference]: Finished difference Result 764 states and 1232 transitions. [2019-10-02 11:08:30,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:30,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-02 11:08:30,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:30,794 INFO L225 Difference]: With dead ends: 764 [2019-10-02 11:08:30,794 INFO L226 Difference]: Without dead ends: 450 [2019-10-02 11:08:30,795 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 11:08:30,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-10-02 11:08:30,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2019-10-02 11:08:30,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-10-02 11:08:30,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 710 transitions. [2019-10-02 11:08:30,810 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 710 transitions. Word has length 22 [2019-10-02 11:08:30,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:30,811 INFO L475 AbstractCegarLoop]: Abstraction has 448 states and 710 transitions. [2019-10-02 11:08:30,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:30,811 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 710 transitions. [2019-10-02 11:08:30,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-02 11:08:30,812 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:30,812 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] [2019-10-02 11:08:30,812 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:30,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:30,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1467908124, now seen corresponding path program 1 times [2019-10-02 11:08:30,813 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:30,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:30,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:30,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:30,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:30,843 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 11:08:30,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:30,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:30,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:30,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:30,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:30,845 INFO L87 Difference]: Start difference. First operand 448 states and 710 transitions. Second operand 3 states. [2019-10-02 11:08:30,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:30,876 INFO L93 Difference]: Finished difference Result 672 states and 1060 transitions. [2019-10-02 11:08:30,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:30,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-02 11:08:30,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:30,880 INFO L225 Difference]: With dead ends: 672 [2019-10-02 11:08:30,880 INFO L226 Difference]: Without dead ends: 458 [2019-10-02 11:08:30,881 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 11:08:30,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-10-02 11:08:30,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2019-10-02 11:08:30,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-02 11:08:30,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 710 transitions. [2019-10-02 11:08:30,897 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 710 transitions. Word has length 23 [2019-10-02 11:08:30,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:30,897 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 710 transitions. [2019-10-02 11:08:30,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:30,898 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 710 transitions. [2019-10-02 11:08:30,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-02 11:08:30,901 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:30,902 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] [2019-10-02 11:08:30,902 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:30,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:30,902 INFO L82 PathProgramCache]: Analyzing trace with hash -2054714138, now seen corresponding path program 1 times [2019-10-02 11:08:30,902 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:30,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:30,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:30,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:30,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:30,925 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 11:08:30,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:30,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:30,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:30,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:30,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:30,926 INFO L87 Difference]: Start difference. First operand 456 states and 710 transitions. Second operand 3 states. [2019-10-02 11:08:30,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:30,949 INFO L93 Difference]: Finished difference Result 812 states and 1288 transitions. [2019-10-02 11:08:30,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:30,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-02 11:08:30,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:30,954 INFO L225 Difference]: With dead ends: 812 [2019-10-02 11:08:30,954 INFO L226 Difference]: Without dead ends: 810 [2019-10-02 11:08:30,955 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 11:08:30,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2019-10-02 11:08:30,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 648. [2019-10-02 11:08:30,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-02 11:08:30,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 982 transitions. [2019-10-02 11:08:30,976 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 982 transitions. Word has length 23 [2019-10-02 11:08:30,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:30,976 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 982 transitions. [2019-10-02 11:08:30,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:30,977 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 982 transitions. [2019-10-02 11:08:30,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-02 11:08:30,978 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:30,978 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] [2019-10-02 11:08:30,978 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:30,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:30,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1796548700, now seen corresponding path program 1 times [2019-10-02 11:08:30,979 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:30,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:30,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:30,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:30,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:31,001 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 11:08:31,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:31,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:31,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:31,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:31,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:31,002 INFO L87 Difference]: Start difference. First operand 648 states and 982 transitions. Second operand 3 states. [2019-10-02 11:08:31,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:31,029 INFO L93 Difference]: Finished difference Result 1500 states and 2280 transitions. [2019-10-02 11:08:31,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:31,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-02 11:08:31,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:31,034 INFO L225 Difference]: With dead ends: 1500 [2019-10-02 11:08:31,034 INFO L226 Difference]: Without dead ends: 874 [2019-10-02 11:08:31,035 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 11:08:31,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-10-02 11:08:31,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2019-10-02 11:08:31,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2019-10-02 11:08:31,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1302 transitions. [2019-10-02 11:08:31,062 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1302 transitions. Word has length 23 [2019-10-02 11:08:31,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:31,062 INFO L475 AbstractCegarLoop]: Abstraction has 872 states and 1302 transitions. [2019-10-02 11:08:31,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:31,063 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1302 transitions. [2019-10-02 11:08:31,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-02 11:08:31,064 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:31,064 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] [2019-10-02 11:08:31,064 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:31,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:31,065 INFO L82 PathProgramCache]: Analyzing trace with hash 728586230, now seen corresponding path program 1 times [2019-10-02 11:08:31,065 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:31,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:31,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:31,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:31,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:31,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 11:08:31,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:31,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:31,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:31,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:31,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:31,097 INFO L87 Difference]: Start difference. First operand 872 states and 1302 transitions. Second operand 3 states. [2019-10-02 11:08:31,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:31,123 INFO L93 Difference]: Finished difference Result 1308 states and 1944 transitions. [2019-10-02 11:08:31,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:31,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-02 11:08:31,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:31,128 INFO L225 Difference]: With dead ends: 1308 [2019-10-02 11:08:31,128 INFO L226 Difference]: Without dead ends: 890 [2019-10-02 11:08:31,131 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 11:08:31,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2019-10-02 11:08:31,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2019-10-02 11:08:31,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2019-10-02 11:08:31,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1302 transitions. [2019-10-02 11:08:31,158 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1302 transitions. Word has length 24 [2019-10-02 11:08:31,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:31,158 INFO L475 AbstractCegarLoop]: Abstraction has 888 states and 1302 transitions. [2019-10-02 11:08:31,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:31,159 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1302 transitions. [2019-10-02 11:08:31,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-02 11:08:31,160 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:31,160 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] [2019-10-02 11:08:31,161 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:31,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:31,161 INFO L82 PathProgramCache]: Analyzing trace with hash 141780216, now seen corresponding path program 1 times [2019-10-02 11:08:31,161 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:31,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:31,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:31,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:31,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:31,185 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 11:08:31,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:31,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:31,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:31,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:31,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:31,186 INFO L87 Difference]: Start difference. First operand 888 states and 1302 transitions. Second operand 3 states. [2019-10-02 11:08:31,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:31,228 INFO L93 Difference]: Finished difference Result 1548 states and 2312 transitions. [2019-10-02 11:08:31,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:31,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-02 11:08:31,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:31,236 INFO L225 Difference]: With dead ends: 1548 [2019-10-02 11:08:31,236 INFO L226 Difference]: Without dead ends: 1546 [2019-10-02 11:08:31,237 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 11:08:31,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2019-10-02 11:08:31,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1288. [2019-10-02 11:08:31,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2019-10-02 11:08:31,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1830 transitions. [2019-10-02 11:08:31,285 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1830 transitions. Word has length 24 [2019-10-02 11:08:31,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:31,286 INFO L475 AbstractCegarLoop]: Abstraction has 1288 states and 1830 transitions. [2019-10-02 11:08:31,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:31,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1830 transitions. [2019-10-02 11:08:31,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-02 11:08:31,289 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:31,289 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] [2019-10-02 11:08:31,290 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:31,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:31,290 INFO L82 PathProgramCache]: Analyzing trace with hash 399945654, now seen corresponding path program 1 times [2019-10-02 11:08:31,290 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:31,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:31,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:31,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:31,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:31,330 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 11:08:31,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:31,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:31,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:31,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:31,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:31,332 INFO L87 Difference]: Start difference. First operand 1288 states and 1830 transitions. Second operand 3 states. [2019-10-02 11:08:31,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:31,387 INFO L93 Difference]: Finished difference Result 2956 states and 4200 transitions. [2019-10-02 11:08:31,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:31,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-02 11:08:31,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:31,395 INFO L225 Difference]: With dead ends: 2956 [2019-10-02 11:08:31,396 INFO L226 Difference]: Without dead ends: 1706 [2019-10-02 11:08:31,399 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 11:08:31,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2019-10-02 11:08:31,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1704. [2019-10-02 11:08:31,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-10-02 11:08:31,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2374 transitions. [2019-10-02 11:08:31,477 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2374 transitions. Word has length 24 [2019-10-02 11:08:31,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:31,477 INFO L475 AbstractCegarLoop]: Abstraction has 1704 states and 2374 transitions. [2019-10-02 11:08:31,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:31,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2374 transitions. [2019-10-02 11:08:31,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-02 11:08:31,481 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:31,481 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] [2019-10-02 11:08:31,481 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:31,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:31,482 INFO L82 PathProgramCache]: Analyzing trace with hash 100434809, now seen corresponding path program 1 times [2019-10-02 11:08:31,482 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:31,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:31,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:31,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:31,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:31,501 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 11:08:31,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:31,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:31,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:31,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:31,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:31,503 INFO L87 Difference]: Start difference. First operand 1704 states and 2374 transitions. Second operand 3 states. [2019-10-02 11:08:31,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:31,558 INFO L93 Difference]: Finished difference Result 2556 states and 3544 transitions. [2019-10-02 11:08:31,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:31,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-02 11:08:31,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:31,570 INFO L225 Difference]: With dead ends: 2556 [2019-10-02 11:08:31,570 INFO L226 Difference]: Without dead ends: 1738 [2019-10-02 11:08:31,573 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 11:08:31,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-10-02 11:08:31,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1736. [2019-10-02 11:08:31,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1736 states. [2019-10-02 11:08:31,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2374 transitions. [2019-10-02 11:08:31,642 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2374 transitions. Word has length 25 [2019-10-02 11:08:31,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:31,642 INFO L475 AbstractCegarLoop]: Abstraction has 1736 states and 2374 transitions. [2019-10-02 11:08:31,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:31,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2374 transitions. [2019-10-02 11:08:31,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-02 11:08:31,645 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:31,645 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] [2019-10-02 11:08:31,645 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:31,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:31,645 INFO L82 PathProgramCache]: Analyzing trace with hash -486371205, now seen corresponding path program 1 times [2019-10-02 11:08:31,645 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:31,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:31,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:31,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:31,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:31,672 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 11:08:31,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:31,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:31,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:31,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:31,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:31,675 INFO L87 Difference]: Start difference. First operand 1736 states and 2374 transitions. Second operand 3 states. [2019-10-02 11:08:31,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:31,734 INFO L93 Difference]: Finished difference Result 2956 states and 4104 transitions. [2019-10-02 11:08:31,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:31,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-02 11:08:31,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:31,747 INFO L225 Difference]: With dead ends: 2956 [2019-10-02 11:08:31,747 INFO L226 Difference]: Without dead ends: 2954 [2019-10-02 11:08:31,749 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 11:08:31,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2019-10-02 11:08:31,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2568. [2019-10-02 11:08:31,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2568 states. [2019-10-02 11:08:31,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3398 transitions. [2019-10-02 11:08:31,824 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3398 transitions. Word has length 25 [2019-10-02 11:08:31,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:31,824 INFO L475 AbstractCegarLoop]: Abstraction has 2568 states and 3398 transitions. [2019-10-02 11:08:31,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:31,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3398 transitions. [2019-10-02 11:08:31,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-02 11:08:31,829 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:31,829 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] [2019-10-02 11:08:31,829 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:31,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:31,830 INFO L82 PathProgramCache]: Analyzing trace with hash -228205767, now seen corresponding path program 1 times [2019-10-02 11:08:31,830 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:31,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:31,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:31,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:31,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:31,858 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 11:08:31,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:31,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:31,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:31,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:31,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:31,860 INFO L87 Difference]: Start difference. First operand 2568 states and 3398 transitions. Second operand 3 states. [2019-10-02 11:08:31,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:31,936 INFO L93 Difference]: Finished difference Result 5836 states and 7688 transitions. [2019-10-02 11:08:31,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:31,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-02 11:08:31,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:31,952 INFO L225 Difference]: With dead ends: 5836 [2019-10-02 11:08:31,952 INFO L226 Difference]: Without dead ends: 3338 [2019-10-02 11:08:31,957 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 11:08:31,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2019-10-02 11:08:32,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3336. [2019-10-02 11:08:32,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2019-10-02 11:08:32,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4294 transitions. [2019-10-02 11:08:32,104 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4294 transitions. Word has length 25 [2019-10-02 11:08:32,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:32,105 INFO L475 AbstractCegarLoop]: Abstraction has 3336 states and 4294 transitions. [2019-10-02 11:08:32,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:32,105 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4294 transitions. [2019-10-02 11:08:32,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-02 11:08:32,110 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:32,110 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] [2019-10-02 11:08:32,110 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:32,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:32,110 INFO L82 PathProgramCache]: Analyzing trace with hash 2102577579, now seen corresponding path program 1 times [2019-10-02 11:08:32,111 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:32,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:32,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:32,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:32,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:32,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 11:08:32,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:32,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:32,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:32,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:32,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:32,136 INFO L87 Difference]: Start difference. First operand 3336 states and 4294 transitions. Second operand 3 states. [2019-10-02 11:08:32,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:32,196 INFO L93 Difference]: Finished difference Result 5004 states and 6408 transitions. [2019-10-02 11:08:32,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:32,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-02 11:08:32,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:32,211 INFO L225 Difference]: With dead ends: 5004 [2019-10-02 11:08:32,212 INFO L226 Difference]: Without dead ends: 3402 [2019-10-02 11:08:32,215 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 11:08:32,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2019-10-02 11:08:32,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3400. [2019-10-02 11:08:32,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3400 states. [2019-10-02 11:08:32,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4294 transitions. [2019-10-02 11:08:32,313 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4294 transitions. Word has length 26 [2019-10-02 11:08:32,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:32,313 INFO L475 AbstractCegarLoop]: Abstraction has 3400 states and 4294 transitions. [2019-10-02 11:08:32,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:32,313 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4294 transitions. [2019-10-02 11:08:32,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-02 11:08:32,318 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:32,318 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] [2019-10-02 11:08:32,318 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:32,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:32,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1515771565, now seen corresponding path program 1 times [2019-10-02 11:08:32,319 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:32,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:32,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:32,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:32,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:32,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:32,351 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 11:08:32,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:32,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:32,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:32,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:32,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:32,353 INFO L87 Difference]: Start difference. First operand 3400 states and 4294 transitions. Second operand 3 states. [2019-10-02 11:08:32,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:32,471 INFO L93 Difference]: Finished difference Result 9804 states and 12104 transitions. [2019-10-02 11:08:32,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:32,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-02 11:08:32,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:32,522 INFO L225 Difference]: With dead ends: 9804 [2019-10-02 11:08:32,522 INFO L226 Difference]: Without dead ends: 6538 [2019-10-02 11:08:32,532 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 11:08:32,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2019-10-02 11:08:32,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 6536. [2019-10-02 11:08:32,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2019-10-02 11:08:32,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7814 transitions. [2019-10-02 11:08:32,765 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7814 transitions. Word has length 26 [2019-10-02 11:08:32,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:32,766 INFO L475 AbstractCegarLoop]: Abstraction has 6536 states and 7814 transitions. [2019-10-02 11:08:32,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:32,766 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7814 transitions. [2019-10-02 11:08:32,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-02 11:08:32,775 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:32,775 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] [2019-10-02 11:08:32,776 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:32,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:32,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1257606127, now seen corresponding path program 1 times [2019-10-02 11:08:32,776 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:32,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:32,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:32,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:32,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:32,802 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 11:08:32,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:32,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:32,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:32,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:32,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:32,804 INFO L87 Difference]: Start difference. First operand 6536 states and 7814 transitions. Second operand 3 states. [2019-10-02 11:08:32,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:32,937 INFO L93 Difference]: Finished difference Result 7052 states and 8584 transitions. [2019-10-02 11:08:32,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:32,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-02 11:08:32,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:32,954 INFO L225 Difference]: With dead ends: 7052 [2019-10-02 11:08:32,954 INFO L226 Difference]: Without dead ends: 7050 [2019-10-02 11:08:32,958 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 11:08:32,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2019-10-02 11:08:33,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6536. [2019-10-02 11:08:33,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2019-10-02 11:08:33,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7686 transitions. [2019-10-02 11:08:33,134 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7686 transitions. Word has length 26 [2019-10-02 11:08:33,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:33,134 INFO L475 AbstractCegarLoop]: Abstraction has 6536 states and 7686 transitions. [2019-10-02 11:08:33,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:33,134 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7686 transitions. [2019-10-02 11:08:33,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-02 11:08:33,143 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:33,143 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] [2019-10-02 11:08:33,143 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:33,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:33,144 INFO L82 PathProgramCache]: Analyzing trace with hash -255505650, now seen corresponding path program 1 times [2019-10-02 11:08:33,144 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:33,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:33,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:33,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:33,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:33,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:08:33,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:33,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:33,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:33,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:33,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:33,164 INFO L87 Difference]: Start difference. First operand 6536 states and 7686 transitions. Second operand 3 states. [2019-10-02 11:08:33,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:33,331 INFO L93 Difference]: Finished difference Result 10634 states and 12423 transitions. [2019-10-02 11:08:33,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:33,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-02 11:08:33,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:33,355 INFO L225 Difference]: With dead ends: 10634 [2019-10-02 11:08:33,355 INFO L226 Difference]: Without dead ends: 10632 [2019-10-02 11:08:33,364 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 11:08:33,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10632 states. [2019-10-02 11:08:33,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10632 to 10120. [2019-10-02 11:08:33,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10120 states. [2019-10-02 11:08:33,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10120 states to 10120 states and 11654 transitions. [2019-10-02 11:08:33,676 INFO L78 Accepts]: Start accepts. Automaton has 10120 states and 11654 transitions. Word has length 27 [2019-10-02 11:08:33,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:33,677 INFO L475 AbstractCegarLoop]: Abstraction has 10120 states and 11654 transitions. [2019-10-02 11:08:33,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:33,677 INFO L276 IsEmpty]: Start isEmpty. Operand 10120 states and 11654 transitions. [2019-10-02 11:08:33,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-02 11:08:33,699 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:08:33,699 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] [2019-10-02 11:08:33,700 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:08:33,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:08:33,700 INFO L82 PathProgramCache]: Analyzing trace with hash 2659788, now seen corresponding path program 1 times [2019-10-02 11:08:33,700 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:08:33,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:08:33,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:33,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:08:33,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:08:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:08:33,726 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 11:08:33,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:08:33,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 11:08:33,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 11:08:33,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 11:08:33,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 11:08:33,729 INFO L87 Difference]: Start difference. First operand 10120 states and 11654 transitions. Second operand 3 states. [2019-10-02 11:08:33,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:08:33,954 INFO L93 Difference]: Finished difference Result 22664 states and 25734 transitions. [2019-10-02 11:08:33,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 11:08:33,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-02 11:08:33,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:08:33,955 INFO L225 Difference]: With dead ends: 22664 [2019-10-02 11:08:33,955 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 11:08:33,988 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 11:08:33,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 11:08:33,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 11:08:33,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 11:08:33,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 11:08:33,990 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2019-10-02 11:08:33,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:08:33,990 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 11:08:33,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 11:08:33,990 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 11:08:33,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 11:08:33,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 11:08:34,018 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-02 11:08:34,019 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:08:34,019 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 11:08:34,019 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 11:08:34,019 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 11:08:34,019 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 11:08:34,019 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2019-10-02 11:08:34,019 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 149) no Hoare annotation was computed. [2019-10-02 11:08:34,019 INFO L443 ceAbstractionStarter]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2019-10-02 11:08:34,019 INFO L443 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-10-02 11:08:34,020 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2019-10-02 11:08:34,020 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-10-02 11:08:34,020 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2019-10-02 11:08:34,020 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2019-10-02 11:08:34,020 INFO L443 ceAbstractionStarter]: For program point L61(lines 61 63) no Hoare annotation was computed. [2019-10-02 11:08:34,021 INFO L443 ceAbstractionStarter]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2019-10-02 11:08:34,021 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2019-10-02 11:08:34,021 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-10-02 11:08:34,021 INFO L446 ceAbstractionStarter]: At program point L145(lines 5 149) the Hoare annotation is: true [2019-10-02 11:08:34,021 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 149) no Hoare annotation was computed. [2019-10-02 11:08:34,021 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2019-10-02 11:08:34,021 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2019-10-02 11:08:34,021 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2019-10-02 11:08:34,021 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 149) the Hoare annotation is: true [2019-10-02 11:08:34,022 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-10-02 11:08:34,022 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-10-02 11:08:34,022 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2019-10-02 11:08:34,022 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2019-10-02 11:08:34,022 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2019-10-02 11:08:34,022 INFO L446 ceAbstractionStarter]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2019-10-02 11:08:34,022 INFO L443 ceAbstractionStarter]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2019-10-02 11:08:34,022 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2019-10-02 11:08:34,022 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-10-02 11:08:34,023 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-10-02 11:08:34,023 INFO L439 ceAbstractionStarter]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2019-10-02 11:08:34,023 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2019-10-02 11:08:34,023 INFO L443 ceAbstractionStarter]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2019-10-02 11:08:34,023 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-02 11:08:34,024 INFO L443 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2019-10-02 11:08:34,024 INFO L443 ceAbstractionStarter]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2019-10-02 11:08:34,024 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2019-10-02 11:08:34,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:08:34 BoogieIcfgContainer [2019-10-02 11:08:34,037 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 11:08:34,041 INFO L168 Benchmark]: Toolchain (without parser) took 5540.41 ms. Allocated memory was 134.7 MB in the beginning and 351.3 MB in the end (delta: 216.5 MB). Free memory was 85.8 MB in the beginning and 150.6 MB in the end (delta: -64.8 MB). Peak memory consumption was 151.8 MB. Max. memory is 7.1 GB. [2019-10-02 11:08:34,042 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 134.7 MB. Free memory was 104.6 MB in the beginning and 104.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 11:08:34,043 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.15 ms. Allocated memory was 134.7 MB in the beginning and 198.7 MB in the end (delta: 64.0 MB). Free memory was 85.6 MB in the beginning and 176.7 MB in the end (delta: -91.2 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. [2019-10-02 11:08:34,044 INFO L168 Benchmark]: Boogie Preprocessor took 30.52 ms. Allocated memory is still 198.7 MB. Free memory was 176.7 MB in the beginning and 174.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-10-02 11:08:34,047 INFO L168 Benchmark]: RCFGBuilder took 404.07 ms. Allocated memory is still 198.7 MB. Free memory was 174.4 MB in the beginning and 156.5 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB. [2019-10-02 11:08:34,048 INFO L168 Benchmark]: TraceAbstraction took 4711.20 ms. Allocated memory was 198.7 MB in the beginning and 351.3 MB in the end (delta: 152.6 MB). Free memory was 155.9 MB in the beginning and 150.6 MB in the end (delta: 5.3 MB). Peak memory consumption was 157.9 MB. Max. memory is 7.1 GB. [2019-10-02 11:08:34,058 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 134.7 MB. Free memory was 104.6 MB in the beginning and 104.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 390.15 ms. Allocated memory was 134.7 MB in the beginning and 198.7 MB in the end (delta: 64.0 MB). Free memory was 85.6 MB in the beginning and 176.7 MB in the end (delta: -91.2 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.52 ms. Allocated memory is still 198.7 MB. Free memory was 176.7 MB in the beginning and 174.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 404.07 ms. Allocated memory is still 198.7 MB. Free memory was 174.4 MB in the beginning and 156.5 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4711.20 ms. Allocated memory was 198.7 MB in the beginning and 351.3 MB in the end (delta: 152.6 MB). Free memory was 155.9 MB in the beginning and 150.6 MB in the end (delta: 5.3 MB). Peak memory consumption was 157.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 41 locations, 1 error locations. SAFE Result, 4.6s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1937 SDtfs, 926 SDslu, 1314 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10120occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 522 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 23930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...