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_7.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:50:49,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:50:49,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:50:49,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:50:49,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:50:49,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:50:49,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:50:49,717 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:50:49,719 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:50:49,719 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:50:49,721 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:50:49,724 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:50:49,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:50:49,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:50:49,731 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:50:49,733 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:50:49,734 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:50:49,737 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:50:49,740 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:50:49,745 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:50:49,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:50:49,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:50:49,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:50:49,754 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:50:49,758 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:50:49,758 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:50:49,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:50:49,760 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:50:49,761 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:50:49,763 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:50:49,763 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:50:49,764 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:50:49,765 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:50:49,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:50:49,768 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:50:49,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:50:49,769 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:50:49,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:50:49,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:50:49,771 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:50:49,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:50:49,773 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-13 19:50:49,809 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:50:49,810 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:50:49,811 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:50:49,811 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:50:49,811 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:50:49,812 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:50:49,812 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:50:49,812 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:50:49,812 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:50:49,812 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:50:49,813 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:50:49,813 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:50:49,813 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:50:49,813 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:50:49,813 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:50:49,814 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:50:49,814 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:50:49,814 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:50:49,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:50:49,816 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:50:49,816 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:50:49,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:50:49,817 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:50:49,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:50:49,817 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:50:49,818 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:50:49,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:50:49,819 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:50:49,819 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:50:50,132 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:50:50,155 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:50:50,159 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:50:50,160 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:50:50,161 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:50:50,162 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_7.cil.c [2019-10-13 19:50:50,236 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f3178615/7db0c08b4fc448afbc80210d72f2b128/FLAG5ed40bf6e [2019-10-13 19:50:50,776 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:50:50,776 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_7.cil.c [2019-10-13 19:50:50,792 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f3178615/7db0c08b4fc448afbc80210d72f2b128/FLAG5ed40bf6e [2019-10-13 19:50:51,157 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f3178615/7db0c08b4fc448afbc80210d72f2b128 [2019-10-13 19:50:51,170 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:50:51,172 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:50:51,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:50:51,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:50:51,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:50:51,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:50:51" (1/1) ... [2019-10-13 19:50:51,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c76a8b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:51, skipping insertion in model container [2019-10-13 19:50:51,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:50:51" (1/1) ... [2019-10-13 19:50:51,191 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:50:51,243 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:50:51,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:50:51,549 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:50:51,713 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:50:51,732 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:50:51,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:51 WrapperNode [2019-10-13 19:50:51,733 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:50:51,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:50:51,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:50:51,734 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:50:51,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:51" (1/1) ... [2019-10-13 19:50:51,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:51" (1/1) ... [2019-10-13 19:50:51,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:51" (1/1) ... [2019-10-13 19:50:51,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:51" (1/1) ... [2019-10-13 19:50:51,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:51" (1/1) ... [2019-10-13 19:50:51,782 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:51" (1/1) ... [2019-10-13 19:50:51,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:51" (1/1) ... [2019-10-13 19:50:51,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:50:51,791 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:50:51,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:50:51,792 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:50:51,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:51" (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-13 19:50:51,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:50:51,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:50:51,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-13 19:50:51,849 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:50:51,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:50:51,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 19:50:51,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:50:51,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-13 19:50:51,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-13 19:50:51,850 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-13 19:50:51,850 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:50:51,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:50:51,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:50:52,071 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 19:50:52,703 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-13 19:50:52,703 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-13 19:50:52,709 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:50:52,709 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 19:50:52,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:50:52 BoogieIcfgContainer [2019-10-13 19:50:52,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:50:52,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:50:52,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:50:52,717 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:50:52,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:50:51" (1/3) ... [2019-10-13 19:50:52,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a091e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:50:52, skipping insertion in model container [2019-10-13 19:50:52,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:51" (2/3) ... [2019-10-13 19:50:52,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a091e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:50:52, skipping insertion in model container [2019-10-13 19:50:52,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:50:52" (3/3) ... [2019-10-13 19:50:52,731 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_7.cil.c [2019-10-13 19:50:52,743 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:50:52,752 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:50:52,764 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:50:52,793 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:50:52,794 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:50:52,794 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:50:52,794 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:50:52,794 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:50:52,794 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:50:52,795 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:50:52,795 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:50:52,819 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-10-13 19:50:52,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 19:50:52,828 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:52,829 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] [2019-10-13 19:50:52,831 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:52,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:52,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1198514108, now seen corresponding path program 1 times [2019-10-13 19:50:52,843 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:52,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361895324] [2019-10-13 19:50:52,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:52,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:52,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:53,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:50:53,146 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361895324] [2019-10-13 19:50:53,147 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:53,147 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:53,147 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966084689] [2019-10-13 19:50:53,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:53,153 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:53,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:53,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:53,172 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 5 states. [2019-10-13 19:50:53,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:53,657 INFO L93 Difference]: Finished difference Result 338 states and 575 transitions. [2019-10-13 19:50:53,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:53,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-10-13 19:50:53,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:53,685 INFO L225 Difference]: With dead ends: 338 [2019-10-13 19:50:53,685 INFO L226 Difference]: Without dead ends: 176 [2019-10-13 19:50:53,694 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-13 19:50:53,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-10-13 19:50:53,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 165. [2019-10-13 19:50:53,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-13 19:50:53,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 260 transitions. [2019-10-13 19:50:53,807 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 260 transitions. Word has length 38 [2019-10-13 19:50:53,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:53,807 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 260 transitions. [2019-10-13 19:50:53,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:53,808 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 260 transitions. [2019-10-13 19:50:53,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-13 19:50:53,810 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:53,810 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] [2019-10-13 19:50:53,811 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:53,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:53,811 INFO L82 PathProgramCache]: Analyzing trace with hash -733377836, now seen corresponding path program 1 times [2019-10-13 19:50:53,812 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:53,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902233997] [2019-10-13 19:50:53,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:53,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:53,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:53,932 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-13 19:50:53,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902233997] [2019-10-13 19:50:53,932 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:53,933 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:53,933 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387776588] [2019-10-13 19:50:53,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:53,935 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:53,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:53,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:53,936 INFO L87 Difference]: Start difference. First operand 165 states and 260 transitions. Second operand 5 states. [2019-10-13 19:50:54,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:54,181 INFO L93 Difference]: Finished difference Result 356 states and 571 transitions. [2019-10-13 19:50:54,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:54,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-10-13 19:50:54,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:54,184 INFO L225 Difference]: With dead ends: 356 [2019-10-13 19:50:54,184 INFO L226 Difference]: Without dead ends: 204 [2019-10-13 19:50:54,186 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-13 19:50:54,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-13 19:50:54,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 193. [2019-10-13 19:50:54,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-10-13 19:50:54,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 311 transitions. [2019-10-13 19:50:54,202 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 311 transitions. Word has length 39 [2019-10-13 19:50:54,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:54,202 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 311 transitions. [2019-10-13 19:50:54,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:54,203 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 311 transitions. [2019-10-13 19:50:54,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-13 19:50:54,205 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:54,205 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] [2019-10-13 19:50:54,205 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:54,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:54,206 INFO L82 PathProgramCache]: Analyzing trace with hash 2008699792, now seen corresponding path program 1 times [2019-10-13 19:50:54,206 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:54,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945897639] [2019-10-13 19:50:54,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,312 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-13 19:50:54,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945897639] [2019-10-13 19:50:54,313 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:54,314 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:54,314 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504565368] [2019-10-13 19:50:54,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:54,315 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:54,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:54,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:54,316 INFO L87 Difference]: Start difference. First operand 193 states and 311 transitions. Second operand 5 states. [2019-10-13 19:50:54,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:54,611 INFO L93 Difference]: Finished difference Result 417 states and 682 transitions. [2019-10-13 19:50:54,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:54,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-13 19:50:54,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:54,615 INFO L225 Difference]: With dead ends: 417 [2019-10-13 19:50:54,615 INFO L226 Difference]: Without dead ends: 237 [2019-10-13 19:50:54,616 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-13 19:50:54,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-10-13 19:50:54,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2019-10-13 19:50:54,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-10-13 19:50:54,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 380 transitions. [2019-10-13 19:50:54,633 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 380 transitions. Word has length 45 [2019-10-13 19:50:54,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:54,634 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 380 transitions. [2019-10-13 19:50:54,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:54,634 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 380 transitions. [2019-10-13 19:50:54,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-13 19:50:54,636 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:54,637 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] [2019-10-13 19:50:54,637 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:54,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:54,637 INFO L82 PathProgramCache]: Analyzing trace with hash 2133173875, now seen corresponding path program 1 times [2019-10-13 19:50:54,638 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:54,638 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860190915] [2019-10-13 19:50:54,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,764 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-13 19:50:54,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860190915] [2019-10-13 19:50:54,764 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:54,765 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:54,765 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215226227] [2019-10-13 19:50:54,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:54,766 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:54,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:54,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:54,766 INFO L87 Difference]: Start difference. First operand 231 states and 380 transitions. Second operand 5 states. [2019-10-13 19:50:55,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:55,011 INFO L93 Difference]: Finished difference Result 466 states and 772 transitions. [2019-10-13 19:50:55,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:55,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-13 19:50:55,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:55,014 INFO L225 Difference]: With dead ends: 466 [2019-10-13 19:50:55,014 INFO L226 Difference]: Without dead ends: 248 [2019-10-13 19:50:55,015 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-13 19:50:55,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-10-13 19:50:55,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 242. [2019-10-13 19:50:55,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-10-13 19:50:55,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 401 transitions. [2019-10-13 19:50:55,031 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 401 transitions. Word has length 46 [2019-10-13 19:50:55,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:55,031 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 401 transitions. [2019-10-13 19:50:55,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:55,031 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 401 transitions. [2019-10-13 19:50:55,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-13 19:50:55,034 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:55,034 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 19:50:55,035 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:55,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:55,035 INFO L82 PathProgramCache]: Analyzing trace with hash 648824040, now seen corresponding path program 1 times [2019-10-13 19:50:55,035 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:55,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673028773] [2019-10-13 19:50:55,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,142 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:50:55,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673028773] [2019-10-13 19:50:55,143 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:55,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:55,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129075498] [2019-10-13 19:50:55,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:55,144 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:55,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:55,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:55,145 INFO L87 Difference]: Start difference. First operand 242 states and 401 transitions. Second operand 5 states. [2019-10-13 19:50:55,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:55,380 INFO L93 Difference]: Finished difference Result 510 states and 854 transitions. [2019-10-13 19:50:55,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:55,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-10-13 19:50:55,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:55,383 INFO L225 Difference]: With dead ends: 510 [2019-10-13 19:50:55,383 INFO L226 Difference]: Without dead ends: 281 [2019-10-13 19:50:55,384 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-13 19:50:55,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-10-13 19:50:55,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 267. [2019-10-13 19:50:55,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-10-13 19:50:55,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 444 transitions. [2019-10-13 19:50:55,398 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 444 transitions. Word has length 64 [2019-10-13 19:50:55,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:55,399 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 444 transitions. [2019-10-13 19:50:55,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:55,399 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 444 transitions. [2019-10-13 19:50:55,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-13 19:50:55,401 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:55,401 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 19:50:55,402 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:55,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:55,402 INFO L82 PathProgramCache]: Analyzing trace with hash 943009440, now seen corresponding path program 1 times [2019-10-13 19:50:55,402 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:55,403 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744433176] [2019-10-13 19:50:55,403 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,403 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,477 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:50:55,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744433176] [2019-10-13 19:50:55,478 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:55,478 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:55,478 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152434392] [2019-10-13 19:50:55,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:55,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:55,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:55,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:55,482 INFO L87 Difference]: Start difference. First operand 267 states and 444 transitions. Second operand 5 states. [2019-10-13 19:50:55,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:55,715 INFO L93 Difference]: Finished difference Result 535 states and 894 transitions. [2019-10-13 19:50:55,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:55,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-13 19:50:55,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:55,718 INFO L225 Difference]: With dead ends: 535 [2019-10-13 19:50:55,718 INFO L226 Difference]: Without dead ends: 281 [2019-10-13 19:50:55,719 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-13 19:50:55,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-10-13 19:50:55,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 267. [2019-10-13 19:50:55,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-10-13 19:50:55,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 441 transitions. [2019-10-13 19:50:55,734 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 441 transitions. Word has length 65 [2019-10-13 19:50:55,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:55,734 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 441 transitions. [2019-10-13 19:50:55,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:55,734 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 441 transitions. [2019-10-13 19:50:55,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-13 19:50:55,736 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:55,736 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 19:50:55,736 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:55,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:55,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1195194559, now seen corresponding path program 1 times [2019-10-13 19:50:55,737 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:55,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965201908] [2019-10-13 19:50:55,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,821 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:50:55,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965201908] [2019-10-13 19:50:55,822 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:55,822 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:55,822 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290447432] [2019-10-13 19:50:55,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:55,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:55,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:55,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:55,824 INFO L87 Difference]: Start difference. First operand 267 states and 441 transitions. Second operand 5 states. [2019-10-13 19:50:56,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:56,076 INFO L93 Difference]: Finished difference Result 552 states and 919 transitions. [2019-10-13 19:50:56,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:56,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-10-13 19:50:56,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:56,079 INFO L225 Difference]: With dead ends: 552 [2019-10-13 19:50:56,080 INFO L226 Difference]: Without dead ends: 298 [2019-10-13 19:50:56,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-13 19:50:56,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-10-13 19:50:56,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2019-10-13 19:50:56,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-13 19:50:56,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 493 transitions. [2019-10-13 19:50:56,107 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 493 transitions. Word has length 66 [2019-10-13 19:50:56,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:56,108 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 493 transitions. [2019-10-13 19:50:56,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:56,108 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 493 transitions. [2019-10-13 19:50:56,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-13 19:50:56,109 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:56,110 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, 1, 1, 1, 1, 1, 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-13 19:50:56,110 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:56,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:56,110 INFO L82 PathProgramCache]: Analyzing trace with hash -379332949, now seen corresponding path program 1 times [2019-10-13 19:50:56,111 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:56,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063150949] [2019-10-13 19:50:56,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,188 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 19:50:56,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063150949] [2019-10-13 19:50:56,189 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:56,191 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:56,191 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824221883] [2019-10-13 19:50:56,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:56,192 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:56,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:56,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:56,193 INFO L87 Difference]: Start difference. First operand 298 states and 493 transitions. Second operand 5 states. [2019-10-13 19:50:56,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:56,386 INFO L93 Difference]: Finished difference Result 600 states and 997 transitions. [2019-10-13 19:50:56,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:56,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-10-13 19:50:56,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:56,390 INFO L225 Difference]: With dead ends: 600 [2019-10-13 19:50:56,390 INFO L226 Difference]: Without dead ends: 315 [2019-10-13 19:50:56,392 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-13 19:50:56,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-10-13 19:50:56,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2019-10-13 19:50:56,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-10-13 19:50:56,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 514 transitions. [2019-10-13 19:50:56,410 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 514 transitions. Word has length 78 [2019-10-13 19:50:56,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:56,410 INFO L462 AbstractCegarLoop]: Abstraction has 313 states and 514 transitions. [2019-10-13 19:50:56,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:56,411 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 514 transitions. [2019-10-13 19:50:56,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-13 19:50:56,412 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:56,412 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] [2019-10-13 19:50:56,412 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:56,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:56,413 INFO L82 PathProgramCache]: Analyzing trace with hash 314969472, now seen corresponding path program 1 times [2019-10-13 19:50:56,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:56,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117237345] [2019-10-13 19:50:56,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,481 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-13 19:50:56,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117237345] [2019-10-13 19:50:56,483 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:56,483 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:56,484 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447411126] [2019-10-13 19:50:56,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:56,484 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:56,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:56,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:56,486 INFO L87 Difference]: Start difference. First operand 313 states and 514 transitions. Second operand 5 states. [2019-10-13 19:50:56,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:56,704 INFO L93 Difference]: Finished difference Result 651 states and 1075 transitions. [2019-10-13 19:50:56,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:56,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-10-13 19:50:56,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:56,707 INFO L225 Difference]: With dead ends: 651 [2019-10-13 19:50:56,708 INFO L226 Difference]: Without dead ends: 351 [2019-10-13 19:50:56,709 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-13 19:50:56,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-10-13 19:50:56,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-10-13 19:50:56,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-10-13 19:50:56,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 574 transitions. [2019-10-13 19:50:56,727 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 574 transitions. Word has length 78 [2019-10-13 19:50:56,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:56,727 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 574 transitions. [2019-10-13 19:50:56,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:56,727 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 574 transitions. [2019-10-13 19:50:56,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-13 19:50:56,729 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:56,729 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, 1, 1, 1, 1, 1, 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-13 19:50:56,729 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:56,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:56,730 INFO L82 PathProgramCache]: Analyzing trace with hash 496741763, now seen corresponding path program 1 times [2019-10-13 19:50:56,730 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:56,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153757609] [2019-10-13 19:50:56,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,805 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 19:50:56,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153757609] [2019-10-13 19:50:56,806 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:56,806 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:56,806 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633397905] [2019-10-13 19:50:56,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:56,807 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:56,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:56,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:56,808 INFO L87 Difference]: Start difference. First operand 349 states and 574 transitions. Second operand 5 states. [2019-10-13 19:50:57,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:57,010 INFO L93 Difference]: Finished difference Result 687 states and 1133 transitions. [2019-10-13 19:50:57,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:57,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-10-13 19:50:57,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:57,013 INFO L225 Difference]: With dead ends: 687 [2019-10-13 19:50:57,014 INFO L226 Difference]: Without dead ends: 351 [2019-10-13 19:50:57,015 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-13 19:50:57,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-10-13 19:50:57,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-10-13 19:50:57,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-10-13 19:50:57,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 568 transitions. [2019-10-13 19:50:57,032 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 568 transitions. Word has length 79 [2019-10-13 19:50:57,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:57,032 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 568 transitions. [2019-10-13 19:50:57,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:57,032 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 568 transitions. [2019-10-13 19:50:57,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-13 19:50:57,034 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:57,034 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] [2019-10-13 19:50:57,034 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:57,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:57,034 INFO L82 PathProgramCache]: Analyzing trace with hash -70012323, now seen corresponding path program 1 times [2019-10-13 19:50:57,035 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:57,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731974640] [2019-10-13 19:50:57,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,083 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-13 19:50:57,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731974640] [2019-10-13 19:50:57,084 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:57,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:57,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165297716] [2019-10-13 19:50:57,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:57,085 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:57,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:57,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:57,086 INFO L87 Difference]: Start difference. First operand 349 states and 568 transitions. Second operand 5 states. [2019-10-13 19:50:57,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:57,306 INFO L93 Difference]: Finished difference Result 687 states and 1121 transitions. [2019-10-13 19:50:57,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:57,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-10-13 19:50:57,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:57,309 INFO L225 Difference]: With dead ends: 687 [2019-10-13 19:50:57,310 INFO L226 Difference]: Without dead ends: 351 [2019-10-13 19:50:57,311 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-13 19:50:57,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-10-13 19:50:57,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-10-13 19:50:57,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-10-13 19:50:57,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 566 transitions. [2019-10-13 19:50:57,329 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 566 transitions. Word has length 79 [2019-10-13 19:50:57,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:57,330 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 566 transitions. [2019-10-13 19:50:57,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:57,330 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 566 transitions. [2019-10-13 19:50:57,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-13 19:50:57,331 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:57,331 INFO L380 BasicCegarLoop]: trace histogram [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-13 19:50:57,331 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:57,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:57,332 INFO L82 PathProgramCache]: Analyzing trace with hash 2051852968, now seen corresponding path program 1 times [2019-10-13 19:50:57,332 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:57,332 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393503289] [2019-10-13 19:50:57,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,408 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 19:50:57,408 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393503289] [2019-10-13 19:50:57,408 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:57,409 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:57,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414129859] [2019-10-13 19:50:57,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:57,410 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:57,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:57,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:57,410 INFO L87 Difference]: Start difference. First operand 349 states and 566 transitions. Second operand 5 states. [2019-10-13 19:50:57,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:57,629 INFO L93 Difference]: Finished difference Result 714 states and 1163 transitions. [2019-10-13 19:50:57,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:57,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-10-13 19:50:57,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:57,633 INFO L225 Difference]: With dead ends: 714 [2019-10-13 19:50:57,633 INFO L226 Difference]: Without dead ends: 378 [2019-10-13 19:50:57,634 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-13 19:50:57,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-10-13 19:50:57,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 373. [2019-10-13 19:50:57,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-10-13 19:50:57,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 601 transitions. [2019-10-13 19:50:57,654 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 601 transitions. Word has length 85 [2019-10-13 19:50:57,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:57,654 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 601 transitions. [2019-10-13 19:50:57,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:57,655 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 601 transitions. [2019-10-13 19:50:57,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-13 19:50:57,656 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:57,656 INFO L380 BasicCegarLoop]: trace histogram [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-13 19:50:57,657 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:57,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:57,657 INFO L82 PathProgramCache]: Analyzing trace with hash 406324048, now seen corresponding path program 1 times [2019-10-13 19:50:57,657 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:57,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477620787] [2019-10-13 19:50:57,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,730 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-13 19:50:57,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477620787] [2019-10-13 19:50:57,731 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:57,731 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:57,731 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051204126] [2019-10-13 19:50:57,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:57,732 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:57,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:57,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:57,733 INFO L87 Difference]: Start difference. First operand 373 states and 601 transitions. Second operand 5 states. [2019-10-13 19:50:57,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:57,932 INFO L93 Difference]: Finished difference Result 738 states and 1192 transitions. [2019-10-13 19:50:57,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:57,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-10-13 19:50:57,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:57,936 INFO L225 Difference]: With dead ends: 738 [2019-10-13 19:50:57,936 INFO L226 Difference]: Without dead ends: 378 [2019-10-13 19:50:57,937 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-13 19:50:57,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-10-13 19:50:57,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 373. [2019-10-13 19:50:57,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-10-13 19:50:57,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 595 transitions. [2019-10-13 19:50:57,958 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 595 transitions. Word has length 86 [2019-10-13 19:50:57,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:57,959 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 595 transitions. [2019-10-13 19:50:57,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:57,959 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 595 transitions. [2019-10-13 19:50:57,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-13 19:50:57,963 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:57,963 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:50:57,963 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:57,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:57,964 INFO L82 PathProgramCache]: Analyzing trace with hash 2087471906, now seen corresponding path program 1 times [2019-10-13 19:50:57,964 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:57,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301516112] [2019-10-13 19:50:57,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,024 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-13 19:50:58,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301516112] [2019-10-13 19:50:58,024 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:58,025 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:58,025 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295096906] [2019-10-13 19:50:58,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:58,026 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:58,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:58,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:58,026 INFO L87 Difference]: Start difference. First operand 373 states and 595 transitions. Second operand 5 states. [2019-10-13 19:50:58,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:58,226 INFO L93 Difference]: Finished difference Result 742 states and 1185 transitions. [2019-10-13 19:50:58,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:58,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-10-13 19:50:58,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:58,229 INFO L225 Difference]: With dead ends: 742 [2019-10-13 19:50:58,229 INFO L226 Difference]: Without dead ends: 382 [2019-10-13 19:50:58,231 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-13 19:50:58,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-10-13 19:50:58,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2019-10-13 19:50:58,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-10-13 19:50:58,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 598 transitions. [2019-10-13 19:50:58,251 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 598 transitions. Word has length 91 [2019-10-13 19:50:58,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:58,251 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 598 transitions. [2019-10-13 19:50:58,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:58,252 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 598 transitions. [2019-10-13 19:50:58,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 19:50:58,254 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:58,255 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, 1, 1, 1, 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-13 19:50:58,255 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:58,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:58,255 INFO L82 PathProgramCache]: Analyzing trace with hash 754738376, now seen corresponding path program 1 times [2019-10-13 19:50:58,256 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:58,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951261298] [2019-10-13 19:50:58,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,306 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 19:50:58,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951261298] [2019-10-13 19:50:58,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:58,307 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:58,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860069776] [2019-10-13 19:50:58,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:58,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:58,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:58,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:58,309 INFO L87 Difference]: Start difference. First operand 382 states and 598 transitions. Second operand 5 states. [2019-10-13 19:50:58,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:58,535 INFO L93 Difference]: Finished difference Result 782 states and 1226 transitions. [2019-10-13 19:50:58,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:58,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-10-13 19:50:58,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:58,539 INFO L225 Difference]: With dead ends: 782 [2019-10-13 19:50:58,553 INFO L226 Difference]: Without dead ends: 413 [2019-10-13 19:50:58,556 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-13 19:50:58,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-10-13 19:50:58,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2019-10-13 19:50:58,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-10-13 19:50:58,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 639 transitions. [2019-10-13 19:50:58,577 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 639 transitions. Word has length 92 [2019-10-13 19:50:58,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:58,578 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 639 transitions. [2019-10-13 19:50:58,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:58,578 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 639 transitions. [2019-10-13 19:50:58,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-13 19:50:58,580 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:58,580 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, 1, 1, 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-13 19:50:58,580 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:58,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:58,581 INFO L82 PathProgramCache]: Analyzing trace with hash -196155072, now seen corresponding path program 1 times [2019-10-13 19:50:58,581 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:58,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008301058] [2019-10-13 19:50:58,581 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,639 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 19:50:58,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008301058] [2019-10-13 19:50:58,644 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:58,644 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:58,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073072624] [2019-10-13 19:50:58,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:58,647 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:58,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:58,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:58,648 INFO L87 Difference]: Start difference. First operand 411 states and 639 transitions. Second operand 5 states. [2019-10-13 19:50:58,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:58,862 INFO L93 Difference]: Finished difference Result 811 states and 1263 transitions. [2019-10-13 19:50:58,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:58,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-10-13 19:50:58,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:58,865 INFO L225 Difference]: With dead ends: 811 [2019-10-13 19:50:58,865 INFO L226 Difference]: Without dead ends: 413 [2019-10-13 19:50:58,867 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-13 19:50:58,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-10-13 19:50:58,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2019-10-13 19:50:58,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-10-13 19:50:58,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 635 transitions. [2019-10-13 19:50:58,891 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 635 transitions. Word has length 93 [2019-10-13 19:50:58,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:58,892 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 635 transitions. [2019-10-13 19:50:58,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:58,893 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 635 transitions. [2019-10-13 19:50:58,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 19:50:58,895 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:58,896 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-10-13 19:50:58,896 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:58,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:58,897 INFO L82 PathProgramCache]: Analyzing trace with hash 222103604, now seen corresponding path program 1 times [2019-10-13 19:50:58,897 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:58,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397650877] [2019-10-13 19:50:58,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-13 19:50:58,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397650877] [2019-10-13 19:50:58,983 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:58,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:58,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863073203] [2019-10-13 19:50:58,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:58,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:58,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:58,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:58,985 INFO L87 Difference]: Start difference. First operand 411 states and 635 transitions. Second operand 5 states. [2019-10-13 19:50:59,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:59,270 INFO L93 Difference]: Finished difference Result 834 states and 1294 transitions. [2019-10-13 19:50:59,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:59,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 19:50:59,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:59,274 INFO L225 Difference]: With dead ends: 834 [2019-10-13 19:50:59,275 INFO L226 Difference]: Without dead ends: 436 [2019-10-13 19:50:59,277 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-13 19:50:59,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-10-13 19:50:59,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 432. [2019-10-13 19:50:59,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-10-13 19:50:59,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 662 transitions. [2019-10-13 19:50:59,314 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 662 transitions. Word has length 106 [2019-10-13 19:50:59,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:59,314 INFO L462 AbstractCegarLoop]: Abstraction has 432 states and 662 transitions. [2019-10-13 19:50:59,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:59,315 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 662 transitions. [2019-10-13 19:50:59,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 19:50:59,318 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:59,318 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-10-13 19:50:59,319 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:59,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:59,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1331192532, now seen corresponding path program 1 times [2019-10-13 19:50:59,320 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:59,321 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966587456] [2019-10-13 19:50:59,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:59,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:59,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,410 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-13 19:50:59,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966587456] [2019-10-13 19:50:59,411 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:59,412 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:59,412 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292283328] [2019-10-13 19:50:59,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:59,413 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:59,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:59,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:59,414 INFO L87 Difference]: Start difference. First operand 432 states and 662 transitions. Second operand 5 states. [2019-10-13 19:50:59,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:59,725 INFO L93 Difference]: Finished difference Result 855 states and 1313 transitions. [2019-10-13 19:50:59,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:59,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-10-13 19:50:59,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:59,729 INFO L225 Difference]: With dead ends: 855 [2019-10-13 19:50:59,730 INFO L226 Difference]: Without dead ends: 436 [2019-10-13 19:50:59,731 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-13 19:50:59,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-10-13 19:50:59,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 432. [2019-10-13 19:50:59,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-10-13 19:50:59,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 654 transitions. [2019-10-13 19:50:59,766 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 654 transitions. Word has length 107 [2019-10-13 19:50:59,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:59,766 INFO L462 AbstractCegarLoop]: Abstraction has 432 states and 654 transitions. [2019-10-13 19:50:59,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:59,767 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 654 transitions. [2019-10-13 19:50:59,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-13 19:50:59,769 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:59,770 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, 1, 1] [2019-10-13 19:50:59,770 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:59,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:59,771 INFO L82 PathProgramCache]: Analyzing trace with hash -276692460, now seen corresponding path program 1 times [2019-10-13 19:50:59,771 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:59,771 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982821609] [2019-10-13 19:50:59,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:59,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:59,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,860 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 19:50:59,860 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982821609] [2019-10-13 19:50:59,861 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:59,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:59,861 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757688499] [2019-10-13 19:50:59,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:59,863 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:59,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:59,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:59,864 INFO L87 Difference]: Start difference. First operand 432 states and 654 transitions. Second operand 5 states. [2019-10-13 19:51:00,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:00,194 INFO L93 Difference]: Finished difference Result 896 states and 1357 transitions. [2019-10-13 19:51:00,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:00,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-10-13 19:51:00,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:00,199 INFO L225 Difference]: With dead ends: 896 [2019-10-13 19:51:00,199 INFO L226 Difference]: Without dead ends: 477 [2019-10-13 19:51:00,201 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-13 19:51:00,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-10-13 19:51:00,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 474. [2019-10-13 19:51:00,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-10-13 19:51:00,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 715 transitions. [2019-10-13 19:51:00,244 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 715 transitions. Word has length 108 [2019-10-13 19:51:00,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:00,244 INFO L462 AbstractCegarLoop]: Abstraction has 474 states and 715 transitions. [2019-10-13 19:51:00,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:51:00,244 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 715 transitions. [2019-10-13 19:51:00,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-13 19:51:00,248 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:00,248 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] [2019-10-13 19:51:00,248 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:00,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:00,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1027622475, now seen corresponding path program 1 times [2019-10-13 19:51:00,249 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:00,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082611610] [2019-10-13 19:51:00,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:00,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:00,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,332 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-13 19:51:00,333 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082611610] [2019-10-13 19:51:00,333 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:00,333 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:51:00,333 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064931051] [2019-10-13 19:51:00,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:51:00,334 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:00,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:51:00,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:00,335 INFO L87 Difference]: Start difference. First operand 474 states and 715 transitions. Second operand 5 states. [2019-10-13 19:51:00,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:00,630 INFO L93 Difference]: Finished difference Result 971 states and 1465 transitions. [2019-10-13 19:51:00,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:00,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-10-13 19:51:00,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:00,633 INFO L225 Difference]: With dead ends: 971 [2019-10-13 19:51:00,634 INFO L226 Difference]: Without dead ends: 510 [2019-10-13 19:51:00,635 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-13 19:51:00,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-10-13 19:51:00,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 508. [2019-10-13 19:51:00,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-10-13 19:51:00,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 761 transitions. [2019-10-13 19:51:00,665 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 761 transitions. Word has length 109 [2019-10-13 19:51:00,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:00,666 INFO L462 AbstractCegarLoop]: Abstraction has 508 states and 761 transitions. [2019-10-13 19:51:00,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:51:00,666 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 761 transitions. [2019-10-13 19:51:00,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-13 19:51:00,668 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:00,668 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, 1, 1, 1] [2019-10-13 19:51:00,669 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:00,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:00,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1688696815, now seen corresponding path program 1 times [2019-10-13 19:51:00,670 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:00,670 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483666596] [2019-10-13 19:51:00,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:00,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:00,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,743 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 19:51:00,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483666596] [2019-10-13 19:51:00,743 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:00,744 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:51:00,744 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287524452] [2019-10-13 19:51:00,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:51:00,750 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:00,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:51:00,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:00,751 INFO L87 Difference]: Start difference. First operand 508 states and 761 transitions. Second operand 5 states. [2019-10-13 19:51:00,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:00,993 INFO L93 Difference]: Finished difference Result 1010 states and 1516 transitions. [2019-10-13 19:51:00,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:00,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-10-13 19:51:00,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:00,997 INFO L225 Difference]: With dead ends: 1010 [2019-10-13 19:51:00,998 INFO L226 Difference]: Without dead ends: 513 [2019-10-13 19:51:01,000 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-13 19:51:01,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-10-13 19:51:01,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 510. [2019-10-13 19:51:01,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-10-13 19:51:01,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 764 transitions. [2019-10-13 19:51:01,039 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 764 transitions. Word has length 109 [2019-10-13 19:51:01,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:01,039 INFO L462 AbstractCegarLoop]: Abstraction has 510 states and 764 transitions. [2019-10-13 19:51:01,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:51:01,039 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 764 transitions. [2019-10-13 19:51:01,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-13 19:51:01,044 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:01,044 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] [2019-10-13 19:51:01,045 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:01,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:01,046 INFO L82 PathProgramCache]: Analyzing trace with hash -429369896, now seen corresponding path program 1 times [2019-10-13 19:51:01,046 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:01,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306746540] [2019-10-13 19:51:01,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,127 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-13 19:51:01,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306746540] [2019-10-13 19:51:01,128 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:01,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:51:01,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961913785] [2019-10-13 19:51:01,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:51:01,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:01,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:51:01,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:01,130 INFO L87 Difference]: Start difference. First operand 510 states and 764 transitions. Second operand 5 states. [2019-10-13 19:51:01,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:01,386 INFO L93 Difference]: Finished difference Result 1009 states and 1513 transitions. [2019-10-13 19:51:01,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:01,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-10-13 19:51:01,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:01,392 INFO L225 Difference]: With dead ends: 1009 [2019-10-13 19:51:01,392 INFO L226 Difference]: Without dead ends: 512 [2019-10-13 19:51:01,394 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-13 19:51:01,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-10-13 19:51:01,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 510. [2019-10-13 19:51:01,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-10-13 19:51:01,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 760 transitions. [2019-10-13 19:51:01,428 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 760 transitions. Word has length 110 [2019-10-13 19:51:01,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:01,428 INFO L462 AbstractCegarLoop]: Abstraction has 510 states and 760 transitions. [2019-10-13 19:51:01,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:51:01,428 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 760 transitions. [2019-10-13 19:51:01,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-13 19:51:01,430 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:01,431 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2019-10-13 19:51:01,431 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:01,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:01,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1290144821, now seen corresponding path program 1 times [2019-10-13 19:51:01,432 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:01,432 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498660849] [2019-10-13 19:51:01,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-13 19:51:01,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498660849] [2019-10-13 19:51:01,478 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:01,478 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:01,478 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233478064] [2019-10-13 19:51:01,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:01,479 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:01,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:01,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:01,480 INFO L87 Difference]: Start difference. First operand 510 states and 760 transitions. Second operand 3 states. [2019-10-13 19:51:01,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:01,547 INFO L93 Difference]: Finished difference Result 1497 states and 2233 transitions. [2019-10-13 19:51:01,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:01,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-10-13 19:51:01,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:01,553 INFO L225 Difference]: With dead ends: 1497 [2019-10-13 19:51:01,553 INFO L226 Difference]: Without dead ends: 1000 [2019-10-13 19:51:01,554 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-13 19:51:01,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2019-10-13 19:51:01,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 511. [2019-10-13 19:51:01,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-10-13 19:51:01,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 761 transitions. [2019-10-13 19:51:01,590 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 761 transitions. Word has length 122 [2019-10-13 19:51:01,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:01,590 INFO L462 AbstractCegarLoop]: Abstraction has 511 states and 761 transitions. [2019-10-13 19:51:01,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:01,590 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 761 transitions. [2019-10-13 19:51:01,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-13 19:51:01,592 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:01,593 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2019-10-13 19:51:01,593 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:01,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:01,593 INFO L82 PathProgramCache]: Analyzing trace with hash -953838477, now seen corresponding path program 1 times [2019-10-13 19:51:01,593 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:01,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751523444] [2019-10-13 19:51:01,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,674 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-13 19:51:01,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751523444] [2019-10-13 19:51:01,675 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:01,675 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:01,675 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695445737] [2019-10-13 19:51:01,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:01,677 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:01,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:01,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:01,678 INFO L87 Difference]: Start difference. First operand 511 states and 761 transitions. Second operand 3 states. [2019-10-13 19:51:01,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:01,767 INFO L93 Difference]: Finished difference Result 1505 states and 2248 transitions. [2019-10-13 19:51:01,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:01,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-10-13 19:51:01,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:01,774 INFO L225 Difference]: With dead ends: 1505 [2019-10-13 19:51:01,774 INFO L226 Difference]: Without dead ends: 1007 [2019-10-13 19:51:01,776 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-13 19:51:01,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2019-10-13 19:51:01,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 1007. [2019-10-13 19:51:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2019-10-13 19:51:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1498 transitions. [2019-10-13 19:51:01,830 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1498 transitions. Word has length 122 [2019-10-13 19:51:01,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:01,830 INFO L462 AbstractCegarLoop]: Abstraction has 1007 states and 1498 transitions. [2019-10-13 19:51:01,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:01,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1498 transitions. [2019-10-13 19:51:01,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-13 19:51:01,833 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:01,833 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2019-10-13 19:51:01,833 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:01,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:01,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1636886403, now seen corresponding path program 1 times [2019-10-13 19:51:01,834 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:01,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070674532] [2019-10-13 19:51:01,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,884 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-13 19:51:01,884 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070674532] [2019-10-13 19:51:01,884 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:01,884 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:01,885 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333585147] [2019-10-13 19:51:01,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:01,885 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:01,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:01,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:01,886 INFO L87 Difference]: Start difference. First operand 1007 states and 1498 transitions. Second operand 3 states. [2019-10-13 19:51:02,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:02,002 INFO L93 Difference]: Finished difference Result 2499 states and 3723 transitions. [2019-10-13 19:51:02,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:02,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-10-13 19:51:02,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:02,011 INFO L225 Difference]: With dead ends: 2499 [2019-10-13 19:51:02,011 INFO L226 Difference]: Without dead ends: 1505 [2019-10-13 19:51:02,014 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-13 19:51:02,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2019-10-13 19:51:02,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1503. [2019-10-13 19:51:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-10-13 19:51:02,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 2239 transitions. [2019-10-13 19:51:02,099 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 2239 transitions. Word has length 124 [2019-10-13 19:51:02,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:02,099 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 2239 transitions. [2019-10-13 19:51:02,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:02,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2239 transitions. [2019-10-13 19:51:02,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-13 19:51:02,102 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:02,103 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2019-10-13 19:51:02,103 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:02,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:02,103 INFO L82 PathProgramCache]: Analyzing trace with hash -89246318, now seen corresponding path program 1 times [2019-10-13 19:51:02,104 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:02,104 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401339993] [2019-10-13 19:51:02,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:02,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:02,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,164 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-13 19:51:02,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401339993] [2019-10-13 19:51:02,165 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:02,165 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:02,165 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549207809] [2019-10-13 19:51:02,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:02,166 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:02,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:02,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:02,167 INFO L87 Difference]: Start difference. First operand 1503 states and 2239 transitions. Second operand 3 states. [2019-10-13 19:51:02,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:02,328 INFO L93 Difference]: Finished difference Result 2003 states and 2984 transitions. [2019-10-13 19:51:02,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:02,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-10-13 19:51:02,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:02,338 INFO L225 Difference]: With dead ends: 2003 [2019-10-13 19:51:02,338 INFO L226 Difference]: Without dead ends: 2001 [2019-10-13 19:51:02,340 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-13 19:51:02,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2019-10-13 19:51:02,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1999. [2019-10-13 19:51:02,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1999 states. [2019-10-13 19:51:02,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 2981 transitions. [2019-10-13 19:51:02,456 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 2981 transitions. Word has length 125 [2019-10-13 19:51:02,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:02,456 INFO L462 AbstractCegarLoop]: Abstraction has 1999 states and 2981 transitions. [2019-10-13 19:51:02,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:02,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 2981 transitions. [2019-10-13 19:51:02,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-13 19:51:02,461 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:02,461 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] [2019-10-13 19:51:02,462 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:02,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:02,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1672983707, now seen corresponding path program 1 times [2019-10-13 19:51:02,464 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:02,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796979392] [2019-10-13 19:51:02,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:02,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:02,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,537 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-13 19:51:02,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796979392] [2019-10-13 19:51:02,538 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:02,538 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:51:02,538 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155031818] [2019-10-13 19:51:02,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:51:02,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:02,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:51:02,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:02,542 INFO L87 Difference]: Start difference. First operand 1999 states and 2981 transitions. Second operand 5 states. [2019-10-13 19:51:02,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:02,841 INFO L93 Difference]: Finished difference Result 4173 states and 6206 transitions. [2019-10-13 19:51:02,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:02,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2019-10-13 19:51:02,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:02,854 INFO L225 Difference]: With dead ends: 4173 [2019-10-13 19:51:02,854 INFO L226 Difference]: Without dead ends: 2187 [2019-10-13 19:51:02,859 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-13 19:51:02,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2019-10-13 19:51:02,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2163. [2019-10-13 19:51:02,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2163 states. [2019-10-13 19:51:03,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 3201 transitions. [2019-10-13 19:51:03,007 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 3201 transitions. Word has length 155 [2019-10-13 19:51:03,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:03,007 INFO L462 AbstractCegarLoop]: Abstraction has 2163 states and 3201 transitions. [2019-10-13 19:51:03,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:51:03,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 3201 transitions. [2019-10-13 19:51:03,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-13 19:51:03,012 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:03,012 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] [2019-10-13 19:51:03,013 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:03,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:03,013 INFO L82 PathProgramCache]: Analyzing trace with hash -132146072, now seen corresponding path program 1 times [2019-10-13 19:51:03,013 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:03,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288485745] [2019-10-13 19:51:03,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:03,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:03,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,090 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-13 19:51:03,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288485745] [2019-10-13 19:51:03,090 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:03,091 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:51:03,091 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672264487] [2019-10-13 19:51:03,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:51:03,091 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:03,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:51:03,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:03,092 INFO L87 Difference]: Start difference. First operand 2163 states and 3201 transitions. Second operand 5 states. [2019-10-13 19:51:03,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:03,453 INFO L93 Difference]: Finished difference Result 4337 states and 6418 transitions. [2019-10-13 19:51:03,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:03,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-10-13 19:51:03,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:03,465 INFO L225 Difference]: With dead ends: 4337 [2019-10-13 19:51:03,465 INFO L226 Difference]: Without dead ends: 2155 [2019-10-13 19:51:03,470 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-13 19:51:03,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2155 states. [2019-10-13 19:51:03,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2155 to 2131. [2019-10-13 19:51:03,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-10-13 19:51:03,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 3145 transitions. [2019-10-13 19:51:03,592 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 3145 transitions. Word has length 156 [2019-10-13 19:51:03,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:03,593 INFO L462 AbstractCegarLoop]: Abstraction has 2131 states and 3145 transitions. [2019-10-13 19:51:03,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:51:03,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 3145 transitions. [2019-10-13 19:51:03,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-13 19:51:03,599 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:03,599 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] [2019-10-13 19:51:03,599 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:03,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:03,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1669045776, now seen corresponding path program 1 times [2019-10-13 19:51:03,600 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:03,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900596437] [2019-10-13 19:51:03,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:03,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:03,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,689 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-13 19:51:03,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900596437] [2019-10-13 19:51:03,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607171161] [2019-10-13 19:51:03,690 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-13 19:51:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 19:51:03,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:03,957 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-13 19:51:03,957 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:51:03,958 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:51:03,958 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259200097] [2019-10-13 19:51:03,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:03,960 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:03,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:03,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:03,960 INFO L87 Difference]: Start difference. First operand 2131 states and 3145 transitions. Second operand 3 states. [2019-10-13 19:51:04,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:04,144 INFO L93 Difference]: Finished difference Result 4780 states and 7056 transitions. [2019-10-13 19:51:04,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:04,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-10-13 19:51:04,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:04,158 INFO L225 Difference]: With dead ends: 4780 [2019-10-13 19:51:04,158 INFO L226 Difference]: Without dead ends: 2662 [2019-10-13 19:51:04,164 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 190 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-13 19:51:04,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2019-10-13 19:51:04,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2660. [2019-10-13 19:51:04,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2019-10-13 19:51:04,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 3906 transitions. [2019-10-13 19:51:04,394 INFO L78 Accepts]: Start accepts. Automaton has 2660 states and 3906 transitions. Word has length 188 [2019-10-13 19:51:04,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:04,395 INFO L462 AbstractCegarLoop]: Abstraction has 2660 states and 3906 transitions. [2019-10-13 19:51:04,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:04,396 INFO L276 IsEmpty]: Start isEmpty. Operand 2660 states and 3906 transitions. [2019-10-13 19:51:04,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-13 19:51:04,406 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:04,406 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:04,614 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:04,614 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:04,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:04,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1467791988, now seen corresponding path program 1 times [2019-10-13 19:51:04,618 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:04,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048590066] [2019-10-13 19:51:04,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:04,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:04,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,755 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-13 19:51:04,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048590066] [2019-10-13 19:51:04,756 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:04,757 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:04,757 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780858663] [2019-10-13 19:51:04,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:04,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:04,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:04,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:04,759 INFO L87 Difference]: Start difference. First operand 2660 states and 3906 transitions. Second operand 3 states. [2019-10-13 19:51:05,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:05,066 INFO L93 Difference]: Finished difference Result 4249 states and 6242 transitions. [2019-10-13 19:51:05,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:05,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-10-13 19:51:05,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:05,089 INFO L225 Difference]: With dead ends: 4249 [2019-10-13 19:51:05,089 INFO L226 Difference]: Without dead ends: 3189 [2019-10-13 19:51:05,096 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-13 19:51:05,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2019-10-13 19:51:05,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 3189. [2019-10-13 19:51:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3189 states. [2019-10-13 19:51:05,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 4686 transitions. [2019-10-13 19:51:05,369 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 4686 transitions. Word has length 192 [2019-10-13 19:51:05,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:05,370 INFO L462 AbstractCegarLoop]: Abstraction has 3189 states and 4686 transitions. [2019-10-13 19:51:05,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:05,370 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 4686 transitions. [2019-10-13 19:51:05,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-10-13 19:51:05,398 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:05,399 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-10-13 19:51:05,399 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:05,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:05,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1040739973, now seen corresponding path program 1 times [2019-10-13 19:51:05,400 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:05,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825356687] [2019-10-13 19:51:05,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:05,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:05,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,573 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2019-10-13 19:51:05,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825356687] [2019-10-13 19:51:05,580 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:05,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:05,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72298607] [2019-10-13 19:51:05,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:05,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:05,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:05,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:05,586 INFO L87 Difference]: Start difference. First operand 3189 states and 4686 transitions. Second operand 3 states. [2019-10-13 19:51:05,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:05,931 INFO L93 Difference]: Finished difference Result 6425 states and 9427 transitions. [2019-10-13 19:51:05,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:05,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2019-10-13 19:51:05,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:05,975 INFO L225 Difference]: With dead ends: 6425 [2019-10-13 19:51:05,975 INFO L226 Difference]: Without dead ends: 3249 [2019-10-13 19:51:05,987 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-13 19:51:05,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2019-10-13 19:51:06,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 3189. [2019-10-13 19:51:06,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3189 states. [2019-10-13 19:51:06,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 4638 transitions. [2019-10-13 19:51:06,228 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 4638 transitions. Word has length 270 [2019-10-13 19:51:06,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:06,229 INFO L462 AbstractCegarLoop]: Abstraction has 3189 states and 4638 transitions. [2019-10-13 19:51:06,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:06,229 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 4638 transitions. [2019-10-13 19:51:06,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-13 19:51:06,239 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:06,239 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 5, 5, 4, 4, 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] [2019-10-13 19:51:06,241 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:06,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:06,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1618154303, now seen corresponding path program 1 times [2019-10-13 19:51:06,242 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:06,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487995708] [2019-10-13 19:51:06,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:06,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:06,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,339 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 442 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-13 19:51:06,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487995708] [2019-10-13 19:51:06,340 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:06,340 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:06,340 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977896462] [2019-10-13 19:51:06,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:06,341 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:06,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:06,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:06,342 INFO L87 Difference]: Start difference. First operand 3189 states and 4638 transitions. Second operand 3 states. [2019-10-13 19:51:06,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:06,724 INFO L93 Difference]: Finished difference Result 6461 states and 9373 transitions. [2019-10-13 19:51:06,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:06,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2019-10-13 19:51:06,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:06,734 INFO L225 Difference]: With dead ends: 6461 [2019-10-13 19:51:06,734 INFO L226 Difference]: Without dead ends: 3285 [2019-10-13 19:51:06,744 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-13 19:51:06,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3285 states. [2019-10-13 19:51:06,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3285 to 3189. [2019-10-13 19:51:06,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3189 states. [2019-10-13 19:51:06,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 4422 transitions. [2019-10-13 19:51:06,965 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 4422 transitions. Word has length 274 [2019-10-13 19:51:06,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:06,965 INFO L462 AbstractCegarLoop]: Abstraction has 3189 states and 4422 transitions. [2019-10-13 19:51:06,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:06,966 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 4422 transitions. [2019-10-13 19:51:06,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-13 19:51:06,976 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:06,976 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-10-13 19:51:06,976 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:06,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:06,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1393049634, now seen corresponding path program 1 times [2019-10-13 19:51:06,977 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:06,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495241354] [2019-10-13 19:51:06,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:06,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:06,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,085 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-10-13 19:51:07,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495241354] [2019-10-13 19:51:07,086 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:07,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:07,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358884005] [2019-10-13 19:51:07,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:07,088 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:07,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:07,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:07,089 INFO L87 Difference]: Start difference. First operand 3189 states and 4422 transitions. Second operand 3 states. [2019-10-13 19:51:07,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:07,403 INFO L93 Difference]: Finished difference Result 6469 states and 8954 transitions. [2019-10-13 19:51:07,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:07,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 284 [2019-10-13 19:51:07,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:07,411 INFO L225 Difference]: With dead ends: 6469 [2019-10-13 19:51:07,412 INFO L226 Difference]: Without dead ends: 3293 [2019-10-13 19:51:07,419 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-13 19:51:07,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3293 states. [2019-10-13 19:51:07,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3293 to 3195. [2019-10-13 19:51:07,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3195 states. [2019-10-13 19:51:07,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3195 states to 3195 states and 4275 transitions. [2019-10-13 19:51:07,577 INFO L78 Accepts]: Start accepts. Automaton has 3195 states and 4275 transitions. Word has length 284 [2019-10-13 19:51:07,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:07,577 INFO L462 AbstractCegarLoop]: Abstraction has 3195 states and 4275 transitions. [2019-10-13 19:51:07,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:07,577 INFO L276 IsEmpty]: Start isEmpty. Operand 3195 states and 4275 transitions. [2019-10-13 19:51:07,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-13 19:51:07,587 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:07,588 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, 4, 4, 4, 4, 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, 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-13 19:51:07,588 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:07,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:07,588 INFO L82 PathProgramCache]: Analyzing trace with hash -27112689, now seen corresponding path program 1 times [2019-10-13 19:51:07,589 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:07,589 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698760683] [2019-10-13 19:51:07,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:07,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:07,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:07,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,744 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-10-13 19:51:07,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698760683] [2019-10-13 19:51:07,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953823268] [2019-10-13 19:51:07,745 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-13 19:51:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:07,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:07,977 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2019-10-13 19:51:07,978 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:51:07,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:51:07,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214090454] [2019-10-13 19:51:07,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:07,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:07,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:07,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:07,980 INFO L87 Difference]: Start difference. First operand 3195 states and 4275 transitions. Second operand 3 states. [2019-10-13 19:51:08,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:08,271 INFO L93 Difference]: Finished difference Result 9385 states and 12539 transitions. [2019-10-13 19:51:08,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:08,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2019-10-13 19:51:08,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:08,288 INFO L225 Difference]: With dead ends: 9385 [2019-10-13 19:51:08,288 INFO L226 Difference]: Without dead ends: 6209 [2019-10-13 19:51:08,297 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 296 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-13 19:51:08,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6209 states. [2019-10-13 19:51:08,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6209 to 6207. [2019-10-13 19:51:08,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6207 states. [2019-10-13 19:51:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 8271 transitions. [2019-10-13 19:51:08,666 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 8271 transitions. Word has length 294 [2019-10-13 19:51:08,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:08,667 INFO L462 AbstractCegarLoop]: Abstraction has 6207 states and 8271 transitions. [2019-10-13 19:51:08,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:08,667 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 8271 transitions. [2019-10-13 19:51:08,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-13 19:51:08,685 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:08,685 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, 4, 4, 4, 4, 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, 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-13 19:51:08,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:08,891 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:08,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:08,891 INFO L82 PathProgramCache]: Analyzing trace with hash 533587089, now seen corresponding path program 1 times [2019-10-13 19:51:08,891 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:08,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43198548] [2019-10-13 19:51:08,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:08,892 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:08,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:09,004 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-10-13 19:51:09,004 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43198548] [2019-10-13 19:51:09,005 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385341177] [2019-10-13 19:51:09,005 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-13 19:51:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:09,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:09,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:09,267 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-10-13 19:51:09,267 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:51:09,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-13 19:51:09,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004583823] [2019-10-13 19:51:09,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:51:09,270 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:09,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:51:09,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:51:09,270 INFO L87 Difference]: Start difference. First operand 6207 states and 8271 transitions. Second operand 4 states. [2019-10-13 19:51:10,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:10,141 INFO L93 Difference]: Finished difference Result 17827 states and 23541 transitions. [2019-10-13 19:51:10,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:10,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 294 [2019-10-13 19:51:10,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:10,167 INFO L225 Difference]: With dead ends: 17827 [2019-10-13 19:51:10,167 INFO L226 Difference]: Without dead ends: 11483 [2019-10-13 19:51:10,181 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:10,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11483 states. [2019-10-13 19:51:10,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11483 to 6371. [2019-10-13 19:51:10,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6371 states. [2019-10-13 19:51:10,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6371 states to 6371 states and 8489 transitions. [2019-10-13 19:51:10,518 INFO L78 Accepts]: Start accepts. Automaton has 6371 states and 8489 transitions. Word has length 294 [2019-10-13 19:51:10,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:10,519 INFO L462 AbstractCegarLoop]: Abstraction has 6371 states and 8489 transitions. [2019-10-13 19:51:10,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:51:10,519 INFO L276 IsEmpty]: Start isEmpty. Operand 6371 states and 8489 transitions. [2019-10-13 19:51:10,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-13 19:51:10,536 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:10,536 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-10-13 19:51:10,802 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:10,803 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:10,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:10,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1875632044, now seen corresponding path program 1 times [2019-10-13 19:51:10,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:10,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840574837] [2019-10-13 19:51:10,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:10,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:10,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:10,925 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 631 proven. 26 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-10-13 19:51:10,925 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840574837] [2019-10-13 19:51:10,925 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848982910] [2019-10-13 19:51:10,926 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-13 19:51:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:11,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:11,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:11,143 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 631 proven. 26 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-10-13 19:51:11,143 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:51:11,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-13 19:51:11,144 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470336024] [2019-10-13 19:51:11,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:51:11,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:11,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:51:11,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:51:11,145 INFO L87 Difference]: Start difference. First operand 6371 states and 8489 transitions. Second operand 4 states. [2019-10-13 19:51:11,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:11,774 INFO L93 Difference]: Finished difference Result 14256 states and 18832 transitions. [2019-10-13 19:51:11,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:11,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 303 [2019-10-13 19:51:11,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:11,793 INFO L225 Difference]: With dead ends: 14256 [2019-10-13 19:51:11,793 INFO L226 Difference]: Without dead ends: 7894 [2019-10-13 19:51:11,809 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:11,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7894 states. [2019-10-13 19:51:12,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7894 to 6185. [2019-10-13 19:51:12,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6185 states. [2019-10-13 19:51:12,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6185 states to 6185 states and 8189 transitions. [2019-10-13 19:51:12,136 INFO L78 Accepts]: Start accepts. Automaton has 6185 states and 8189 transitions. Word has length 303 [2019-10-13 19:51:12,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:12,136 INFO L462 AbstractCegarLoop]: Abstraction has 6185 states and 8189 transitions. [2019-10-13 19:51:12,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:51:12,136 INFO L276 IsEmpty]: Start isEmpty. Operand 6185 states and 8189 transitions. [2019-10-13 19:51:12,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-10-13 19:51:12,151 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:12,151 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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-13 19:51:12,355 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:12,356 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:12,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:12,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1588759982, now seen corresponding path program 1 times [2019-10-13 19:51:12,356 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:12,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545631860] [2019-10-13 19:51:12,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:12,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:12,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:12,443 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2019-10-13 19:51:12,444 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545631860] [2019-10-13 19:51:12,444 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:12,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:12,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17649043] [2019-10-13 19:51:12,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:12,445 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:12,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:12,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:12,445 INFO L87 Difference]: Start difference. First operand 6185 states and 8189 transitions. Second operand 3 states. [2019-10-13 19:51:12,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:12,853 INFO L93 Difference]: Finished difference Result 12737 states and 16878 transitions. [2019-10-13 19:51:12,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:12,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-10-13 19:51:12,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:12,867 INFO L225 Difference]: With dead ends: 12737 [2019-10-13 19:51:12,867 INFO L226 Difference]: Without dead ends: 6375 [2019-10-13 19:51:12,879 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-13 19:51:12,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6375 states. [2019-10-13 19:51:13,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6375 to 6365. [2019-10-13 19:51:13,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6365 states. [2019-10-13 19:51:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6365 states to 6365 states and 8363 transitions. [2019-10-13 19:51:13,194 INFO L78 Accepts]: Start accepts. Automaton has 6365 states and 8363 transitions. Word has length 312 [2019-10-13 19:51:13,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:13,194 INFO L462 AbstractCegarLoop]: Abstraction has 6365 states and 8363 transitions. [2019-10-13 19:51:13,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:13,194 INFO L276 IsEmpty]: Start isEmpty. Operand 6365 states and 8363 transitions. [2019-10-13 19:51:13,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-10-13 19:51:13,207 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:13,208 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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-13 19:51:13,208 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:13,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:13,208 INFO L82 PathProgramCache]: Analyzing trace with hash -630627056, now seen corresponding path program 1 times [2019-10-13 19:51:13,209 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:13,209 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476870760] [2019-10-13 19:51:13,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:13,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:13,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:13,324 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 691 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-10-13 19:51:13,324 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476870760] [2019-10-13 19:51:13,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984040578] [2019-10-13 19:51:13,325 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-13 19:51:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:13,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:13,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:13,522 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 691 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-10-13 19:51:13,522 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:51:13,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-13 19:51:13,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482453486] [2019-10-13 19:51:13,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:51:13,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:13,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:51:13,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:51:13,524 INFO L87 Difference]: Start difference. First operand 6365 states and 8363 transitions. Second operand 4 states. [2019-10-13 19:51:14,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:14,123 INFO L93 Difference]: Finished difference Result 13086 states and 17000 transitions. [2019-10-13 19:51:14,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:14,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-10-13 19:51:14,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:14,136 INFO L225 Difference]: With dead ends: 13086 [2019-10-13 19:51:14,137 INFO L226 Difference]: Without dead ends: 6760 [2019-10-13 19:51:14,145 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:14,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6760 states. [2019-10-13 19:51:14,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6760 to 4064. [2019-10-13 19:51:14,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4064 states. [2019-10-13 19:51:14,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4064 states to 4064 states and 5188 transitions. [2019-10-13 19:51:14,367 INFO L78 Accepts]: Start accepts. Automaton has 4064 states and 5188 transitions. Word has length 324 [2019-10-13 19:51:14,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:14,367 INFO L462 AbstractCegarLoop]: Abstraction has 4064 states and 5188 transitions. [2019-10-13 19:51:14,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:51:14,367 INFO L276 IsEmpty]: Start isEmpty. Operand 4064 states and 5188 transitions. [2019-10-13 19:51:14,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-10-13 19:51:14,381 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:14,381 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1] [2019-10-13 19:51:14,586 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:14,587 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:14,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:14,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1793866143, now seen corresponding path program 1 times [2019-10-13 19:51:14,587 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:14,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738901508] [2019-10-13 19:51:14,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:14,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:14,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:14,682 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-10-13 19:51:14,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738901508] [2019-10-13 19:51:14,682 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:14,682 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:14,683 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69266478] [2019-10-13 19:51:14,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:14,684 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:14,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:14,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:14,685 INFO L87 Difference]: Start difference. First operand 4064 states and 5188 transitions. Second operand 3 states. [2019-10-13 19:51:15,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:15,031 INFO L93 Difference]: Finished difference Result 8219 states and 10471 transitions. [2019-10-13 19:51:15,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:15,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-10-13 19:51:15,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:15,044 INFO L225 Difference]: With dead ends: 8219 [2019-10-13 19:51:15,044 INFO L226 Difference]: Without dead ends: 4194 [2019-10-13 19:51:15,053 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-13 19:51:15,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4194 states. [2019-10-13 19:51:15,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4194 to 4064. [2019-10-13 19:51:15,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4064 states. [2019-10-13 19:51:15,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4064 states to 4064 states and 5110 transitions. [2019-10-13 19:51:15,253 INFO L78 Accepts]: Start accepts. Automaton has 4064 states and 5110 transitions. Word has length 327 [2019-10-13 19:51:15,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:15,254 INFO L462 AbstractCegarLoop]: Abstraction has 4064 states and 5110 transitions. [2019-10-13 19:51:15,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:15,254 INFO L276 IsEmpty]: Start isEmpty. Operand 4064 states and 5110 transitions. [2019-10-13 19:51:15,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-10-13 19:51:15,262 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:15,262 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:15,263 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:15,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:15,263 INFO L82 PathProgramCache]: Analyzing trace with hash 141772578, now seen corresponding path program 1 times [2019-10-13 19:51:15,263 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:15,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421606133] [2019-10-13 19:51:15,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:15,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:15,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:15,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:15,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1358 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-10-13 19:51:15,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421606133] [2019-10-13 19:51:15,417 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:15,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:15,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836453386] [2019-10-13 19:51:15,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:15,419 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:15,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:15,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:15,419 INFO L87 Difference]: Start difference. First operand 4064 states and 5110 transitions. Second operand 3 states. [2019-10-13 19:51:15,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:15,778 INFO L93 Difference]: Finished difference Result 7140 states and 9037 transitions. [2019-10-13 19:51:15,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:15,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 370 [2019-10-13 19:51:15,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:15,787 INFO L225 Difference]: With dead ends: 7140 [2019-10-13 19:51:15,787 INFO L226 Difference]: Without dead ends: 4120 [2019-10-13 19:51:15,798 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-13 19:51:15,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4120 states. [2019-10-13 19:51:15,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4120 to 4064. [2019-10-13 19:51:15,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4064 states. [2019-10-13 19:51:15,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4064 states to 4064 states and 5104 transitions. [2019-10-13 19:51:15,984 INFO L78 Accepts]: Start accepts. Automaton has 4064 states and 5104 transitions. Word has length 370 [2019-10-13 19:51:15,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:15,984 INFO L462 AbstractCegarLoop]: Abstraction has 4064 states and 5104 transitions. [2019-10-13 19:51:15,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:15,984 INFO L276 IsEmpty]: Start isEmpty. Operand 4064 states and 5104 transitions. [2019-10-13 19:51:15,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-10-13 19:51:15,994 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:15,994 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:15,995 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:15,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:15,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1004200358, now seen corresponding path program 1 times [2019-10-13 19:51:15,996 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:15,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50157448] [2019-10-13 19:51:15,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:15,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:15,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:16,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 868 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-10-13 19:51:16,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50157448] [2019-10-13 19:51:16,157 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:16,158 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:16,158 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864203883] [2019-10-13 19:51:16,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:16,159 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:16,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:16,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:16,160 INFO L87 Difference]: Start difference. First operand 4064 states and 5104 transitions. Second operand 3 states. [2019-10-13 19:51:16,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:16,453 INFO L93 Difference]: Finished difference Result 7559 states and 9508 transitions. [2019-10-13 19:51:16,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:16,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2019-10-13 19:51:16,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:16,464 INFO L225 Difference]: With dead ends: 7559 [2019-10-13 19:51:16,464 INFO L226 Difference]: Without dead ends: 3413 [2019-10-13 19:51:16,470 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-13 19:51:16,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3413 states. [2019-10-13 19:51:16,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3413 to 3324. [2019-10-13 19:51:16,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3324 states. [2019-10-13 19:51:16,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3324 states to 3324 states and 4153 transitions. [2019-10-13 19:51:16,695 INFO L78 Accepts]: Start accepts. Automaton has 3324 states and 4153 transitions. Word has length 393 [2019-10-13 19:51:16,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:16,696 INFO L462 AbstractCegarLoop]: Abstraction has 3324 states and 4153 transitions. [2019-10-13 19:51:16,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:16,696 INFO L276 IsEmpty]: Start isEmpty. Operand 3324 states and 4153 transitions. [2019-10-13 19:51:16,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-10-13 19:51:16,703 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:16,703 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 7, 7, 7, 7, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1] [2019-10-13 19:51:16,704 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:16,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:16,704 INFO L82 PathProgramCache]: Analyzing trace with hash 404718799, now seen corresponding path program 1 times [2019-10-13 19:51:16,704 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:16,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433328229] [2019-10-13 19:51:16,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:16,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:16,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:16,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 863 proven. 0 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-10-13 19:51:16,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433328229] [2019-10-13 19:51:16,837 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:16,837 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:16,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707386741] [2019-10-13 19:51:16,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:16,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:16,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:16,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:16,841 INFO L87 Difference]: Start difference. First operand 3324 states and 4153 transitions. Second operand 3 states. [2019-10-13 19:51:17,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:17,078 INFO L93 Difference]: Finished difference Result 6266 states and 7844 transitions. [2019-10-13 19:51:17,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:17,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2019-10-13 19:51:17,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:17,085 INFO L225 Difference]: With dead ends: 6266 [2019-10-13 19:51:17,086 INFO L226 Difference]: Without dead ends: 3336 [2019-10-13 19:51:17,089 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-13 19:51:17,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3336 states. [2019-10-13 19:51:17,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3336 to 3324. [2019-10-13 19:51:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3324 states. [2019-10-13 19:51:17,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3324 states to 3324 states and 4147 transitions. [2019-10-13 19:51:17,255 INFO L78 Accepts]: Start accepts. Automaton has 3324 states and 4147 transitions. Word has length 393 [2019-10-13 19:51:17,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:17,255 INFO L462 AbstractCegarLoop]: Abstraction has 3324 states and 4147 transitions. [2019-10-13 19:51:17,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:17,256 INFO L276 IsEmpty]: Start isEmpty. Operand 3324 states and 4147 transitions. [2019-10-13 19:51:17,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2019-10-13 19:51:17,265 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:17,265 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, 8, 8, 8, 8, 6, 5, 5, 4, 4, 3, 3, 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-13 19:51:17,266 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:17,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:17,266 INFO L82 PathProgramCache]: Analyzing trace with hash -676110835, now seen corresponding path program 1 times [2019-10-13 19:51:17,266 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:17,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196962058] [2019-10-13 19:51:17,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:17,267 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:17,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:17,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 518 proven. 22 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-10-13 19:51:17,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196962058] [2019-10-13 19:51:17,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437184816] [2019-10-13 19:51:17,479 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-13 19:51:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:17,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:17,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:17,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 518 proven. 22 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-10-13 19:51:17,716 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:51:17,716 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-13 19:51:17,716 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327892949] [2019-10-13 19:51:17,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:51:17,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:17,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:51:17,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:51:17,718 INFO L87 Difference]: Start difference. First operand 3324 states and 4147 transitions. Second operand 4 states. [2019-10-13 19:51:17,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:17,979 INFO L93 Difference]: Finished difference Result 5419 states and 6812 transitions. [2019-10-13 19:51:17,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:51:17,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 427 [2019-10-13 19:51:17,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:17,983 INFO L225 Difference]: With dead ends: 5419 [2019-10-13 19:51:17,983 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 19:51:17,989 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:17,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 19:51:17,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 19:51:17,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 19:51:17,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 19:51:17,990 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 427 [2019-10-13 19:51:17,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:17,990 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 19:51:17,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:51:17,991 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 19:51:17,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 19:51:18,195 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:18,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 19:51:18,365 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 158 [2019-10-13 19:51:18,499 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 158 [2019-10-13 19:51:18,650 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 156