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/ssh-simplified/s3_srvr_6.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:49:47,566 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:49:47,569 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:49:47,583 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:49:47,584 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:49:47,585 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:49:47,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:49:47,588 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:49:47,590 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:49:47,590 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:49:47,591 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:49:47,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:49:47,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:49:47,594 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:49:47,600 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:49:47,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:49:47,603 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:49:47,603 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:49:47,609 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:49:47,611 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:49:47,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:49:47,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:49:47,618 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:49:47,619 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:49:47,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:49:47,622 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:49:47,622 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:49:47,626 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:49:47,626 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:49:47,629 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:49:47,629 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:49:47,631 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:49:47,632 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:49:47,633 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:49:47,634 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:49:47,635 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:49:47,635 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:49:47,635 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:49:47,636 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:49:47,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:49:47,641 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:49:47,642 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-14 23:49:47,661 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:49:47,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:49:47,663 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:49:47,664 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:49:47,664 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:49:47,664 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:49:47,664 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:49:47,665 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:49:47,665 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:49:47,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:49:47,666 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:49:47,666 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:49:47,667 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:49:47,667 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:49:47,667 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:49:47,667 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:49:47,668 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:49:47,668 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:49:47,668 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:49:47,668 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:49:47,668 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:49:47,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:49:47,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:49:47,669 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:49:47,669 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:49:47,669 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:49:47,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:49:47,670 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:49:47,670 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:49:47,958 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:49:47,976 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:49:47,979 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:49:47,984 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:49:47,985 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:49:47,985 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_6.cil-2.c [2019-10-14 23:49:48,054 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67fc98640/374c0706e7b949e399bde17d630bc7ba/FLAG2631ff9cc [2019-10-14 23:49:48,572 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:49:48,572 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_6.cil-2.c [2019-10-14 23:49:48,592 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67fc98640/374c0706e7b949e399bde17d630bc7ba/FLAG2631ff9cc [2019-10-14 23:49:48,925 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67fc98640/374c0706e7b949e399bde17d630bc7ba [2019-10-14 23:49:48,933 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:49:48,934 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:49:48,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:49:48,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:49:48,939 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:49:48,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:49:48" (1/1) ... [2019-10-14 23:49:48,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@663c421b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:48, skipping insertion in model container [2019-10-14 23:49:48,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:49:48" (1/1) ... [2019-10-14 23:49:48,950 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:49:49,009 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:49:49,239 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:49:49,244 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:49:49,396 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:49:49,415 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:49:49,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:49 WrapperNode [2019-10-14 23:49:49,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:49:49,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:49:49,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:49:49,417 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:49:49,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:49" (1/1) ... [2019-10-14 23:49:49,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:49" (1/1) ... [2019-10-14 23:49:49,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:49" (1/1) ... [2019-10-14 23:49:49,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:49" (1/1) ... [2019-10-14 23:49:49,450 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:49" (1/1) ... [2019-10-14 23:49:49,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:49" (1/1) ... [2019-10-14 23:49:49,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:49" (1/1) ... [2019-10-14 23:49:49,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:49:49,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:49:49,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:49:49,474 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:49:49,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:49" (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-14 23:49:49,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:49:49,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:49:49,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-14 23:49:49,535 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:49:49,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:49:49,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-14 23:49:49,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:49:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-14 23:49:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-14 23:49:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-14 23:49:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:49:49,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:49:49,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:49:49,784 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-14 23:49:50,366 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-14 23:49:50,366 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-14 23:49:50,369 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:49:50,369 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:49:50,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:49:50 BoogieIcfgContainer [2019-10-14 23:49:50,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:49:50,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:49:50,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:49:50,375 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:49:50,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:49:48" (1/3) ... [2019-10-14 23:49:50,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5722da84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:49:50, skipping insertion in model container [2019-10-14 23:49:50,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:49" (2/3) ... [2019-10-14 23:49:50,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5722da84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:49:50, skipping insertion in model container [2019-10-14 23:49:50,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:49:50" (3/3) ... [2019-10-14 23:49:50,379 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_6.cil-2.c [2019-10-14 23:49:50,389 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:49:50,397 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:49:50,408 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:49:50,434 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:49:50,435 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:49:50,435 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:49:50,435 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:49:50,435 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:49:50,436 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:49:50,436 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:49:50,436 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:49:50,458 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states. [2019-10-14 23:49:50,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-14 23:49:50,469 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:50,470 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:50,472 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:50,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:50,478 INFO L82 PathProgramCache]: Analyzing trace with hash 887093352, now seen corresponding path program 1 times [2019-10-14 23:49:50,487 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:50,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124176678] [2019-10-14 23:49:50,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:50,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:50,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:50,786 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-14 23:49:50,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124176678] [2019-10-14 23:49:50,788 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:50,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:50,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061183210] [2019-10-14 23:49:50,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:50,794 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:50,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:50,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:50,811 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 5 states. [2019-10-14 23:49:51,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:51,267 INFO L93 Difference]: Finished difference Result 372 states and 644 transitions. [2019-10-14 23:49:51,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:51,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-14 23:49:51,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:51,283 INFO L225 Difference]: With dead ends: 372 [2019-10-14 23:49:51,284 INFO L226 Difference]: Without dead ends: 198 [2019-10-14 23:49:51,288 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:51,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-10-14 23:49:51,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 188. [2019-10-14 23:49:51,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-10-14 23:49:51,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 306 transitions. [2019-10-14 23:49:51,350 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 306 transitions. Word has length 49 [2019-10-14 23:49:51,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:51,351 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 306 transitions. [2019-10-14 23:49:51,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:51,352 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 306 transitions. [2019-10-14 23:49:51,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-14 23:49:51,355 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:51,355 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:51,355 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:51,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:51,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1023309003, now seen corresponding path program 1 times [2019-10-14 23:49:51,356 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:51,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968928013] [2019-10-14 23:49:51,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,493 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-14 23:49:51,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968928013] [2019-10-14 23:49:51,494 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:51,494 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:51,494 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821383163] [2019-10-14 23:49:51,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:51,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:51,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:51,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:51,497 INFO L87 Difference]: Start difference. First operand 188 states and 306 transitions. Second operand 5 states. [2019-10-14 23:49:51,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:51,787 INFO L93 Difference]: Finished difference Result 412 states and 684 transitions. [2019-10-14 23:49:51,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:51,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-14 23:49:51,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:51,791 INFO L225 Difference]: With dead ends: 412 [2019-10-14 23:49:51,792 INFO L226 Difference]: Without dead ends: 237 [2019-10-14 23:49:51,794 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:51,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-10-14 23:49:51,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 227. [2019-10-14 23:49:51,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-10-14 23:49:51,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 379 transitions. [2019-10-14 23:49:51,815 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 379 transitions. Word has length 50 [2019-10-14 23:49:51,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:51,815 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 379 transitions. [2019-10-14 23:49:51,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:51,816 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 379 transitions. [2019-10-14 23:49:51,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-14 23:49:51,819 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:51,820 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:51,820 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:51,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:51,821 INFO L82 PathProgramCache]: Analyzing trace with hash -141028317, now seen corresponding path program 1 times [2019-10-14 23:49:51,821 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:51,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804827211] [2019-10-14 23:49:51,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,822 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,925 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:51,925 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804827211] [2019-10-14 23:49:51,925 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:51,926 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:51,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832737061] [2019-10-14 23:49:51,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:51,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:51,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:51,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:51,928 INFO L87 Difference]: Start difference. First operand 227 states and 379 transitions. Second operand 5 states. [2019-10-14 23:49:52,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:52,170 INFO L93 Difference]: Finished difference Result 472 states and 799 transitions. [2019-10-14 23:49:52,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:52,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-14 23:49:52,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:52,173 INFO L225 Difference]: With dead ends: 472 [2019-10-14 23:49:52,173 INFO L226 Difference]: Without dead ends: 258 [2019-10-14 23:49:52,175 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:52,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-14 23:49:52,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2019-10-14 23:49:52,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-10-14 23:49:52,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 435 transitions. [2019-10-14 23:49:52,192 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 435 transitions. Word has length 77 [2019-10-14 23:49:52,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:52,192 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 435 transitions. [2019-10-14 23:49:52,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:52,193 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 435 transitions. [2019-10-14 23:49:52,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-14 23:49:52,197 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:52,197 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:52,197 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:52,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:52,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1615796808, now seen corresponding path program 1 times [2019-10-14 23:49:52,198 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:52,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055986279] [2019-10-14 23:49:52,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:52,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:52,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:52,314 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:52,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055986279] [2019-10-14 23:49:52,315 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:52,315 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:52,315 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221261894] [2019-10-14 23:49:52,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:52,316 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:52,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:52,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:52,317 INFO L87 Difference]: Start difference. First operand 258 states and 435 transitions. Second operand 5 states. [2019-10-14 23:49:52,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:52,560 INFO L93 Difference]: Finished difference Result 542 states and 924 transitions. [2019-10-14 23:49:52,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:52,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-10-14 23:49:52,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:52,563 INFO L225 Difference]: With dead ends: 542 [2019-10-14 23:49:52,563 INFO L226 Difference]: Without dead ends: 297 [2019-10-14 23:49:52,564 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:52,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-10-14 23:49:52,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 294. [2019-10-14 23:49:52,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-10-14 23:49:52,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 500 transitions. [2019-10-14 23:49:52,581 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 500 transitions. Word has length 83 [2019-10-14 23:49:52,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:52,582 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 500 transitions. [2019-10-14 23:49:52,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:52,582 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 500 transitions. [2019-10-14 23:49:52,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-14 23:49:52,585 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:52,586 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:52,586 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:52,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:52,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1136743931, now seen corresponding path program 1 times [2019-10-14 23:49:52,586 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:52,587 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916507777] [2019-10-14 23:49:52,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:52,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:52,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:52,657 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:52,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916507777] [2019-10-14 23:49:52,658 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:52,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:52,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801724961] [2019-10-14 23:49:52,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:52,660 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:52,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:52,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:52,661 INFO L87 Difference]: Start difference. First operand 294 states and 500 transitions. Second operand 5 states. [2019-10-14 23:49:52,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:52,894 INFO L93 Difference]: Finished difference Result 578 states and 987 transitions. [2019-10-14 23:49:52,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:52,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-10-14 23:49:52,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:52,898 INFO L225 Difference]: With dead ends: 578 [2019-10-14 23:49:52,898 INFO L226 Difference]: Without dead ends: 297 [2019-10-14 23:49:52,899 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:52,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-10-14 23:49:52,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 294. [2019-10-14 23:49:52,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-10-14 23:49:52,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 498 transitions. [2019-10-14 23:49:52,912 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 498 transitions. Word has length 84 [2019-10-14 23:49:52,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:52,912 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 498 transitions. [2019-10-14 23:49:52,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:52,912 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 498 transitions. [2019-10-14 23:49:52,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-14 23:49:52,914 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:52,914 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:52,914 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:52,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:52,915 INFO L82 PathProgramCache]: Analyzing trace with hash -2104928583, now seen corresponding path program 1 times [2019-10-14 23:49:52,915 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:52,915 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488113265] [2019-10-14 23:49:52,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:52,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:52,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:52,986 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:52,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488113265] [2019-10-14 23:49:52,987 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:52,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:52,988 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042826898] [2019-10-14 23:49:52,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:52,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:52,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:52,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:52,990 INFO L87 Difference]: Start difference. First operand 294 states and 498 transitions. Second operand 5 states. [2019-10-14 23:49:53,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:53,153 INFO L93 Difference]: Finished difference Result 592 states and 1007 transitions. [2019-10-14 23:49:53,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:53,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-14 23:49:53,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:53,158 INFO L225 Difference]: With dead ends: 592 [2019-10-14 23:49:53,158 INFO L226 Difference]: Without dead ends: 311 [2019-10-14 23:49:53,159 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:53,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-10-14 23:49:53,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2019-10-14 23:49:53,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-10-14 23:49:53,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 520 transitions. [2019-10-14 23:49:53,173 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 520 transitions. Word has length 89 [2019-10-14 23:49:53,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:53,173 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 520 transitions. [2019-10-14 23:49:53,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:53,173 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 520 transitions. [2019-10-14 23:49:53,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-14 23:49:53,175 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:53,175 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:53,175 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:53,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:53,176 INFO L82 PathProgramCache]: Analyzing trace with hash -281961503, now seen corresponding path program 1 times [2019-10-14 23:49:53,176 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:53,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98271665] [2019-10-14 23:49:53,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,275 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:53,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98271665] [2019-10-14 23:49:53,276 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:53,276 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:53,276 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447367613] [2019-10-14 23:49:53,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:53,277 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:53,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:53,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:53,279 INFO L87 Difference]: Start difference. First operand 309 states and 520 transitions. Second operand 5 states. [2019-10-14 23:49:53,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:53,460 INFO L93 Difference]: Finished difference Result 607 states and 1025 transitions. [2019-10-14 23:49:53,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:53,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-14 23:49:53,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:53,463 INFO L225 Difference]: With dead ends: 607 [2019-10-14 23:49:53,463 INFO L226 Difference]: Without dead ends: 311 [2019-10-14 23:49:53,464 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:53,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-10-14 23:49:53,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2019-10-14 23:49:53,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-10-14 23:49:53,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 516 transitions. [2019-10-14 23:49:53,477 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 516 transitions. Word has length 90 [2019-10-14 23:49:53,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:53,477 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 516 transitions. [2019-10-14 23:49:53,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:53,477 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 516 transitions. [2019-10-14 23:49:53,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-14 23:49:53,479 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:53,479 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:53,479 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:53,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:53,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1109463774, now seen corresponding path program 1 times [2019-10-14 23:49:53,480 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:53,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954204499] [2019-10-14 23:49:53,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,524 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-14 23:49:53,524 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954204499] [2019-10-14 23:49:53,525 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:53,525 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:53,525 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114937153] [2019-10-14 23:49:53,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:53,526 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:53,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:53,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:53,526 INFO L87 Difference]: Start difference. First operand 309 states and 516 transitions. Second operand 5 states. [2019-10-14 23:49:53,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:53,688 INFO L93 Difference]: Finished difference Result 614 states and 1027 transitions. [2019-10-14 23:49:53,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:53,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-14 23:49:53,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:53,692 INFO L225 Difference]: With dead ends: 614 [2019-10-14 23:49:53,692 INFO L226 Difference]: Without dead ends: 318 [2019-10-14 23:49:53,693 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:53,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-10-14 23:49:53,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2019-10-14 23:49:53,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-10-14 23:49:53,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 522 transitions. [2019-10-14 23:49:53,713 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 522 transitions. Word has length 102 [2019-10-14 23:49:53,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:53,714 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 522 transitions. [2019-10-14 23:49:53,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:53,714 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 522 transitions. [2019-10-14 23:49:53,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-14 23:49:53,716 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:53,716 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:53,717 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:53,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:53,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1351505052, now seen corresponding path program 1 times [2019-10-14 23:49:53,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:53,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113548263] [2019-10-14 23:49:53,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,797 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:53,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113548263] [2019-10-14 23:49:53,799 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:53,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:53,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737814541] [2019-10-14 23:49:53,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:53,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:53,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:53,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:53,802 INFO L87 Difference]: Start difference. First operand 318 states and 522 transitions. Second operand 5 states. [2019-10-14 23:49:54,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:54,076 INFO L93 Difference]: Finished difference Result 654 states and 1080 transitions. [2019-10-14 23:49:54,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:54,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-14 23:49:54,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:54,080 INFO L225 Difference]: With dead ends: 654 [2019-10-14 23:49:54,080 INFO L226 Difference]: Without dead ends: 349 [2019-10-14 23:49:54,081 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:54,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-10-14 23:49:54,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 347. [2019-10-14 23:49:54,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-10-14 23:49:54,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 569 transitions. [2019-10-14 23:49:54,103 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 569 transitions. Word has length 103 [2019-10-14 23:49:54,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:54,103 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 569 transitions. [2019-10-14 23:49:54,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:54,112 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 569 transitions. [2019-10-14 23:49:54,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-14 23:49:54,114 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:54,114 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:54,115 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:54,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:54,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1217914916, now seen corresponding path program 1 times [2019-10-14 23:49:54,115 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:54,116 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126034410] [2019-10-14 23:49:54,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,188 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:54,188 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126034410] [2019-10-14 23:49:54,189 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:54,189 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:54,190 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836458270] [2019-10-14 23:49:54,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:54,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:54,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:54,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:54,191 INFO L87 Difference]: Start difference. First operand 347 states and 569 transitions. Second operand 5 states. [2019-10-14 23:49:54,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:54,413 INFO L93 Difference]: Finished difference Result 683 states and 1123 transitions. [2019-10-14 23:49:54,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:54,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-14 23:49:54,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:54,415 INFO L225 Difference]: With dead ends: 683 [2019-10-14 23:49:54,416 INFO L226 Difference]: Without dead ends: 349 [2019-10-14 23:49:54,417 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:54,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-10-14 23:49:54,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 347. [2019-10-14 23:49:54,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-10-14 23:49:54,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 565 transitions. [2019-10-14 23:49:54,432 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 565 transitions. Word has length 104 [2019-10-14 23:49:54,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:54,433 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 565 transitions. [2019-10-14 23:49:54,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:54,433 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 565 transitions. [2019-10-14 23:49:54,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-14 23:49:54,437 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:54,437 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:54,438 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:54,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:54,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1213371254, now seen corresponding path program 1 times [2019-10-14 23:49:54,438 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:54,439 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541931594] [2019-10-14 23:49:54,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,508 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:54,508 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541931594] [2019-10-14 23:49:54,509 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:54,509 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:54,509 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557089674] [2019-10-14 23:49:54,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:54,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:54,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:54,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:54,510 INFO L87 Difference]: Start difference. First operand 347 states and 565 transitions. Second operand 5 states. [2019-10-14 23:49:54,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:54,706 INFO L93 Difference]: Finished difference Result 717 states and 1175 transitions. [2019-10-14 23:49:54,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:54,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-14 23:49:54,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:54,710 INFO L225 Difference]: With dead ends: 717 [2019-10-14 23:49:54,710 INFO L226 Difference]: Without dead ends: 383 [2019-10-14 23:49:54,711 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:54,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-10-14 23:49:54,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 374. [2019-10-14 23:49:54,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-10-14 23:49:54,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 607 transitions. [2019-10-14 23:49:54,734 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 607 transitions. Word has length 106 [2019-10-14 23:49:54,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:54,734 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 607 transitions. [2019-10-14 23:49:54,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:54,734 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 607 transitions. [2019-10-14 23:49:54,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-14 23:49:54,736 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:54,736 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:54,736 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:54,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:54,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1820780382, now seen corresponding path program 1 times [2019-10-14 23:49:54,737 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:54,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815650203] [2019-10-14 23:49:54,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:54,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815650203] [2019-10-14 23:49:54,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:54,789 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:54,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781010593] [2019-10-14 23:49:54,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:54,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:54,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:54,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:54,790 INFO L87 Difference]: Start difference. First operand 374 states and 607 transitions. Second operand 5 states. [2019-10-14 23:49:55,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:55,002 INFO L93 Difference]: Finished difference Result 744 states and 1212 transitions. [2019-10-14 23:49:55,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:55,003 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-10-14 23:49:55,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:55,005 INFO L225 Difference]: With dead ends: 744 [2019-10-14 23:49:55,005 INFO L226 Difference]: Without dead ends: 383 [2019-10-14 23:49:55,006 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:55,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-10-14 23:49:55,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 374. [2019-10-14 23:49:55,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-10-14 23:49:55,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 602 transitions. [2019-10-14 23:49:55,024 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 602 transitions. Word has length 107 [2019-10-14 23:49:55,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:55,025 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 602 transitions. [2019-10-14 23:49:55,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:55,025 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 602 transitions. [2019-10-14 23:49:55,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-14 23:49:55,028 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:55,028 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:55,028 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:55,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:55,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1208949664, now seen corresponding path program 1 times [2019-10-14 23:49:55,030 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:55,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572146981] [2019-10-14 23:49:55,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:55,103 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-14 23:49:55,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572146981] [2019-10-14 23:49:55,104 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:55,104 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:55,104 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630880107] [2019-10-14 23:49:55,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:55,105 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:55,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:55,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:55,106 INFO L87 Difference]: Start difference. First operand 374 states and 602 transitions. Second operand 5 states. [2019-10-14 23:49:55,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:55,310 INFO L93 Difference]: Finished difference Result 772 states and 1247 transitions. [2019-10-14 23:49:55,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:55,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2019-10-14 23:49:55,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:55,314 INFO L225 Difference]: With dead ends: 772 [2019-10-14 23:49:55,314 INFO L226 Difference]: Without dead ends: 411 [2019-10-14 23:49:55,315 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:55,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-10-14 23:49:55,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 408. [2019-10-14 23:49:55,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-10-14 23:49:55,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 655 transitions. [2019-10-14 23:49:55,332 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 655 transitions. Word has length 115 [2019-10-14 23:49:55,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:55,332 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 655 transitions. [2019-10-14 23:49:55,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:55,332 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 655 transitions. [2019-10-14 23:49:55,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-14 23:49:55,334 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:55,334 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:55,334 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:55,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:55,335 INFO L82 PathProgramCache]: Analyzing trace with hash 523971907, now seen corresponding path program 1 times [2019-10-14 23:49:55,335 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:55,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017092552] [2019-10-14 23:49:55,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:55,397 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-14 23:49:55,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017092552] [2019-10-14 23:49:55,398 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:55,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:55,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613349990] [2019-10-14 23:49:55,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:55,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:55,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:55,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:55,400 INFO L87 Difference]: Start difference. First operand 408 states and 655 transitions. Second operand 5 states. [2019-10-14 23:49:55,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:55,605 INFO L93 Difference]: Finished difference Result 806 states and 1297 transitions. [2019-10-14 23:49:55,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:55,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-10-14 23:49:55,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:55,608 INFO L225 Difference]: With dead ends: 806 [2019-10-14 23:49:55,608 INFO L226 Difference]: Without dead ends: 411 [2019-10-14 23:49:55,609 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:55,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-10-14 23:49:55,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 408. [2019-10-14 23:49:55,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-10-14 23:49:55,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 652 transitions. [2019-10-14 23:49:55,627 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 652 transitions. Word has length 116 [2019-10-14 23:49:55,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:55,627 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 652 transitions. [2019-10-14 23:49:55,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:55,628 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 652 transitions. [2019-10-14 23:49:55,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-14 23:49:55,629 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:55,629 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:55,630 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:55,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:55,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1148759440, now seen corresponding path program 1 times [2019-10-14 23:49:55,630 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:55,630 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380782463] [2019-10-14 23:49:55,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:55,704 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:55,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380782463] [2019-10-14 23:49:55,705 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:55,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:55,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930835520] [2019-10-14 23:49:55,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:55,706 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:55,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:55,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:55,707 INFO L87 Difference]: Start difference. First operand 408 states and 652 transitions. Second operand 5 states. [2019-10-14 23:49:55,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:55,946 INFO L93 Difference]: Finished difference Result 851 states and 1363 transitions. [2019-10-14 23:49:55,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:55,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2019-10-14 23:49:55,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:55,949 INFO L225 Difference]: With dead ends: 851 [2019-10-14 23:49:55,949 INFO L226 Difference]: Without dead ends: 456 [2019-10-14 23:49:55,952 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:55,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-10-14 23:49:55,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 450. [2019-10-14 23:49:55,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-10-14 23:49:55,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 717 transitions. [2019-10-14 23:49:55,971 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 717 transitions. Word has length 119 [2019-10-14 23:49:55,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:55,972 INFO L462 AbstractCegarLoop]: Abstraction has 450 states and 717 transitions. [2019-10-14 23:49:55,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:55,972 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 717 transitions. [2019-10-14 23:49:55,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-14 23:49:55,974 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:55,974 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:55,975 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:55,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:55,975 INFO L82 PathProgramCache]: Analyzing trace with hash 669551219, now seen corresponding path program 1 times [2019-10-14 23:49:55,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:55,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689757488] [2019-10-14 23:49:55,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,026 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:56,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689757488] [2019-10-14 23:49:56,033 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:56,033 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:56,033 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195635476] [2019-10-14 23:49:56,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:56,034 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:56,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:56,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:56,034 INFO L87 Difference]: Start difference. First operand 450 states and 717 transitions. Second operand 5 states. [2019-10-14 23:49:56,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:56,237 INFO L93 Difference]: Finished difference Result 897 states and 1434 transitions. [2019-10-14 23:49:56,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:56,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-10-14 23:49:56,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:56,240 INFO L225 Difference]: With dead ends: 897 [2019-10-14 23:49:56,240 INFO L226 Difference]: Without dead ends: 458 [2019-10-14 23:49:56,241 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:56,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-10-14 23:49:56,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 452. [2019-10-14 23:49:56,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-10-14 23:49:56,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 720 transitions. [2019-10-14 23:49:56,261 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 720 transitions. Word has length 120 [2019-10-14 23:49:56,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:56,261 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 720 transitions. [2019-10-14 23:49:56,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:56,261 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 720 transitions. [2019-10-14 23:49:56,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-14 23:49:56,263 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:56,263 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:56,264 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:56,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:56,264 INFO L82 PathProgramCache]: Analyzing trace with hash 534907766, now seen corresponding path program 1 times [2019-10-14 23:49:56,264 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:56,264 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797839300] [2019-10-14 23:49:56,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:56,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:56,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,334 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-14 23:49:56,335 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797839300] [2019-10-14 23:49:56,335 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:56,335 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:56,336 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571116165] [2019-10-14 23:49:56,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:56,336 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:56,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:56,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:56,337 INFO L87 Difference]: Start difference. First operand 452 states and 720 transitions. Second operand 5 states. [2019-10-14 23:49:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:56,529 INFO L93 Difference]: Finished difference Result 930 states and 1489 transitions. [2019-10-14 23:49:56,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:56,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-10-14 23:49:56,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:56,533 INFO L225 Difference]: With dead ends: 930 [2019-10-14 23:49:56,533 INFO L226 Difference]: Without dead ends: 491 [2019-10-14 23:49:56,535 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:56,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-10-14 23:49:56,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 477. [2019-10-14 23:49:56,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-10-14 23:49:56,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 755 transitions. [2019-10-14 23:49:56,579 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 755 transitions. Word has length 132 [2019-10-14 23:49:56,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:56,579 INFO L462 AbstractCegarLoop]: Abstraction has 477 states and 755 transitions. [2019-10-14 23:49:56,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:56,579 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 755 transitions. [2019-10-14 23:49:56,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-14 23:49:56,581 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:56,581 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:56,582 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:56,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:56,582 INFO L82 PathProgramCache]: Analyzing trace with hash 535914030, now seen corresponding path program 1 times [2019-10-14 23:49:56,582 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:56,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883117583] [2019-10-14 23:49:56,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:56,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:56,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,652 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-14 23:49:56,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883117583] [2019-10-14 23:49:56,652 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:56,653 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:56,653 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977307588] [2019-10-14 23:49:56,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:56,654 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:56,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:56,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:56,655 INFO L87 Difference]: Start difference. First operand 477 states and 755 transitions. Second operand 5 states. [2019-10-14 23:49:56,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:56,895 INFO L93 Difference]: Finished difference Result 955 states and 1516 transitions. [2019-10-14 23:49:56,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:56,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-14 23:49:56,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:56,899 INFO L225 Difference]: With dead ends: 955 [2019-10-14 23:49:56,899 INFO L226 Difference]: Without dead ends: 491 [2019-10-14 23:49:56,900 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:56,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-10-14 23:49:56,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 477. [2019-10-14 23:49:56,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-10-14 23:49:56,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 747 transitions. [2019-10-14 23:49:56,933 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 747 transitions. Word has length 133 [2019-10-14 23:49:56,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:56,934 INFO L462 AbstractCegarLoop]: Abstraction has 477 states and 747 transitions. [2019-10-14 23:49:56,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:56,934 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 747 transitions. [2019-10-14 23:49:56,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-14 23:49:56,938 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:56,938 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:56,938 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:56,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:56,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1278605743, now seen corresponding path program 1 times [2019-10-14 23:49:56,939 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:56,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515824575] [2019-10-14 23:49:56,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:56,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:56,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:57,009 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-14 23:49:57,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515824575] [2019-10-14 23:49:57,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:57,010 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:57,010 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530471740] [2019-10-14 23:49:57,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:57,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:57,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:57,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:57,013 INFO L87 Difference]: Start difference. First operand 477 states and 747 transitions. Second operand 5 states. [2019-10-14 23:49:57,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:57,215 INFO L93 Difference]: Finished difference Result 947 states and 1486 transitions. [2019-10-14 23:49:57,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:57,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-14 23:49:57,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:57,218 INFO L225 Difference]: With dead ends: 947 [2019-10-14 23:49:57,218 INFO L226 Difference]: Without dead ends: 483 [2019-10-14 23:49:57,220 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:57,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-10-14 23:49:57,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 477. [2019-10-14 23:49:57,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-10-14 23:49:57,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 742 transitions. [2019-10-14 23:49:57,243 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 742 transitions. Word has length 148 [2019-10-14 23:49:57,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:57,244 INFO L462 AbstractCegarLoop]: Abstraction has 477 states and 742 transitions. [2019-10-14 23:49:57,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:57,244 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 742 transitions. [2019-10-14 23:49:57,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-14 23:49:57,246 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:57,246 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:57,247 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:57,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:57,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1353663186, now seen corresponding path program 1 times [2019-10-14 23:49:57,247 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:57,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497372760] [2019-10-14 23:49:57,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:57,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:57,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:57,309 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-14 23:49:57,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497372760] [2019-10-14 23:49:57,310 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:57,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:57,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993924646] [2019-10-14 23:49:57,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:57,311 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:57,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:57,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:57,311 INFO L87 Difference]: Start difference. First operand 477 states and 742 transitions. Second operand 5 states. [2019-10-14 23:49:57,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:57,637 INFO L93 Difference]: Finished difference Result 947 states and 1476 transitions. [2019-10-14 23:49:57,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:57,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2019-10-14 23:49:57,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:57,641 INFO L225 Difference]: With dead ends: 947 [2019-10-14 23:49:57,641 INFO L226 Difference]: Without dead ends: 483 [2019-10-14 23:49:57,642 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:57,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-10-14 23:49:57,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 477. [2019-10-14 23:49:57,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-10-14 23:49:57,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 737 transitions. [2019-10-14 23:49:57,672 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 737 transitions. Word has length 149 [2019-10-14 23:49:57,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:57,672 INFO L462 AbstractCegarLoop]: Abstraction has 477 states and 737 transitions. [2019-10-14 23:49:57,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:57,673 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 737 transitions. [2019-10-14 23:49:57,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-14 23:49:57,676 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:57,677 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:57,677 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:57,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:57,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1186463222, now seen corresponding path program 1 times [2019-10-14 23:49:57,678 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:57,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330377428] [2019-10-14 23:49:57,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:57,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:57,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:57,806 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-10-14 23:49:57,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330377428] [2019-10-14 23:49:57,807 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:57,807 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:57,807 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447767845] [2019-10-14 23:49:57,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:57,814 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:57,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:57,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:57,815 INFO L87 Difference]: Start difference. First operand 477 states and 737 transitions. Second operand 5 states. [2019-10-14 23:49:58,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:58,028 INFO L93 Difference]: Finished difference Result 970 states and 1504 transitions. [2019-10-14 23:49:58,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:58,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-10-14 23:49:58,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:58,031 INFO L225 Difference]: With dead ends: 970 [2019-10-14 23:49:58,031 INFO L226 Difference]: Without dead ends: 506 [2019-10-14 23:49:58,032 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:58,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-10-14 23:49:58,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 501. [2019-10-14 23:49:58,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-10-14 23:49:58,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 768 transitions. [2019-10-14 23:49:58,059 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 768 transitions. Word has length 153 [2019-10-14 23:49:58,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:58,059 INFO L462 AbstractCegarLoop]: Abstraction has 501 states and 768 transitions. [2019-10-14 23:49:58,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:58,059 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 768 transitions. [2019-10-14 23:49:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-14 23:49:58,061 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:58,061 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:58,062 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:58,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:58,062 INFO L82 PathProgramCache]: Analyzing trace with hash 320058782, now seen corresponding path program 1 times [2019-10-14 23:49:58,063 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:58,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743864877] [2019-10-14 23:49:58,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:58,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:58,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,135 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-10-14 23:49:58,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743864877] [2019-10-14 23:49:58,135 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:58,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:58,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343395222] [2019-10-14 23:49:58,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:58,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:58,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:58,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:58,137 INFO L87 Difference]: Start difference. First operand 501 states and 768 transitions. Second operand 5 states. [2019-10-14 23:49:58,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:58,328 INFO L93 Difference]: Finished difference Result 994 states and 1526 transitions. [2019-10-14 23:49:58,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:58,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2019-10-14 23:49:58,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:58,332 INFO L225 Difference]: With dead ends: 994 [2019-10-14 23:49:58,332 INFO L226 Difference]: Without dead ends: 506 [2019-10-14 23:49:58,333 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:58,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-10-14 23:49:58,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 501. [2019-10-14 23:49:58,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-10-14 23:49:58,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 759 transitions. [2019-10-14 23:49:58,359 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 759 transitions. Word has length 154 [2019-10-14 23:49:58,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:58,360 INFO L462 AbstractCegarLoop]: Abstraction has 501 states and 759 transitions. [2019-10-14 23:49:58,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:58,360 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 759 transitions. [2019-10-14 23:49:58,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-14 23:49:58,363 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:58,364 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:58,364 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:58,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:58,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1626033845, now seen corresponding path program 1 times [2019-10-14 23:49:58,365 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:58,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883693147] [2019-10-14 23:49:58,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:58,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:58,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:58,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,452 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-14 23:49:58,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883693147] [2019-10-14 23:49:58,452 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:58,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:58,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715810813] [2019-10-14 23:49:58,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:58,455 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:58,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:58,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:58,455 INFO L87 Difference]: Start difference. First operand 501 states and 759 transitions. Second operand 5 states. [2019-10-14 23:49:58,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:58,663 INFO L93 Difference]: Finished difference Result 1037 states and 1569 transitions. [2019-10-14 23:49:58,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:58,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2019-10-14 23:49:58,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:58,667 INFO L225 Difference]: With dead ends: 1037 [2019-10-14 23:49:58,667 INFO L226 Difference]: Without dead ends: 549 [2019-10-14 23:49:58,669 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:58,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-10-14 23:49:58,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 542. [2019-10-14 23:49:58,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-10-14 23:49:58,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 814 transitions. [2019-10-14 23:49:58,705 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 814 transitions. Word has length 159 [2019-10-14 23:49:58,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:58,706 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 814 transitions. [2019-10-14 23:49:58,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:58,706 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 814 transitions. [2019-10-14 23:49:58,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-14 23:49:58,709 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:58,709 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:58,710 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:58,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:58,710 INFO L82 PathProgramCache]: Analyzing trace with hash 885119950, now seen corresponding path program 1 times [2019-10-14 23:49:58,710 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:58,711 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095564574] [2019-10-14 23:49:58,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:58,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:58,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,814 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-14 23:49:58,815 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095564574] [2019-10-14 23:49:58,815 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:58,815 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:58,816 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34481950] [2019-10-14 23:49:58,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:58,817 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:58,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:58,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:58,818 INFO L87 Difference]: Start difference. First operand 542 states and 814 transitions. Second operand 5 states. [2019-10-14 23:49:59,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:59,060 INFO L93 Difference]: Finished difference Result 1078 states and 1622 transitions. [2019-10-14 23:49:59,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:59,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2019-10-14 23:49:59,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:59,064 INFO L225 Difference]: With dead ends: 1078 [2019-10-14 23:49:59,064 INFO L226 Difference]: Without dead ends: 530 [2019-10-14 23:49:59,068 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:59,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-10-14 23:49:59,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 523. [2019-10-14 23:49:59,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-10-14 23:49:59,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 784 transitions. [2019-10-14 23:49:59,092 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 784 transitions. Word has length 160 [2019-10-14 23:49:59,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:59,092 INFO L462 AbstractCegarLoop]: Abstraction has 523 states and 784 transitions. [2019-10-14 23:49:59,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:59,093 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 784 transitions. [2019-10-14 23:49:59,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-14 23:49:59,095 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:59,095 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:59,095 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:59,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:59,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1076584642, now seen corresponding path program 1 times [2019-10-14 23:49:59,096 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:59,096 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177039831] [2019-10-14 23:49:59,096 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,096 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,160 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-10-14 23:49:59,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177039831] [2019-10-14 23:49:59,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:59,161 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:59,161 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430040523] [2019-10-14 23:49:59,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:59,162 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:59,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:59,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:59,162 INFO L87 Difference]: Start difference. First operand 523 states and 784 transitions. Second operand 5 states. [2019-10-14 23:49:59,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:59,359 INFO L93 Difference]: Finished difference Result 1058 states and 1592 transitions. [2019-10-14 23:49:59,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:59,359 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 174 [2019-10-14 23:49:59,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:59,362 INFO L225 Difference]: With dead ends: 1058 [2019-10-14 23:49:59,362 INFO L226 Difference]: Without dead ends: 548 [2019-10-14 23:49:59,364 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:59,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-10-14 23:49:59,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 544. [2019-10-14 23:49:59,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-10-14 23:49:59,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 808 transitions. [2019-10-14 23:49:59,402 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 808 transitions. Word has length 174 [2019-10-14 23:49:59,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:59,402 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 808 transitions. [2019-10-14 23:49:59,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:59,403 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 808 transitions. [2019-10-14 23:49:59,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-14 23:49:59,405 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:59,405 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:59,406 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:59,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:59,406 INFO L82 PathProgramCache]: Analyzing trace with hash 415925946, now seen corresponding path program 1 times [2019-10-14 23:49:59,406 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:59,406 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878764400] [2019-10-14 23:49:59,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,461 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-10-14 23:49:59,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878764400] [2019-10-14 23:49:59,462 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:59,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:59,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526196229] [2019-10-14 23:49:59,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:59,463 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:59,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:59,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:59,463 INFO L87 Difference]: Start difference. First operand 544 states and 808 transitions. Second operand 5 states. [2019-10-14 23:49:59,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:59,678 INFO L93 Difference]: Finished difference Result 1079 states and 1605 transitions. [2019-10-14 23:49:59,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:59,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-10-14 23:49:59,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:59,682 INFO L225 Difference]: With dead ends: 1079 [2019-10-14 23:49:59,682 INFO L226 Difference]: Without dead ends: 546 [2019-10-14 23:49:59,683 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:59,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-10-14 23:49:59,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 542. [2019-10-14 23:49:59,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-10-14 23:49:59,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 794 transitions. [2019-10-14 23:49:59,707 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 794 transitions. Word has length 175 [2019-10-14 23:49:59,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:59,707 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 794 transitions. [2019-10-14 23:49:59,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:59,707 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 794 transitions. [2019-10-14 23:49:59,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-14 23:49:59,710 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:59,710 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:59,710 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:59,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:59,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1910899715, now seen corresponding path program 1 times [2019-10-14 23:49:59,711 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:59,711 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547250287] [2019-10-14 23:49:59,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,762 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-10-14 23:49:59,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547250287] [2019-10-14 23:49:59,763 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:59,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:59,763 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993822757] [2019-10-14 23:49:59,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:59,764 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:59,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:59,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:59,764 INFO L87 Difference]: Start difference. First operand 542 states and 794 transitions. Second operand 3 states. [2019-10-14 23:49:59,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:59,812 INFO L93 Difference]: Finished difference Result 1593 states and 2335 transitions. [2019-10-14 23:49:59,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:59,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-10-14 23:49:59,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:59,817 INFO L225 Difference]: With dead ends: 1593 [2019-10-14 23:49:59,818 INFO L226 Difference]: Without dead ends: 1064 [2019-10-14 23:49:59,819 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:49:59,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2019-10-14 23:49:59,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 543. [2019-10-14 23:49:59,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-10-14 23:49:59,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 795 transitions. [2019-10-14 23:49:59,849 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 795 transitions. Word has length 190 [2019-10-14 23:49:59,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:59,849 INFO L462 AbstractCegarLoop]: Abstraction has 543 states and 795 transitions. [2019-10-14 23:49:59,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:59,850 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 795 transitions. [2019-10-14 23:49:59,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-14 23:49:59,852 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:59,852 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:59,852 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:59,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:59,853 INFO L82 PathProgramCache]: Analyzing trace with hash 44191041, now seen corresponding path program 1 times [2019-10-14 23:49:59,853 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:59,853 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714764853] [2019-10-14 23:49:59,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,920 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-14 23:49:59,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714764853] [2019-10-14 23:49:59,921 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:59,921 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:59,921 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453924045] [2019-10-14 23:49:59,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:59,922 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:59,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:59,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:59,923 INFO L87 Difference]: Start difference. First operand 543 states and 795 transitions. Second operand 3 states. [2019-10-14 23:50:00,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:00,071 INFO L93 Difference]: Finished difference Result 1601 states and 2350 transitions. [2019-10-14 23:50:00,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:00,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-10-14 23:50:00,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:00,078 INFO L225 Difference]: With dead ends: 1601 [2019-10-14 23:50:00,078 INFO L226 Difference]: Without dead ends: 1071 [2019-10-14 23:50:00,079 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:50:00,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2019-10-14 23:50:00,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2019-10-14 23:50:00,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1071 states. [2019-10-14 23:50:00,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1553 transitions. [2019-10-14 23:50:00,145 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1553 transitions. Word has length 190 [2019-10-14 23:50:00,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:00,146 INFO L462 AbstractCegarLoop]: Abstraction has 1071 states and 1553 transitions. [2019-10-14 23:50:00,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:00,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1553 transitions. [2019-10-14 23:50:00,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-14 23:50:00,152 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:00,152 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:00,152 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:00,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:00,153 INFO L82 PathProgramCache]: Analyzing trace with hash 402721867, now seen corresponding path program 1 times [2019-10-14 23:50:00,153 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:00,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067780701] [2019-10-14 23:50:00,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:00,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:00,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,222 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-14 23:50:00,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067780701] [2019-10-14 23:50:00,222 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:00,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:00,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097582946] [2019-10-14 23:50:00,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:00,224 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:00,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:00,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:00,225 INFO L87 Difference]: Start difference. First operand 1071 states and 1553 transitions. Second operand 3 states. [2019-10-14 23:50:00,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:00,365 INFO L93 Difference]: Finished difference Result 2657 states and 3866 transitions. [2019-10-14 23:50:00,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:00,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-10-14 23:50:00,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:00,375 INFO L225 Difference]: With dead ends: 2657 [2019-10-14 23:50:00,376 INFO L226 Difference]: Without dead ends: 1599 [2019-10-14 23:50:00,380 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:50:00,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2019-10-14 23:50:00,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1599. [2019-10-14 23:50:00,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1599 states. [2019-10-14 23:50:00,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2312 transitions. [2019-10-14 23:50:00,484 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2312 transitions. Word has length 192 [2019-10-14 23:50:00,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:00,485 INFO L462 AbstractCegarLoop]: Abstraction has 1599 states and 2312 transitions. [2019-10-14 23:50:00,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:00,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2312 transitions. [2019-10-14 23:50:00,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-14 23:50:00,490 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:00,490 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:00,491 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:00,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:00,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1637292960, now seen corresponding path program 1 times [2019-10-14 23:50:00,491 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:00,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283764840] [2019-10-14 23:50:00,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:00,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:00,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,567 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-14 23:50:00,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283764840] [2019-10-14 23:50:00,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796572649] [2019-10-14 23:50:00,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-14 23:50:00,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:00,785 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-10-14 23:50:00,786 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:00,786 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:50:00,786 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279228295] [2019-10-14 23:50:00,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:00,787 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:00,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:00,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:00,787 INFO L87 Difference]: Start difference. First operand 1599 states and 2312 transitions. Second operand 3 states. [2019-10-14 23:50:01,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:01,017 INFO L93 Difference]: Finished difference Result 3713 states and 5384 transitions. [2019-10-14 23:50:01,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:01,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-10-14 23:50:01,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:01,027 INFO L225 Difference]: With dead ends: 3713 [2019-10-14 23:50:01,027 INFO L226 Difference]: Without dead ends: 2127 [2019-10-14 23:50:01,031 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:01,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2019-10-14 23:50:01,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 2127. [2019-10-14 23:50:01,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2127 states. [2019-10-14 23:50:01,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 3073 transitions. [2019-10-14 23:50:01,160 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 3073 transitions. Word has length 193 [2019-10-14 23:50:01,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:01,160 INFO L462 AbstractCegarLoop]: Abstraction has 2127 states and 3073 transitions. [2019-10-14 23:50:01,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:01,160 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 3073 transitions. [2019-10-14 23:50:01,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-10-14 23:50:01,168 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:01,169 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:01,374 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:01,375 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:01,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:01,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1013209815, now seen corresponding path program 1 times [2019-10-14 23:50:01,376 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:01,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861010598] [2019-10-14 23:50:01,376 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:01,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:01,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:01,571 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2019-10-14 23:50:01,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861010598] [2019-10-14 23:50:01,577 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:01,577 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:01,578 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148099364] [2019-10-14 23:50:01,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:01,579 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:01,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:01,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:01,582 INFO L87 Difference]: Start difference. First operand 2127 states and 3073 transitions. Second operand 3 states. [2019-10-14 23:50:01,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:01,854 INFO L93 Difference]: Finished difference Result 4734 states and 6858 transitions. [2019-10-14 23:50:01,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:01,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-10-14 23:50:01,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:01,866 INFO L225 Difference]: With dead ends: 4734 [2019-10-14 23:50:01,866 INFO L226 Difference]: Without dead ends: 2620 [2019-10-14 23:50:01,877 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:50:01,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2620 states. [2019-10-14 23:50:02,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2620 to 2620. [2019-10-14 23:50:02,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2620 states. [2019-10-14 23:50:02,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2620 states to 2620 states and 3780 transitions. [2019-10-14 23:50:02,034 INFO L78 Accepts]: Start accepts. Automaton has 2620 states and 3780 transitions. Word has length 292 [2019-10-14 23:50:02,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:02,035 INFO L462 AbstractCegarLoop]: Abstraction has 2620 states and 3780 transitions. [2019-10-14 23:50:02,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:02,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2620 states and 3780 transitions. [2019-10-14 23:50:02,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-10-14 23:50:02,044 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:02,044 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:02,046 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:02,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:02,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1308592103, now seen corresponding path program 1 times [2019-10-14 23:50:02,047 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:02,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006723824] [2019-10-14 23:50:02,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:02,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:02,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,188 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 657 trivial. 0 not checked. [2019-10-14 23:50:02,188 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006723824] [2019-10-14 23:50:02,188 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:02,189 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:02,189 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803225650] [2019-10-14 23:50:02,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:02,189 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:02,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:02,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:02,190 INFO L87 Difference]: Start difference. First operand 2620 states and 3780 transitions. Second operand 3 states. [2019-10-14 23:50:02,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:02,436 INFO L93 Difference]: Finished difference Result 5747 states and 8307 transitions. [2019-10-14 23:50:02,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:02,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-10-14 23:50:02,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:02,453 INFO L225 Difference]: With dead ends: 5747 [2019-10-14 23:50:02,453 INFO L226 Difference]: Without dead ends: 3140 [2019-10-14 23:50:02,460 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:50:02,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3140 states. [2019-10-14 23:50:02,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3140 to 3140. [2019-10-14 23:50:02,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2019-10-14 23:50:02,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 4526 transitions. [2019-10-14 23:50:02,787 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 4526 transitions. Word has length 292 [2019-10-14 23:50:02,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:02,788 INFO L462 AbstractCegarLoop]: Abstraction has 3140 states and 4526 transitions. [2019-10-14 23:50:02,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:02,788 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 4526 transitions. [2019-10-14 23:50:02,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-10-14 23:50:02,810 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:02,811 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:02,811 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:02,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:02,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1060445609, now seen corresponding path program 1 times [2019-10-14 23:50:02,812 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:02,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412929582] [2019-10-14 23:50:02,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:02,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:02,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,987 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2019-10-14 23:50:02,987 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412929582] [2019-10-14 23:50:02,987 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:02,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:02,988 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459101956] [2019-10-14 23:50:02,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:02,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:02,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:02,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:02,990 INFO L87 Difference]: Start difference. First operand 3140 states and 4526 transitions. Second operand 3 states. [2019-10-14 23:50:03,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:03,260 INFO L93 Difference]: Finished difference Result 6756 states and 9760 transitions. [2019-10-14 23:50:03,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:03,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-10-14 23:50:03,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:03,302 INFO L225 Difference]: With dead ends: 6756 [2019-10-14 23:50:03,306 INFO L226 Difference]: Without dead ends: 3629 [2019-10-14 23:50:03,321 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:50:03,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3629 states. [2019-10-14 23:50:03,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3629 to 3629. [2019-10-14 23:50:03,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3629 states. [2019-10-14 23:50:03,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3629 states to 3629 states and 5229 transitions. [2019-10-14 23:50:03,612 INFO L78 Accepts]: Start accepts. Automaton has 3629 states and 5229 transitions. Word has length 292 [2019-10-14 23:50:03,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:03,613 INFO L462 AbstractCegarLoop]: Abstraction has 3629 states and 5229 transitions. [2019-10-14 23:50:03,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:03,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3629 states and 5229 transitions. [2019-10-14 23:50:03,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-10-14 23:50:03,627 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:03,628 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:03,628 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:03,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:03,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1157184789, now seen corresponding path program 1 times [2019-10-14 23:50:03,629 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:03,629 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119653122] [2019-10-14 23:50:03,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:03,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:03,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:03,788 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 478 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2019-10-14 23:50:03,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119653122] [2019-10-14 23:50:03,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:03,789 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:03,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111592897] [2019-10-14 23:50:03,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:03,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:03,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:03,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:03,790 INFO L87 Difference]: Start difference. First operand 3629 states and 5229 transitions. Second operand 3 states. [2019-10-14 23:50:04,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:04,090 INFO L93 Difference]: Finished difference Result 7736 states and 11168 transitions. [2019-10-14 23:50:04,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:04,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-10-14 23:50:04,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:04,103 INFO L225 Difference]: With dead ends: 7736 [2019-10-14 23:50:04,104 INFO L226 Difference]: Without dead ends: 4120 [2019-10-14 23:50:04,113 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:50:04,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4120 states. [2019-10-14 23:50:04,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4120 to 4120. [2019-10-14 23:50:04,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4120 states. [2019-10-14 23:50:04,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4120 states to 4120 states and 5934 transitions. [2019-10-14 23:50:04,355 INFO L78 Accepts]: Start accepts. Automaton has 4120 states and 5934 transitions. Word has length 292 [2019-10-14 23:50:04,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:04,356 INFO L462 AbstractCegarLoop]: Abstraction has 4120 states and 5934 transitions. [2019-10-14 23:50:04,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:04,356 INFO L276 IsEmpty]: Start isEmpty. Operand 4120 states and 5934 transitions. [2019-10-14 23:50:04,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2019-10-14 23:50:04,373 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:04,373 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:04,374 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:04,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:04,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1424241546, now seen corresponding path program 1 times [2019-10-14 23:50:04,374 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:04,374 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46665977] [2019-10-14 23:50:04,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:04,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:04,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1956 backedges. 572 proven. 26 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-10-14 23:50:04,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46665977] [2019-10-14 23:50:04,666 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846441437] [2019-10-14 23:50:04,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:04,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:05,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1956 backedges. 572 proven. 0 refuted. 0 times theorem prover too weak. 1384 trivial. 0 not checked. [2019-10-14 23:50:05,074 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:05,074 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:50:05,075 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919652642] [2019-10-14 23:50:05,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:05,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:05,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:05,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:05,076 INFO L87 Difference]: Start difference. First operand 4120 states and 5934 transitions. Second operand 3 states. [2019-10-14 23:50:05,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:05,359 INFO L93 Difference]: Finished difference Result 8748 states and 12617 transitions. [2019-10-14 23:50:05,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:05,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 440 [2019-10-14 23:50:05,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:05,372 INFO L225 Difference]: With dead ends: 8748 [2019-10-14 23:50:05,372 INFO L226 Difference]: Without dead ends: 4641 [2019-10-14 23:50:05,382 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:05,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4641 states. [2019-10-14 23:50:05,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4641 to 4641. [2019-10-14 23:50:05,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4641 states. [2019-10-14 23:50:05,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4641 states to 4641 states and 6681 transitions. [2019-10-14 23:50:05,600 INFO L78 Accepts]: Start accepts. Automaton has 4641 states and 6681 transitions. Word has length 440 [2019-10-14 23:50:05,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:05,600 INFO L462 AbstractCegarLoop]: Abstraction has 4641 states and 6681 transitions. [2019-10-14 23:50:05,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:05,601 INFO L276 IsEmpty]: Start isEmpty. Operand 4641 states and 6681 transitions. [2019-10-14 23:50:05,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-10-14 23:50:05,617 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:05,618 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:05,822 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:05,822 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:05,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:05,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1367558780, now seen corresponding path program 1 times [2019-10-14 23:50:05,823 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:05,824 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396155698] [2019-10-14 23:50:05,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:05,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:05,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1956 backedges. 840 proven. 0 refuted. 0 times theorem prover too weak. 1116 trivial. 0 not checked. [2019-10-14 23:50:06,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396155698] [2019-10-14 23:50:06,184 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:06,184 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:06,185 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539162818] [2019-10-14 23:50:06,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:06,186 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:06,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:06,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:06,187 INFO L87 Difference]: Start difference. First operand 4641 states and 6681 transitions. Second operand 3 states. [2019-10-14 23:50:06,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:06,552 INFO L93 Difference]: Finished difference Result 9791 states and 14112 transitions. [2019-10-14 23:50:06,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:06,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 441 [2019-10-14 23:50:06,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:06,563 INFO L225 Difference]: With dead ends: 9791 [2019-10-14 23:50:06,563 INFO L226 Difference]: Without dead ends: 5163 [2019-10-14 23:50:06,573 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:50:06,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5163 states. [2019-10-14 23:50:06,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5163 to 5163. [2019-10-14 23:50:06,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5163 states. [2019-10-14 23:50:06,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5163 states to 5163 states and 7429 transitions. [2019-10-14 23:50:06,816 INFO L78 Accepts]: Start accepts. Automaton has 5163 states and 7429 transitions. Word has length 441 [2019-10-14 23:50:06,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:06,816 INFO L462 AbstractCegarLoop]: Abstraction has 5163 states and 7429 transitions. [2019-10-14 23:50:06,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:06,817 INFO L276 IsEmpty]: Start isEmpty. Operand 5163 states and 7429 transitions. [2019-10-14 23:50:06,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-10-14 23:50:06,833 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:06,834 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:06,834 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:06,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:06,834 INFO L82 PathProgramCache]: Analyzing trace with hash 370864915, now seen corresponding path program 1 times [2019-10-14 23:50:06,835 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:06,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766563742] [2019-10-14 23:50:06,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:06,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:06,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:06,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:07,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1956 backedges. 1014 proven. 0 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2019-10-14 23:50:07,072 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766563742] [2019-10-14 23:50:07,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:07,072 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:07,073 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420715582] [2019-10-14 23:50:07,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:07,074 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:07,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:07,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:07,075 INFO L87 Difference]: Start difference. First operand 5163 states and 7429 transitions. Second operand 3 states. [2019-10-14 23:50:07,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:07,371 INFO L93 Difference]: Finished difference Result 10794 states and 15555 transitions. [2019-10-14 23:50:07,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:07,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 442 [2019-10-14 23:50:07,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:07,382 INFO L225 Difference]: With dead ends: 10794 [2019-10-14 23:50:07,383 INFO L226 Difference]: Without dead ends: 5644 [2019-10-14 23:50:07,393 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 23:50:07,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5644 states. [2019-10-14 23:50:07,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5644 to 5644. [2019-10-14 23:50:07,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5644 states. [2019-10-14 23:50:07,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5644 states to 5644 states and 8124 transitions. [2019-10-14 23:50:07,648 INFO L78 Accepts]: Start accepts. Automaton has 5644 states and 8124 transitions. Word has length 442 [2019-10-14 23:50:07,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:07,649 INFO L462 AbstractCegarLoop]: Abstraction has 5644 states and 8124 transitions. [2019-10-14 23:50:07,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:07,649 INFO L276 IsEmpty]: Start isEmpty. Operand 5644 states and 8124 transitions. [2019-10-14 23:50:07,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2019-10-14 23:50:07,664 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:07,664 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:07,665 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:07,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:07,665 INFO L82 PathProgramCache]: Analyzing trace with hash 652692000, now seen corresponding path program 1 times [2019-10-14 23:50:07,665 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:07,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412755597] [2019-10-14 23:50:07,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:07,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:07,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:08,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3562 backedges. 1996 proven. 26 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-10-14 23:50:08,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412755597] [2019-10-14 23:50:08,033 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546521516] [2019-10-14 23:50:08,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:08,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 966 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:08,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:08,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3562 backedges. 809 proven. 0 refuted. 0 times theorem prover too weak. 2753 trivial. 0 not checked. [2019-10-14 23:50:08,637 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:08,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:50:08,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331732873] [2019-10-14 23:50:08,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:08,640 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:08,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:08,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:08,641 INFO L87 Difference]: Start difference. First operand 5644 states and 8124 transitions. Second operand 3 states. [2019-10-14 23:50:09,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:09,000 INFO L93 Difference]: Finished difference Result 11797 states and 16999 transitions. [2019-10-14 23:50:09,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:09,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 591 [2019-10-14 23:50:09,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:09,017 INFO L225 Difference]: With dead ends: 11797 [2019-10-14 23:50:09,017 INFO L226 Difference]: Without dead ends: 6166 [2019-10-14 23:50:09,027 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 593 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:09,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6166 states. [2019-10-14 23:50:09,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6166 to 6166. [2019-10-14 23:50:09,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6166 states. [2019-10-14 23:50:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6166 states to 6166 states and 8872 transitions. [2019-10-14 23:50:09,374 INFO L78 Accepts]: Start accepts. Automaton has 6166 states and 8872 transitions. Word has length 591 [2019-10-14 23:50:09,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:09,376 INFO L462 AbstractCegarLoop]: Abstraction has 6166 states and 8872 transitions. [2019-10-14 23:50:09,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:09,376 INFO L276 IsEmpty]: Start isEmpty. Operand 6166 states and 8872 transitions. [2019-10-14 23:50:09,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2019-10-14 23:50:09,399 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:09,400 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:09,614 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:09,615 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:09,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:09,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1264094977, now seen corresponding path program 1 times [2019-10-14 23:50:09,616 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:09,616 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417298143] [2019-10-14 23:50:09,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:09,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:09,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:10,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3562 backedges. 1996 proven. 26 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-10-14 23:50:10,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417298143] [2019-10-14 23:50:10,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952860391] [2019-10-14 23:50:10,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:10,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:10,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:10,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3562 backedges. 1212 proven. 0 refuted. 0 times theorem prover too weak. 2350 trivial. 0 not checked. [2019-10-14 23:50:10,527 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:10,527 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:50:10,528 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562066095] [2019-10-14 23:50:10,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:10,531 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:10,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:10,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:10,532 INFO L87 Difference]: Start difference. First operand 6166 states and 8872 transitions. Second operand 3 states. [2019-10-14 23:50:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:11,002 INFO L93 Difference]: Finished difference Result 12842 states and 18496 transitions. [2019-10-14 23:50:11,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:11,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 592 [2019-10-14 23:50:11,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:11,015 INFO L225 Difference]: With dead ends: 12842 [2019-10-14 23:50:11,015 INFO L226 Difference]: Without dead ends: 6689 [2019-10-14 23:50:11,026 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 594 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:11,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6689 states. [2019-10-14 23:50:11,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6689 to 6689. [2019-10-14 23:50:11,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6689 states. [2019-10-14 23:50:11,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6689 states to 6689 states and 9621 transitions. [2019-10-14 23:50:11,309 INFO L78 Accepts]: Start accepts. Automaton has 6689 states and 9621 transitions. Word has length 592 [2019-10-14 23:50:11,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:11,313 INFO L462 AbstractCegarLoop]: Abstraction has 6689 states and 9621 transitions. [2019-10-14 23:50:11,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:11,313 INFO L276 IsEmpty]: Start isEmpty. Operand 6689 states and 9621 transitions. [2019-10-14 23:50:11,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2019-10-14 23:50:11,327 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:11,327 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:11,536 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:11,537 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:11,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:11,538 INFO L82 PathProgramCache]: Analyzing trace with hash -294938665, now seen corresponding path program 1 times [2019-10-14 23:50:11,538 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:11,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388342989] [2019-10-14 23:50:11,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:11,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:11,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:12,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3562 backedges. 1996 proven. 26 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-10-14 23:50:12,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388342989] [2019-10-14 23:50:12,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675220917] [2019-10-14 23:50:12,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:12,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:12,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:12,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3562 backedges. 1521 proven. 0 refuted. 0 times theorem prover too weak. 2041 trivial. 0 not checked. [2019-10-14 23:50:12,426 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:12,427 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:50:12,427 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818524656] [2019-10-14 23:50:12,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:12,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:12,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:12,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:12,428 INFO L87 Difference]: Start difference. First operand 6689 states and 9621 transitions. Second operand 3 states. [2019-10-14 23:50:12,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:12,777 INFO L93 Difference]: Finished difference Result 13847 states and 19941 transitions. [2019-10-14 23:50:12,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:12,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 593 [2019-10-14 23:50:12,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:12,792 INFO L225 Difference]: With dead ends: 13847 [2019-10-14 23:50:12,792 INFO L226 Difference]: Without dead ends: 7171 [2019-10-14 23:50:12,803 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 595 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:12,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7171 states. [2019-10-14 23:50:13,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7171 to 7171. [2019-10-14 23:50:13,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7171 states. [2019-10-14 23:50:13,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7171 states to 7171 states and 10317 transitions. [2019-10-14 23:50:13,185 INFO L78 Accepts]: Start accepts. Automaton has 7171 states and 10317 transitions. Word has length 593 [2019-10-14 23:50:13,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:13,186 INFO L462 AbstractCegarLoop]: Abstraction has 7171 states and 10317 transitions. [2019-10-14 23:50:13,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:13,186 INFO L276 IsEmpty]: Start isEmpty. Operand 7171 states and 10317 transitions. [2019-10-14 23:50:13,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 746 [2019-10-14 23:50:13,201 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:13,202 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 20, 20, 19, 19, 18, 18, 17, 17, 17, 17, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:13,406 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:13,407 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:13,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:13,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1751651628, now seen corresponding path program 1 times [2019-10-14 23:50:13,408 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:13,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389999051] [2019-10-14 23:50:13,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:13,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:13,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:13,836 INFO L134 CoverageAnalysis]: Checked inductivity of 5678 backedges. 3420 proven. 26 refuted. 0 times theorem prover too weak. 2232 trivial. 0 not checked. [2019-10-14 23:50:13,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389999051] [2019-10-14 23:50:13,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624927336] [2019-10-14 23:50:13,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 1167 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:14,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:14,354 INFO L134 CoverageAnalysis]: Checked inductivity of 5678 backedges. 1047 proven. 0 refuted. 0 times theorem prover too weak. 4631 trivial. 0 not checked. [2019-10-14 23:50:14,354 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:14,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:50:14,354 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647249605] [2019-10-14 23:50:14,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:14,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:14,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:14,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:14,356 INFO L87 Difference]: Start difference. First operand 7171 states and 10317 transitions. Second operand 3 states. [2019-10-14 23:50:14,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:14,689 INFO L93 Difference]: Finished difference Result 14852 states and 21387 transitions. [2019-10-14 23:50:14,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:14,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 745 [2019-10-14 23:50:14,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:14,704 INFO L225 Difference]: With dead ends: 14852 [2019-10-14 23:50:14,704 INFO L226 Difference]: Without dead ends: 7694 [2019-10-14 23:50:14,714 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 750 GetRequests, 747 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:14,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7694 states. [2019-10-14 23:50:15,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7694 to 7694. [2019-10-14 23:50:15,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7694 states. [2019-10-14 23:50:15,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7694 states to 7694 states and 11066 transitions. [2019-10-14 23:50:15,120 INFO L78 Accepts]: Start accepts. Automaton has 7694 states and 11066 transitions. Word has length 745 [2019-10-14 23:50:15,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:15,121 INFO L462 AbstractCegarLoop]: Abstraction has 7694 states and 11066 transitions. [2019-10-14 23:50:15,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:15,122 INFO L276 IsEmpty]: Start isEmpty. Operand 7694 states and 11066 transitions. [2019-10-14 23:50:15,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2019-10-14 23:50:15,137 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:15,138 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 20, 20, 19, 19, 18, 18, 17, 17, 17, 17, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:15,343 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:15,343 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:15,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:15,344 INFO L82 PathProgramCache]: Analyzing trace with hash -983126576, now seen corresponding path program 1 times [2019-10-14 23:50:15,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:15,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496089485] [2019-10-14 23:50:15,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:15,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:15,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,642 INFO L134 CoverageAnalysis]: Checked inductivity of 5678 backedges. 3420 proven. 26 refuted. 0 times theorem prover too weak. 2232 trivial. 0 not checked. [2019-10-14 23:50:15,642 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496089485] [2019-10-14 23:50:15,642 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414548710] [2019-10-14 23:50:15,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 1168 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:15,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:16,096 INFO L134 CoverageAnalysis]: Checked inductivity of 5678 backedges. 1586 proven. 0 refuted. 0 times theorem prover too weak. 4092 trivial. 0 not checked. [2019-10-14 23:50:16,097 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:16,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:50:16,097 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822457019] [2019-10-14 23:50:16,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:16,098 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:16,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:16,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:16,099 INFO L87 Difference]: Start difference. First operand 7694 states and 11066 transitions. Second operand 3 states. [2019-10-14 23:50:16,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:16,424 INFO L93 Difference]: Finished difference Result 15899 states and 22886 transitions. [2019-10-14 23:50:16,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:16,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 746 [2019-10-14 23:50:16,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:16,444 INFO L225 Difference]: With dead ends: 15899 [2019-10-14 23:50:16,445 INFO L226 Difference]: Without dead ends: 8218 [2019-10-14 23:50:16,452 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 751 GetRequests, 748 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:16,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8218 states. [2019-10-14 23:50:16,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8218 to 8218. [2019-10-14 23:50:16,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8218 states. [2019-10-14 23:50:16,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8218 states to 8218 states and 11816 transitions. [2019-10-14 23:50:16,789 INFO L78 Accepts]: Start accepts. Automaton has 8218 states and 11816 transitions. Word has length 746 [2019-10-14 23:50:16,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:16,790 INFO L462 AbstractCegarLoop]: Abstraction has 8218 states and 11816 transitions. [2019-10-14 23:50:16,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:16,791 INFO L276 IsEmpty]: Start isEmpty. Operand 8218 states and 11816 transitions. [2019-10-14 23:50:16,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2019-10-14 23:50:16,804 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:16,804 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 20, 20, 19, 19, 18, 18, 17, 17, 17, 17, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:17,017 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:17,018 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:17,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:17,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1703465931, now seen corresponding path program 1 times [2019-10-14 23:50:17,019 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:17,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26905179] [2019-10-14 23:50:17,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:17,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:17,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:17,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:17,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5678 backedges. 3420 proven. 26 refuted. 0 times theorem prover too weak. 2232 trivial. 0 not checked. [2019-10-14 23:50:17,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26905179] [2019-10-14 23:50:17,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334859653] [2019-10-14 23:50:17,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:17,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 1169 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:17,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:17,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5678 backedges. 2031 proven. 0 refuted. 0 times theorem prover too weak. 3647 trivial. 0 not checked. [2019-10-14 23:50:17,864 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:17,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:50:17,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899646976] [2019-10-14 23:50:17,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:17,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:17,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:17,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:17,865 INFO L87 Difference]: Start difference. First operand 8218 states and 11816 transitions. Second operand 3 states. [2019-10-14 23:50:18,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:18,158 INFO L93 Difference]: Finished difference Result 16906 states and 24333 transitions. [2019-10-14 23:50:18,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:18,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 747 [2019-10-14 23:50:18,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:18,172 INFO L225 Difference]: With dead ends: 16906 [2019-10-14 23:50:18,172 INFO L226 Difference]: Without dead ends: 8701 [2019-10-14 23:50:18,181 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 749 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:18,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8701 states. [2019-10-14 23:50:18,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8701 to 8701. [2019-10-14 23:50:18,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8701 states. [2019-10-14 23:50:18,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8701 states to 8701 states and 12513 transitions. [2019-10-14 23:50:18,537 INFO L78 Accepts]: Start accepts. Automaton has 8701 states and 12513 transitions. Word has length 747 [2019-10-14 23:50:18,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:18,538 INFO L462 AbstractCegarLoop]: Abstraction has 8701 states and 12513 transitions. [2019-10-14 23:50:18,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:18,539 INFO L276 IsEmpty]: Start isEmpty. Operand 8701 states and 12513 transitions. [2019-10-14 23:50:18,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 903 [2019-10-14 23:50:18,554 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:18,555 INFO L380 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 24, 24, 23, 23, 22, 22, 21, 21, 21, 21, 16, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:18,768 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:18,769 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:18,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:18,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1976807567, now seen corresponding path program 1 times [2019-10-14 23:50:18,770 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:18,771 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905331430] [2019-10-14 23:50:18,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:18,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:18,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat