/usr/bin/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_3.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:22:54,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:22:54,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:22:54,148 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:22:54,148 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:22:54,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:22:54,150 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:22:54,152 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:22:54,155 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:22:54,156 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:22:54,161 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:22:54,162 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:22:54,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:22:54,163 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:22:54,164 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:22:54,166 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:22:54,168 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:22:54,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:22:54,174 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:22:54,177 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:22:54,178 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:22:54,183 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:22:54,186 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:22:54,187 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:22:54,189 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:22:54,189 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:22:54,192 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:22:54,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:22:54,193 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:22:54,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:22:54,195 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:22:54,197 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:22:54,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:22:54,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:22:54,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:22:54,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:22:54,202 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:22:54,202 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:22:54,202 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:22:54,205 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:22:54,207 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:22:54,208 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-11-06 22:22:54,222 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:22:54,222 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:22:54,224 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:22:54,224 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:22:54,224 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:22:54,225 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:22:54,225 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:22:54,225 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:22:54,225 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:22:54,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:22:54,226 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:22:54,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:22:54,226 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:22:54,226 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:22:54,227 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:22:54,227 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:22:54,227 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:22:54,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:22:54,228 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:22:54,228 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:22:54,228 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:22:54,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:22:54,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:22:54,229 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:22:54,229 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:22:54,229 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:22:54,229 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:22:54,230 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:22:54,230 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 22:22:54,543 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:22:54,565 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:22:54,569 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:22:54,570 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:22:54,570 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:22:54,571 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_3.cil.c [2019-11-06 22:22:54,630 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e674703d1/b0fa827ca1c245f6bb3f96198a5549c0/FLAG38b10ea54 [2019-11-06 22:22:55,143 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:22:55,144 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_3.cil.c [2019-11-06 22:22:55,168 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e674703d1/b0fa827ca1c245f6bb3f96198a5549c0/FLAG38b10ea54 [2019-11-06 22:22:55,503 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e674703d1/b0fa827ca1c245f6bb3f96198a5549c0 [2019-11-06 22:22:55,514 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:22:55,516 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:22:55,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:22:55,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:22:55,521 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:22:55,522 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:22:55" (1/1) ... [2019-11-06 22:22:55,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13d202f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:55, skipping insertion in model container [2019-11-06 22:22:55,526 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:22:55" (1/1) ... [2019-11-06 22:22:55,534 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:22:55,598 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:22:55,874 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:22:55,879 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:22:56,062 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:22:56,079 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:22:56,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:56 WrapperNode [2019-11-06 22:22:56,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:22:56,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:22:56,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:22:56,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:22:56,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:56" (1/1) ... [2019-11-06 22:22:56,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:56" (1/1) ... [2019-11-06 22:22:56,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:56" (1/1) ... [2019-11-06 22:22:56,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:56" (1/1) ... [2019-11-06 22:22:56,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:56" (1/1) ... [2019-11-06 22:22:56,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:56" (1/1) ... [2019-11-06 22:22:56,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:56" (1/1) ... [2019-11-06 22:22:56,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:22:56,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:22:56,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:22:56,136 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:22:56,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:56" (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-11-06 22:22:56,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:22:56,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:22:56,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-11-06 22:22:56,193 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:22:56,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:22:56,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-06 22:22:56,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:22:56,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-06 22:22:56,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-06 22:22:56,194 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-11-06 22:22:56,194 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:22:56,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:22:56,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:22:56,413 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 22:22:57,024 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-06 22:22:57,025 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-06 22:22:57,029 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:22:57,029 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 22:22:57,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:22:57 BoogieIcfgContainer [2019-11-06 22:22:57,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:22:57,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:22:57,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:22:57,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:22:57,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:22:55" (1/3) ... [2019-11-06 22:22:57,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fff4362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:22:57, skipping insertion in model container [2019-11-06 22:22:57,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:56" (2/3) ... [2019-11-06 22:22:57,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fff4362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:22:57, skipping insertion in model container [2019-11-06 22:22:57,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:22:57" (3/3) ... [2019-11-06 22:22:57,040 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.cil.c [2019-11-06 22:22:57,051 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:22:57,058 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:22:57,070 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:22:57,098 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:22:57,099 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:22:57,099 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:22:57,099 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:22:57,099 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:22:57,100 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:22:57,100 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:22:57,100 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:22:57,122 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-11-06 22:22:57,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-06 22:22:57,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:57,132 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:57,134 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:57,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:57,140 INFO L82 PathProgramCache]: Analyzing trace with hash 882212075, now seen corresponding path program 1 times [2019-11-06 22:22:57,146 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:57,147 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560132111] [2019-11-06 22:22:57,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:57,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:57,492 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560132111] [2019-11-06 22:22:57,493 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:57,494 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:57,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210199997] [2019-11-06 22:22:57,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:57,501 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:57,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:57,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:57,520 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 5 states. [2019-11-06 22:22:58,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:58,027 INFO L93 Difference]: Finished difference Result 337 states and 574 transitions. [2019-11-06 22:22:58,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:58,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-11-06 22:22:58,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:58,054 INFO L225 Difference]: With dead ends: 337 [2019-11-06 22:22:58,055 INFO L226 Difference]: Without dead ends: 180 [2019-11-06 22:22:58,065 INFO L630 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-11-06 22:22:58,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-06 22:22:58,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2019-11-06 22:22:58,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-11-06 22:22:58,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 280 transitions. [2019-11-06 22:22:58,174 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 280 transitions. Word has length 49 [2019-11-06 22:22:58,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:58,174 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 280 transitions. [2019-11-06 22:22:58,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 280 transitions. [2019-11-06 22:22:58,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-06 22:22:58,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:58,182 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:58,182 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:58,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:58,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1571615886, now seen corresponding path program 1 times [2019-11-06 22:22:58,183 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:58,183 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370955485] [2019-11-06 22:22:58,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:58,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:58,318 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370955485] [2019-11-06 22:22:58,318 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:58,318 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:58,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125586557] [2019-11-06 22:22:58,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:58,321 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:58,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:58,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:58,322 INFO L87 Difference]: Start difference. First operand 175 states and 280 transitions. Second operand 5 states. [2019-11-06 22:22:58,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:58,610 INFO L93 Difference]: Finished difference Result 385 states and 629 transitions. [2019-11-06 22:22:58,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:58,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-06 22:22:58,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:58,616 INFO L225 Difference]: With dead ends: 385 [2019-11-06 22:22:58,616 INFO L226 Difference]: Without dead ends: 221 [2019-11-06 22:22:58,620 INFO L630 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-11-06 22:22:58,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-11-06 22:22:58,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2019-11-06 22:22:58,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-06 22:22:58,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 357 transitions. [2019-11-06 22:22:58,657 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 357 transitions. Word has length 50 [2019-11-06 22:22:58,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:58,657 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 357 transitions. [2019-11-06 22:22:58,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:58,658 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 357 transitions. [2019-11-06 22:22:58,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-06 22:22:58,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:58,667 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:58,670 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:58,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:58,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1796709690, now seen corresponding path program 1 times [2019-11-06 22:22:58,671 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:58,671 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004284419] [2019-11-06 22:22:58,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:58,813 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:58,814 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004284419] [2019-11-06 22:22:58,814 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:58,815 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:58,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865917047] [2019-11-06 22:22:58,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:58,816 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:58,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:58,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:58,816 INFO L87 Difference]: Start difference. First operand 216 states and 357 transitions. Second operand 5 states. [2019-11-06 22:22:59,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:59,063 INFO L93 Difference]: Finished difference Result 450 states and 755 transitions. [2019-11-06 22:22:59,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:59,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-11-06 22:22:59,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:59,068 INFO L225 Difference]: With dead ends: 450 [2019-11-06 22:22:59,068 INFO L226 Difference]: Without dead ends: 247 [2019-11-06 22:22:59,073 INFO L630 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-11-06 22:22:59,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-11-06 22:22:59,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-11-06 22:22:59,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-11-06 22:22:59,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 413 transitions. [2019-11-06 22:22:59,099 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 413 transitions. Word has length 77 [2019-11-06 22:22:59,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:59,100 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 413 transitions. [2019-11-06 22:22:59,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 413 transitions. [2019-11-06 22:22:59,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-06 22:22:59,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:59,108 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:59,108 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:59,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:59,109 INFO L82 PathProgramCache]: Analyzing trace with hash 903111100, now seen corresponding path program 1 times [2019-11-06 22:22:59,109 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:59,109 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964320723] [2019-11-06 22:22:59,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:59,213 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-06 22:22:59,214 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964320723] [2019-11-06 22:22:59,215 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:59,215 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:59,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592108761] [2019-11-06 22:22:59,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:59,217 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:59,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:59,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:59,218 INFO L87 Difference]: Start difference. First operand 247 states and 413 transitions. Second operand 5 states. [2019-11-06 22:22:59,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:59,418 INFO L93 Difference]: Finished difference Result 498 states and 837 transitions. [2019-11-06 22:22:59,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:59,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-11-06 22:22:59,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:59,420 INFO L225 Difference]: With dead ends: 498 [2019-11-06 22:22:59,421 INFO L226 Difference]: Without dead ends: 264 [2019-11-06 22:22:59,421 INFO L630 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-11-06 22:22:59,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-11-06 22:22:59,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-11-06 22:22:59,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-11-06 22:22:59,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 436 transitions. [2019-11-06 22:22:59,435 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 436 transitions. Word has length 89 [2019-11-06 22:22:59,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:59,436 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 436 transitions. [2019-11-06 22:22:59,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:59,436 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 436 transitions. [2019-11-06 22:22:59,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-06 22:22:59,438 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:59,438 INFO L410 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, 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] [2019-11-06 22:22:59,438 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:59,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:59,438 INFO L82 PathProgramCache]: Analyzing trace with hash -890466136, now seen corresponding path program 1 times [2019-11-06 22:22:59,439 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:59,439 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433354627] [2019-11-06 22:22:59,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:59,509 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:59,509 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433354627] [2019-11-06 22:22:59,509 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:59,510 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:22:59,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439926078] [2019-11-06 22:22:59,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:59,511 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:59,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:59,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:59,511 INFO L87 Difference]: Start difference. First operand 262 states and 436 transitions. Second operand 5 states. [2019-11-06 22:22:59,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:59,873 INFO L93 Difference]: Finished difference Result 557 states and 936 transitions. [2019-11-06 22:22:59,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:59,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-11-06 22:22:59,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:59,877 INFO L225 Difference]: With dead ends: 557 [2019-11-06 22:22:59,877 INFO L226 Difference]: Without dead ends: 308 [2019-11-06 22:22:59,878 INFO L630 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-11-06 22:22:59,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-11-06 22:22:59,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 304. [2019-11-06 22:22:59,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-11-06 22:22:59,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 510 transitions. [2019-11-06 22:22:59,898 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 510 transitions. Word has length 89 [2019-11-06 22:22:59,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:59,898 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 510 transitions. [2019-11-06 22:22:59,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:59,899 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 510 transitions. [2019-11-06 22:22:59,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-06 22:22:59,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:59,901 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:59,902 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:59,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:59,902 INFO L82 PathProgramCache]: Analyzing trace with hash -550567068, now seen corresponding path program 1 times [2019-11-06 22:22:59,902 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:59,903 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220289715] [2019-11-06 22:22:59,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:00,009 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-06 22:23:00,009 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220289715] [2019-11-06 22:23:00,009 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:00,010 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:00,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290547234] [2019-11-06 22:23:00,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:00,010 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:00,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:00,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:00,011 INFO L87 Difference]: Start difference. First operand 304 states and 510 transitions. Second operand 5 states. [2019-11-06 22:23:00,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:00,210 INFO L93 Difference]: Finished difference Result 597 states and 1005 transitions. [2019-11-06 22:23:00,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:00,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-11-06 22:23:00,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:00,214 INFO L225 Difference]: With dead ends: 597 [2019-11-06 22:23:00,214 INFO L226 Difference]: Without dead ends: 306 [2019-11-06 22:23:00,215 INFO L630 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-11-06 22:23:00,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-11-06 22:23:00,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-11-06 22:23:00,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-11-06 22:23:00,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 506 transitions. [2019-11-06 22:23:00,228 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 506 transitions. Word has length 90 [2019-11-06 22:23:00,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:00,229 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 506 transitions. [2019-11-06 22:23:00,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:00,229 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 506 transitions. [2019-11-06 22:23:00,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-06 22:23:00,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:00,231 INFO L410 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, 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] [2019-11-06 22:23:00,231 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:00,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:00,231 INFO L82 PathProgramCache]: Analyzing trace with hash -80048661, now seen corresponding path program 1 times [2019-11-06 22:23:00,232 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:00,232 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364711023] [2019-11-06 22:23:00,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:00,290 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:23:00,290 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364711023] [2019-11-06 22:23:00,290 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:00,291 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:00,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200685700] [2019-11-06 22:23:00,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:00,292 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:00,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:00,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:00,292 INFO L87 Difference]: Start difference. First operand 304 states and 506 transitions. Second operand 5 states. [2019-11-06 22:23:00,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:00,546 INFO L93 Difference]: Finished difference Result 599 states and 1000 transitions. [2019-11-06 22:23:00,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:00,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-11-06 22:23:00,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:00,549 INFO L225 Difference]: With dead ends: 599 [2019-11-06 22:23:00,549 INFO L226 Difference]: Without dead ends: 306 [2019-11-06 22:23:00,550 INFO L630 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-11-06 22:23:00,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-11-06 22:23:00,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 302. [2019-11-06 22:23:00,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-11-06 22:23:00,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 501 transitions. [2019-11-06 22:23:00,564 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 501 transitions. Word has length 90 [2019-11-06 22:23:00,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:00,564 INFO L462 AbstractCegarLoop]: Abstraction has 302 states and 501 transitions. [2019-11-06 22:23:00,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:00,565 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 501 transitions. [2019-11-06 22:23:00,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-06 22:23:00,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:00,566 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:00,567 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:00,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:00,567 INFO L82 PathProgramCache]: Analyzing trace with hash 597213445, now seen corresponding path program 1 times [2019-11-06 22:23:00,567 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:00,567 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132542185] [2019-11-06 22:23:00,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:00,661 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-06 22:23:00,662 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132542185] [2019-11-06 22:23:00,662 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:00,663 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:00,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192499953] [2019-11-06 22:23:00,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:00,664 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:00,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:00,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:00,664 INFO L87 Difference]: Start difference. First operand 302 states and 501 transitions. Second operand 5 states. [2019-11-06 22:23:00,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:00,851 INFO L93 Difference]: Finished difference Result 600 states and 997 transitions. [2019-11-06 22:23:00,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:00,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-11-06 22:23:00,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:00,853 INFO L225 Difference]: With dead ends: 600 [2019-11-06 22:23:00,853 INFO L226 Difference]: Without dead ends: 311 [2019-11-06 22:23:00,855 INFO L630 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-11-06 22:23:00,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-11-06 22:23:00,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2019-11-06 22:23:00,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-11-06 22:23:00,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 507 transitions. [2019-11-06 22:23:00,870 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 507 transitions. Word has length 102 [2019-11-06 22:23:00,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:00,871 INFO L462 AbstractCegarLoop]: Abstraction has 311 states and 507 transitions. [2019-11-06 22:23:00,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:00,871 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 507 transitions. [2019-11-06 22:23:00,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-06 22:23:00,873 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:00,873 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:00,873 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:00,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:00,874 INFO L82 PathProgramCache]: Analyzing trace with hash 301165919, now seen corresponding path program 1 times [2019-11-06 22:23:00,874 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:00,874 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775657114] [2019-11-06 22:23:00,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:00,944 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-06 22:23:00,944 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775657114] [2019-11-06 22:23:00,945 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:00,946 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:00,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120724410] [2019-11-06 22:23:00,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:00,947 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:00,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:00,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:00,947 INFO L87 Difference]: Start difference. First operand 311 states and 507 transitions. Second operand 5 states. [2019-11-06 22:23:01,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:01,153 INFO L93 Difference]: Finished difference Result 640 states and 1050 transitions. [2019-11-06 22:23:01,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:01,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-11-06 22:23:01,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:01,156 INFO L225 Difference]: With dead ends: 640 [2019-11-06 22:23:01,157 INFO L226 Difference]: Without dead ends: 342 [2019-11-06 22:23:01,158 INFO L630 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-11-06 22:23:01,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-11-06 22:23:01,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-11-06 22:23:01,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-11-06 22:23:01,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 554 transitions. [2019-11-06 22:23:01,175 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 554 transitions. Word has length 103 [2019-11-06 22:23:01,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:01,177 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 554 transitions. [2019-11-06 22:23:01,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:01,177 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 554 transitions. [2019-11-06 22:23:01,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-06 22:23:01,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:01,179 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:01,179 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:01,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:01,180 INFO L82 PathProgramCache]: Analyzing trace with hash -283935385, now seen corresponding path program 1 times [2019-11-06 22:23:01,180 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:01,180 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513252508] [2019-11-06 22:23:01,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:01,267 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-06 22:23:01,268 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513252508] [2019-11-06 22:23:01,270 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:01,271 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:01,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333634459] [2019-11-06 22:23:01,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:01,275 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:01,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:01,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:01,275 INFO L87 Difference]: Start difference. First operand 340 states and 554 transitions. Second operand 5 states. [2019-11-06 22:23:01,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:01,510 INFO L93 Difference]: Finished difference Result 669 states and 1093 transitions. [2019-11-06 22:23:01,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:01,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-11-06 22:23:01,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:01,515 INFO L225 Difference]: With dead ends: 669 [2019-11-06 22:23:01,515 INFO L226 Difference]: Without dead ends: 342 [2019-11-06 22:23:01,516 INFO L630 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-11-06 22:23:01,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-11-06 22:23:01,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-11-06 22:23:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-11-06 22:23:01,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 550 transitions. [2019-11-06 22:23:01,532 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 550 transitions. Word has length 104 [2019-11-06 22:23:01,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:01,532 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 550 transitions. [2019-11-06 22:23:01,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:01,532 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 550 transitions. [2019-11-06 22:23:01,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-06 22:23:01,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:01,534 INFO L410 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] [2019-11-06 22:23:01,535 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:01,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:01,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1626624529, now seen corresponding path program 1 times [2019-11-06 22:23:01,535 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:01,535 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631859641] [2019-11-06 22:23:01,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:01,602 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-06 22:23:01,603 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631859641] [2019-11-06 22:23:01,603 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:01,603 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:01,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497452035] [2019-11-06 22:23:01,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:01,604 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:01,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:01,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:01,605 INFO L87 Difference]: Start difference. First operand 340 states and 550 transitions. Second operand 5 states. [2019-11-06 22:23:01,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:01,824 INFO L93 Difference]: Finished difference Result 702 states and 1143 transitions. [2019-11-06 22:23:01,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:01,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-11-06 22:23:01,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:01,827 INFO L225 Difference]: With dead ends: 702 [2019-11-06 22:23:01,827 INFO L226 Difference]: Without dead ends: 375 [2019-11-06 22:23:01,828 INFO L630 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-11-06 22:23:01,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-11-06 22:23:01,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-11-06 22:23:01,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-11-06 22:23:01,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 592 transitions. [2019-11-06 22:23:01,849 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 592 transitions. Word has length 105 [2019-11-06 22:23:01,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:01,850 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 592 transitions. [2019-11-06 22:23:01,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:01,850 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 592 transitions. [2019-11-06 22:23:01,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-06 22:23:01,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:01,853 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:01,853 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:01,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:01,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1291287383, now seen corresponding path program 1 times [2019-11-06 22:23:01,854 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:01,854 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819170032] [2019-11-06 22:23:01,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:01,922 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-06 22:23:01,922 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819170032] [2019-11-06 22:23:01,922 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:01,923 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:01,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242409654] [2019-11-06 22:23:01,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:01,923 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:01,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:01,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:01,924 INFO L87 Difference]: Start difference. First operand 367 states and 592 transitions. Second operand 5 states. [2019-11-06 22:23:02,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:02,159 INFO L93 Difference]: Finished difference Result 729 states and 1180 transitions. [2019-11-06 22:23:02,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:02,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-11-06 22:23:02,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:02,163 INFO L225 Difference]: With dead ends: 729 [2019-11-06 22:23:02,163 INFO L226 Difference]: Without dead ends: 375 [2019-11-06 22:23:02,164 INFO L630 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-11-06 22:23:02,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-11-06 22:23:02,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-11-06 22:23:02,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-11-06 22:23:02,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 587 transitions. [2019-11-06 22:23:02,179 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 587 transitions. Word has length 106 [2019-11-06 22:23:02,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:02,179 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 587 transitions. [2019-11-06 22:23:02,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:02,179 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 587 transitions. [2019-11-06 22:23:02,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-06 22:23:02,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:02,181 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-06 22:23:02,181 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:02,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:02,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1329985514, now seen corresponding path program 1 times [2019-11-06 22:23:02,182 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:02,182 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896707427] [2019-11-06 22:23:02,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:02,231 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-06 22:23:02,231 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896707427] [2019-11-06 22:23:02,231 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:02,231 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:02,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723744938] [2019-11-06 22:23:02,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:02,233 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:02,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:02,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:02,233 INFO L87 Difference]: Start difference. First operand 367 states and 587 transitions. Second operand 5 states. [2019-11-06 22:23:02,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:02,422 INFO L93 Difference]: Finished difference Result 746 states and 1198 transitions. [2019-11-06 22:23:02,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:02,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-11-06 22:23:02,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:02,424 INFO L225 Difference]: With dead ends: 746 [2019-11-06 22:23:02,424 INFO L226 Difference]: Without dead ends: 392 [2019-11-06 22:23:02,426 INFO L630 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-11-06 22:23:02,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-11-06 22:23:02,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2019-11-06 22:23:02,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-11-06 22:23:02,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 616 transitions. [2019-11-06 22:23:02,443 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 616 transitions. Word has length 110 [2019-11-06 22:23:02,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:02,444 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 616 transitions. [2019-11-06 22:23:02,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:02,444 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 616 transitions. [2019-11-06 22:23:02,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-06 22:23:02,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:02,446 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-06 22:23:02,446 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:02,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:02,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1711185522, now seen corresponding path program 1 times [2019-11-06 22:23:02,446 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:02,447 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292188909] [2019-11-06 22:23:02,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:02,502 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-06 22:23:02,503 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292188909] [2019-11-06 22:23:02,503 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:02,503 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:02,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396761939] [2019-11-06 22:23:02,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:02,504 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:02,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:02,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:02,504 INFO L87 Difference]: Start difference. First operand 388 states and 616 transitions. Second operand 5 states. [2019-11-06 22:23:02,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:02,691 INFO L93 Difference]: Finished difference Result 767 states and 1221 transitions. [2019-11-06 22:23:02,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:02,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-11-06 22:23:02,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:02,694 INFO L225 Difference]: With dead ends: 767 [2019-11-06 22:23:02,694 INFO L226 Difference]: Without dead ends: 392 [2019-11-06 22:23:02,696 INFO L630 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-11-06 22:23:02,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-11-06 22:23:02,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2019-11-06 22:23:02,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-11-06 22:23:02,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 610 transitions. [2019-11-06 22:23:02,712 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 610 transitions. Word has length 111 [2019-11-06 22:23:02,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:02,712 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 610 transitions. [2019-11-06 22:23:02,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:02,712 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 610 transitions. [2019-11-06 22:23:02,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-06 22:23:02,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:02,715 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-11-06 22:23:02,715 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:02,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:02,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1344904457, now seen corresponding path program 1 times [2019-11-06 22:23:02,716 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:02,716 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948430268] [2019-11-06 22:23:02,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:02,787 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-06 22:23:02,787 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948430268] [2019-11-06 22:23:02,787 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:02,787 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:23:02,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970923827] [2019-11-06 22:23:02,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:23:02,788 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:02,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:23:02,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:23:02,789 INFO L87 Difference]: Start difference. First operand 388 states and 610 transitions. Second operand 3 states. [2019-11-06 22:23:02,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:02,854 INFO L93 Difference]: Finished difference Result 763 states and 1203 transitions. [2019-11-06 22:23:02,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:23:02,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-11-06 22:23:02,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:02,859 INFO L225 Difference]: With dead ends: 763 [2019-11-06 22:23:02,859 INFO L226 Difference]: Without dead ends: 761 [2019-11-06 22:23:02,861 INFO L630 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-11-06 22:23:02,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-11-06 22:23:02,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2019-11-06 22:23:02,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-11-06 22:23:02,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1201 transitions. [2019-11-06 22:23:02,891 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1201 transitions. Word has length 126 [2019-11-06 22:23:02,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:02,892 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 1201 transitions. [2019-11-06 22:23:02,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:23:02,892 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1201 transitions. [2019-11-06 22:23:02,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-06 22:23:02,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:02,895 INFO L410 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, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:02,895 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:02,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:02,896 INFO L82 PathProgramCache]: Analyzing trace with hash -773137702, now seen corresponding path program 1 times [2019-11-06 22:23:02,896 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:02,896 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158062395] [2019-11-06 22:23:02,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:02,967 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-06 22:23:02,972 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158062395] [2019-11-06 22:23:02,974 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:02,974 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:02,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745192732] [2019-11-06 22:23:02,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:02,975 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:02,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:02,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:02,976 INFO L87 Difference]: Start difference. First operand 761 states and 1201 transitions. Second operand 5 states. [2019-11-06 22:23:03,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:03,215 INFO L93 Difference]: Finished difference Result 1593 states and 2521 transitions. [2019-11-06 22:23:03,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:03,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2019-11-06 22:23:03,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:03,220 INFO L225 Difference]: With dead ends: 1593 [2019-11-06 22:23:03,220 INFO L226 Difference]: Without dead ends: 845 [2019-11-06 22:23:03,222 INFO L630 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-11-06 22:23:03,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2019-11-06 22:23:03,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 837. [2019-11-06 22:23:03,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-11-06 22:23:03,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1319 transitions. [2019-11-06 22:23:03,254 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1319 transitions. Word has length 127 [2019-11-06 22:23:03,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:03,255 INFO L462 AbstractCegarLoop]: Abstraction has 837 states and 1319 transitions. [2019-11-06 22:23:03,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:03,255 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1319 transitions. [2019-11-06 22:23:03,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-06 22:23:03,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:03,258 INFO L410 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, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:03,258 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:03,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:03,258 INFO L82 PathProgramCache]: Analyzing trace with hash -260517251, now seen corresponding path program 1 times [2019-11-06 22:23:03,259 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:03,259 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060700299] [2019-11-06 22:23:03,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:03,323 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-06 22:23:03,324 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060700299] [2019-11-06 22:23:03,324 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:03,324 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:03,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158033490] [2019-11-06 22:23:03,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:03,325 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:03,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:03,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:03,325 INFO L87 Difference]: Start difference. First operand 837 states and 1319 transitions. Second operand 5 states. [2019-11-06 22:23:03,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:03,573 INFO L93 Difference]: Finished difference Result 1669 states and 2633 transitions. [2019-11-06 22:23:03,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:03,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2019-11-06 22:23:03,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:03,605 INFO L225 Difference]: With dead ends: 1669 [2019-11-06 22:23:03,605 INFO L226 Difference]: Without dead ends: 841 [2019-11-06 22:23:03,607 INFO L630 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-11-06 22:23:03,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2019-11-06 22:23:03,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 833. [2019-11-06 22:23:03,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-11-06 22:23:03,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1307 transitions. [2019-11-06 22:23:03,640 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1307 transitions. Word has length 128 [2019-11-06 22:23:03,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:03,641 INFO L462 AbstractCegarLoop]: Abstraction has 833 states and 1307 transitions. [2019-11-06 22:23:03,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:03,641 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1307 transitions. [2019-11-06 22:23:03,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-06 22:23:03,644 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:03,644 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-06 22:23:03,645 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:03,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:03,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1086305590, now seen corresponding path program 1 times [2019-11-06 22:23:03,646 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:03,646 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267494016] [2019-11-06 22:23:03,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:03,718 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-06 22:23:03,718 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267494016] [2019-11-06 22:23:03,718 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:03,718 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:03,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621103208] [2019-11-06 22:23:03,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:03,719 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:03,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:03,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:03,720 INFO L87 Difference]: Start difference. First operand 833 states and 1307 transitions. Second operand 5 states. [2019-11-06 22:23:03,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:03,965 INFO L93 Difference]: Finished difference Result 1729 states and 2717 transitions. [2019-11-06 22:23:03,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:03,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2019-11-06 22:23:03,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:03,970 INFO L225 Difference]: With dead ends: 1729 [2019-11-06 22:23:03,970 INFO L226 Difference]: Without dead ends: 909 [2019-11-06 22:23:03,972 INFO L630 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-11-06 22:23:03,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-11-06 22:23:04,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 905. [2019-11-06 22:23:04,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-11-06 22:23:04,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1415 transitions. [2019-11-06 22:23:04,010 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1415 transitions. Word has length 160 [2019-11-06 22:23:04,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:04,010 INFO L462 AbstractCegarLoop]: Abstraction has 905 states and 1415 transitions. [2019-11-06 22:23:04,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:04,010 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1415 transitions. [2019-11-06 22:23:04,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-06 22:23:04,014 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:04,014 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-06 22:23:04,014 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:04,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:04,015 INFO L82 PathProgramCache]: Analyzing trace with hash -643380505, now seen corresponding path program 1 times [2019-11-06 22:23:04,015 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:04,015 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815442648] [2019-11-06 22:23:04,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:04,091 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-06 22:23:04,092 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815442648] [2019-11-06 22:23:04,092 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:04,092 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:04,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652491168] [2019-11-06 22:23:04,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:04,094 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:04,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:04,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:04,094 INFO L87 Difference]: Start difference. First operand 905 states and 1415 transitions. Second operand 5 states. [2019-11-06 22:23:04,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:04,451 INFO L93 Difference]: Finished difference Result 1801 states and 2817 transitions. [2019-11-06 22:23:04,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:04,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-11-06 22:23:04,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:04,458 INFO L225 Difference]: With dead ends: 1801 [2019-11-06 22:23:04,459 INFO L226 Difference]: Without dead ends: 905 [2019-11-06 22:23:04,462 INFO L630 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-11-06 22:23:04,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2019-11-06 22:23:04,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 901. [2019-11-06 22:23:04,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-11-06 22:23:04,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1401 transitions. [2019-11-06 22:23:04,538 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1401 transitions. Word has length 161 [2019-11-06 22:23:04,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:04,538 INFO L462 AbstractCegarLoop]: Abstraction has 901 states and 1401 transitions. [2019-11-06 22:23:04,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:04,538 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1401 transitions. [2019-11-06 22:23:04,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-06 22:23:04,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:04,542 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-06 22:23:04,543 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:04,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:04,543 INFO L82 PathProgramCache]: Analyzing trace with hash -306607681, now seen corresponding path program 1 times [2019-11-06 22:23:04,543 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:04,543 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218685220] [2019-11-06 22:23:04,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:04,657 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-11-06 22:23:04,657 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218685220] [2019-11-06 22:23:04,658 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:04,658 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:04,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025380986] [2019-11-06 22:23:04,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:04,660 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:04,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:04,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:04,660 INFO L87 Difference]: Start difference. First operand 901 states and 1401 transitions. Second operand 5 states. [2019-11-06 22:23:04,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:04,989 INFO L93 Difference]: Finished difference Result 1861 states and 2897 transitions. [2019-11-06 22:23:04,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:04,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2019-11-06 22:23:04,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:04,997 INFO L225 Difference]: With dead ends: 1861 [2019-11-06 22:23:04,997 INFO L226 Difference]: Without dead ends: 973 [2019-11-06 22:23:05,000 INFO L630 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-11-06 22:23:05,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-11-06 22:23:05,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 969. [2019-11-06 22:23:05,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2019-11-06 22:23:05,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1499 transitions. [2019-11-06 22:23:05,063 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1499 transitions. Word has length 191 [2019-11-06 22:23:05,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:05,064 INFO L462 AbstractCegarLoop]: Abstraction has 969 states and 1499 transitions. [2019-11-06 22:23:05,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:05,064 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1499 transitions. [2019-11-06 22:23:05,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-06 22:23:05,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:05,071 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-11-06 22:23:05,071 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:05,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:05,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1259797154, now seen corresponding path program 1 times [2019-11-06 22:23:05,072 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:05,072 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740923217] [2019-11-06 22:23:05,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:05,185 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-11-06 22:23:05,185 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740923217] [2019-11-06 22:23:05,185 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:05,186 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:05,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528218118] [2019-11-06 22:23:05,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:05,187 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:05,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:05,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:05,188 INFO L87 Difference]: Start difference. First operand 969 states and 1499 transitions. Second operand 5 states. [2019-11-06 22:23:05,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:05,514 INFO L93 Difference]: Finished difference Result 1929 states and 2985 transitions. [2019-11-06 22:23:05,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:05,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 192 [2019-11-06 22:23:05,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:05,520 INFO L225 Difference]: With dead ends: 1929 [2019-11-06 22:23:05,520 INFO L226 Difference]: Without dead ends: 969 [2019-11-06 22:23:05,522 INFO L630 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-11-06 22:23:05,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2019-11-06 22:23:05,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 965. [2019-11-06 22:23:05,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-11-06 22:23:05,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1483 transitions. [2019-11-06 22:23:05,562 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1483 transitions. Word has length 192 [2019-11-06 22:23:05,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:05,562 INFO L462 AbstractCegarLoop]: Abstraction has 965 states and 1483 transitions. [2019-11-06 22:23:05,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:05,563 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1483 transitions. [2019-11-06 22:23:05,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-06 22:23:05,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:05,567 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1] [2019-11-06 22:23:05,567 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:05,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:05,567 INFO L82 PathProgramCache]: Analyzing trace with hash 637510067, now seen corresponding path program 1 times [2019-11-06 22:23:05,568 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:05,568 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842546250] [2019-11-06 22:23:05,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:05,640 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-11-06 22:23:05,641 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842546250] [2019-11-06 22:23:05,641 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:05,641 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:05,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55701346] [2019-11-06 22:23:05,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:05,642 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:05,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:05,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:05,643 INFO L87 Difference]: Start difference. First operand 965 states and 1483 transitions. Second operand 5 states. [2019-11-06 22:23:05,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:05,895 INFO L93 Difference]: Finished difference Result 1993 states and 3073 transitions. [2019-11-06 22:23:05,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:05,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 209 [2019-11-06 22:23:05,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:05,902 INFO L225 Difference]: With dead ends: 1993 [2019-11-06 22:23:05,903 INFO L226 Difference]: Without dead ends: 1041 [2019-11-06 22:23:05,907 INFO L630 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-11-06 22:23:05,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-11-06 22:23:05,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1015. [2019-11-06 22:23:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-11-06 22:23:05,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1547 transitions. [2019-11-06 22:23:05,962 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1547 transitions. Word has length 209 [2019-11-06 22:23:05,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:05,962 INFO L462 AbstractCegarLoop]: Abstraction has 1015 states and 1547 transitions. [2019-11-06 22:23:05,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:05,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1547 transitions. [2019-11-06 22:23:05,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-06 22:23:05,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:05,970 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1] [2019-11-06 22:23:05,970 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:05,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:05,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1262219653, now seen corresponding path program 1 times [2019-11-06 22:23:05,971 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:05,971 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976499595] [2019-11-06 22:23:05,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:06,080 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-11-06 22:23:06,080 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976499595] [2019-11-06 22:23:06,081 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:06,081 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:06,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562354589] [2019-11-06 22:23:06,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:06,084 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:06,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:06,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:06,085 INFO L87 Difference]: Start difference. First operand 1015 states and 1547 transitions. Second operand 5 states. [2019-11-06 22:23:06,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:06,342 INFO L93 Difference]: Finished difference Result 2043 states and 3119 transitions. [2019-11-06 22:23:06,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:06,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-11-06 22:23:06,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:06,347 INFO L225 Difference]: With dead ends: 2043 [2019-11-06 22:23:06,348 INFO L226 Difference]: Without dead ends: 1041 [2019-11-06 22:23:06,350 INFO L630 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-11-06 22:23:06,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-11-06 22:23:06,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1015. [2019-11-06 22:23:06,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-11-06 22:23:06,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1529 transitions. [2019-11-06 22:23:06,394 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1529 transitions. Word has length 210 [2019-11-06 22:23:06,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:06,394 INFO L462 AbstractCegarLoop]: Abstraction has 1015 states and 1529 transitions. [2019-11-06 22:23:06,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:06,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1529 transitions. [2019-11-06 22:23:06,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-11-06 22:23:06,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:06,399 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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] [2019-11-06 22:23:06,399 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:06,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:06,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1315202570, now seen corresponding path program 1 times [2019-11-06 22:23:06,400 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:06,400 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136936321] [2019-11-06 22:23:06,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:06,482 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-11-06 22:23:06,483 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136936321] [2019-11-06 22:23:06,483 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:06,483 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:06,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160822377] [2019-11-06 22:23:06,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:06,484 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:06,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:06,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:06,484 INFO L87 Difference]: Start difference. First operand 1015 states and 1529 transitions. Second operand 5 states. [2019-11-06 22:23:06,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:06,748 INFO L93 Difference]: Finished difference Result 2025 states and 3051 transitions. [2019-11-06 22:23:06,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:06,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 222 [2019-11-06 22:23:06,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:06,756 INFO L225 Difference]: With dead ends: 2025 [2019-11-06 22:23:06,756 INFO L226 Difference]: Without dead ends: 1023 [2019-11-06 22:23:06,761 INFO L630 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-11-06 22:23:06,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-11-06 22:23:06,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1015. [2019-11-06 22:23:06,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-11-06 22:23:06,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1517 transitions. [2019-11-06 22:23:06,831 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1517 transitions. Word has length 222 [2019-11-06 22:23:06,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:06,832 INFO L462 AbstractCegarLoop]: Abstraction has 1015 states and 1517 transitions. [2019-11-06 22:23:06,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:06,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1517 transitions. [2019-11-06 22:23:06,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-06 22:23:06,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:06,839 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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] [2019-11-06 22:23:06,839 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:06,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:06,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1975125977, now seen corresponding path program 1 times [2019-11-06 22:23:06,840 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:06,840 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390301134] [2019-11-06 22:23:06,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:06,930 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-11-06 22:23:06,930 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390301134] [2019-11-06 22:23:06,931 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:06,931 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:06,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979017799] [2019-11-06 22:23:06,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:06,932 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:06,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:06,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:06,932 INFO L87 Difference]: Start difference. First operand 1015 states and 1517 transitions. Second operand 5 states. [2019-11-06 22:23:07,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:07,187 INFO L93 Difference]: Finished difference Result 2025 states and 3027 transitions. [2019-11-06 22:23:07,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:07,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2019-11-06 22:23:07,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:07,196 INFO L225 Difference]: With dead ends: 2025 [2019-11-06 22:23:07,197 INFO L226 Difference]: Without dead ends: 1005 [2019-11-06 22:23:07,199 INFO L630 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-11-06 22:23:07,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2019-11-06 22:23:07,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 997. [2019-11-06 22:23:07,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-06 22:23:07,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1479 transitions. [2019-11-06 22:23:07,242 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1479 transitions. Word has length 223 [2019-11-06 22:23:07,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:07,243 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1479 transitions. [2019-11-06 22:23:07,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:07,243 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1479 transitions. [2019-11-06 22:23:07,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-06 22:23:07,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:07,247 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:07,247 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:07,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:07,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1054088717, now seen corresponding path program 1 times [2019-11-06 22:23:07,248 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:07,248 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959595856] [2019-11-06 22:23:07,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:07,324 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-11-06 22:23:07,325 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959595856] [2019-11-06 22:23:07,325 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:07,325 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:07,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522707833] [2019-11-06 22:23:07,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:07,327 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:07,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:07,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:07,327 INFO L87 Difference]: Start difference. First operand 997 states and 1479 transitions. Second operand 5 states. [2019-11-06 22:23:07,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:07,566 INFO L93 Difference]: Finished difference Result 2035 states and 3025 transitions. [2019-11-06 22:23:07,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:07,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 230 [2019-11-06 22:23:07,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:07,573 INFO L225 Difference]: With dead ends: 2035 [2019-11-06 22:23:07,573 INFO L226 Difference]: Without dead ends: 1051 [2019-11-06 22:23:07,575 INFO L630 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-11-06 22:23:07,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2019-11-06 22:23:07,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1043. [2019-11-06 22:23:07,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-11-06 22:23:07,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1533 transitions. [2019-11-06 22:23:07,626 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1533 transitions. Word has length 230 [2019-11-06 22:23:07,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:07,627 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1533 transitions. [2019-11-06 22:23:07,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:07,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1533 transitions. [2019-11-06 22:23:07,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-11-06 22:23:07,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:07,631 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:07,631 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:07,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:07,633 INFO L82 PathProgramCache]: Analyzing trace with hash 364858085, now seen corresponding path program 1 times [2019-11-06 22:23:07,633 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:07,633 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895760321] [2019-11-06 22:23:07,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:07,720 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-11-06 22:23:07,720 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895760321] [2019-11-06 22:23:07,721 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:07,721 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:07,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715444418] [2019-11-06 22:23:07,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:07,722 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:07,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:07,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:07,722 INFO L87 Difference]: Start difference. First operand 1043 states and 1533 transitions. Second operand 5 states. [2019-11-06 22:23:07,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:07,964 INFO L93 Difference]: Finished difference Result 2081 states and 3059 transitions. [2019-11-06 22:23:07,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:07,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-11-06 22:23:07,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:07,969 INFO L225 Difference]: With dead ends: 2081 [2019-11-06 22:23:07,969 INFO L226 Difference]: Without dead ends: 1043 [2019-11-06 22:23:07,972 INFO L630 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-11-06 22:23:07,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-11-06 22:23:08,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1035. [2019-11-06 22:23:08,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2019-11-06 22:23:08,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1501 transitions. [2019-11-06 22:23:08,028 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1501 transitions. Word has length 231 [2019-11-06 22:23:08,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:08,028 INFO L462 AbstractCegarLoop]: Abstraction has 1035 states and 1501 transitions. [2019-11-06 22:23:08,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:08,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1501 transitions. [2019-11-06 22:23:08,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-11-06 22:23:08,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:08,033 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:08,033 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:08,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:08,033 INFO L82 PathProgramCache]: Analyzing trace with hash -567208800, now seen corresponding path program 1 times [2019-11-06 22:23:08,034 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:08,034 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038133713] [2019-11-06 22:23:08,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:08,131 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 466 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-11-06 22:23:08,131 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038133713] [2019-11-06 22:23:08,131 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944896765] [2019-11-06 22:23:08,132 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-11-06 22:23:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:08,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-06 22:23:08,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:23:08,391 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-11-06 22:23:08,392 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:23:08,392 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-06 22:23:08,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7135687] [2019-11-06 22:23:08,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:23:08,393 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:08,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:23:08,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:08,394 INFO L87 Difference]: Start difference. First operand 1035 states and 1501 transitions. Second operand 3 states. [2019-11-06 22:23:08,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:08,530 INFO L93 Difference]: Finished difference Result 2567 states and 3726 transitions. [2019-11-06 22:23:08,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:23:08,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 267 [2019-11-06 22:23:08,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:08,539 INFO L225 Difference]: With dead ends: 2567 [2019-11-06 22:23:08,539 INFO L226 Difference]: Without dead ends: 1545 [2019-11-06 22:23:08,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 269 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-11-06 22:23:08,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2019-11-06 22:23:08,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1545. [2019-11-06 22:23:08,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1545 states. [2019-11-06 22:23:08,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2241 transitions. [2019-11-06 22:23:08,681 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2241 transitions. Word has length 267 [2019-11-06 22:23:08,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:08,682 INFO L462 AbstractCegarLoop]: Abstraction has 1545 states and 2241 transitions. [2019-11-06 22:23:08,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:23:08,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2241 transitions. [2019-11-06 22:23:08,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-11-06 22:23:08,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:08,692 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:23:08,906 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:23:08,907 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:08,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:08,907 INFO L82 PathProgramCache]: Analyzing trace with hash 767374129, now seen corresponding path program 1 times [2019-11-06 22:23:08,908 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:08,908 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098240359] [2019-11-06 22:23:08,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:09,133 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-11-06 22:23:09,133 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098240359] [2019-11-06 22:23:09,134 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:09,134 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:23:09,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311716174] [2019-11-06 22:23:09,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:23:09,135 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:09,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:23:09,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:23:09,136 INFO L87 Difference]: Start difference. First operand 1545 states and 2241 transitions. Second operand 3 states. [2019-11-06 22:23:09,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:09,375 INFO L93 Difference]: Finished difference Result 4528 states and 6569 transitions. [2019-11-06 22:23:09,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:23:09,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2019-11-06 22:23:09,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:09,395 INFO L225 Difference]: With dead ends: 4528 [2019-11-06 22:23:09,395 INFO L226 Difference]: Without dead ends: 2996 [2019-11-06 22:23:09,401 INFO L630 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-11-06 22:23:09,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2019-11-06 22:23:09,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 2994. [2019-11-06 22:23:09,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2994 states. [2019-11-06 22:23:09,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2994 states to 2994 states and 4335 transitions. [2019-11-06 22:23:09,649 INFO L78 Accepts]: Start accepts. Automaton has 2994 states and 4335 transitions. Word has length 274 [2019-11-06 22:23:09,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:09,650 INFO L462 AbstractCegarLoop]: Abstraction has 2994 states and 4335 transitions. [2019-11-06 22:23:09,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:23:09,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2994 states and 4335 transitions. [2019-11-06 22:23:09,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-11-06 22:23:09,659 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:09,660 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:23:09,660 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:09,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:09,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1658002288, now seen corresponding path program 1 times [2019-11-06 22:23:09,661 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:09,661 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720055784] [2019-11-06 22:23:09,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:09,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:09,812 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-11-06 22:23:09,813 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720055784] [2019-11-06 22:23:09,813 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:09,813 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:23:09,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275453319] [2019-11-06 22:23:09,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:23:09,814 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:09,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:23:09,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:23:09,815 INFO L87 Difference]: Start difference. First operand 2994 states and 4335 transitions. Second operand 3 states. [2019-11-06 22:23:10,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:10,120 INFO L93 Difference]: Finished difference Result 6095 states and 8845 transitions. [2019-11-06 22:23:10,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:23:10,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-11-06 22:23:10,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:10,133 INFO L225 Difference]: With dead ends: 6095 [2019-11-06 22:23:10,133 INFO L226 Difference]: Without dead ends: 1997 [2019-11-06 22:23:10,144 INFO L630 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-11-06 22:23:10,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2019-11-06 22:23:10,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1977. [2019-11-06 22:23:10,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1977 states. [2019-11-06 22:23:10,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2813 transitions. [2019-11-06 22:23:10,287 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2813 transitions. Word has length 311 [2019-11-06 22:23:10,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:10,288 INFO L462 AbstractCegarLoop]: Abstraction has 1977 states and 2813 transitions. [2019-11-06 22:23:10,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:23:10,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2813 transitions. [2019-11-06 22:23:10,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-11-06 22:23:10,304 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:10,304 INFO L410 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, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-11-06 22:23:10,304 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:10,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:10,305 INFO L82 PathProgramCache]: Analyzing trace with hash -872859034, now seen corresponding path program 1 times [2019-11-06 22:23:10,305 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:10,305 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985414941] [2019-11-06 22:23:10,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:10,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-06 22:23:10,488 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985414941] [2019-11-06 22:23:10,489 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616724493] [2019-11-06 22:23:10,489 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-11-06 22:23:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:10,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:23:10,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:23:10,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-11-06 22:23:10,745 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:23:10,745 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-06 22:23:10,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674831273] [2019-11-06 22:23:10,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:23:10,746 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:10,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:23:10,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:23:10,747 INFO L87 Difference]: Start difference. First operand 1977 states and 2813 transitions. Second operand 4 states. [2019-11-06 22:23:11,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:11,115 INFO L93 Difference]: Finished difference Result 4590 states and 6521 transitions. [2019-11-06 22:23:11,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:11,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 377 [2019-11-06 22:23:11,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:11,131 INFO L225 Difference]: With dead ends: 4590 [2019-11-06 22:23:11,131 INFO L226 Difference]: Without dead ends: 2582 [2019-11-06 22:23:11,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 381 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-11-06 22:23:11,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2582 states. [2019-11-06 22:23:11,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2582 to 1954. [2019-11-06 22:23:11,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2019-11-06 22:23:11,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2698 transitions. [2019-11-06 22:23:11,254 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2698 transitions. Word has length 377 [2019-11-06 22:23:11,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:11,255 INFO L462 AbstractCegarLoop]: Abstraction has 1954 states and 2698 transitions. [2019-11-06 22:23:11,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:23:11,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2698 transitions. [2019-11-06 22:23:11,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2019-11-06 22:23:11,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:11,275 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 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, 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] [2019-11-06 22:23:11,488 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:23:11,489 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:11,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:11,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1790317548, now seen corresponding path program 1 times [2019-11-06 22:23:11,491 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:11,491 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575533616] [2019-11-06 22:23:11,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:11,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-06 22:23:11,846 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575533616] [2019-11-06 22:23:11,847 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624646518] [2019-11-06 22:23:11,847 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-11-06 22:23:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:12,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:23:12,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:23:12,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-11-06 22:23:12,359 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:23:12,359 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-06 22:23:12,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876768311] [2019-11-06 22:23:12,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:23:12,362 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:12,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:23:12,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:23:12,362 INFO L87 Difference]: Start difference. First operand 1954 states and 2698 transitions. Second operand 4 states. [2019-11-06 22:23:12,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:12,681 INFO L93 Difference]: Finished difference Result 4809 states and 6669 transitions. [2019-11-06 22:23:12,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:23:12,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 605 [2019-11-06 22:23:12,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:12,700 INFO L225 Difference]: With dead ends: 4809 [2019-11-06 22:23:12,700 INFO L226 Difference]: Without dead ends: 2736 [2019-11-06 22:23:12,705 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 609 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-11-06 22:23:12,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2019-11-06 22:23:12,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 1954. [2019-11-06 22:23:12,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2019-11-06 22:23:12,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2698 transitions. [2019-11-06 22:23:12,810 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2698 transitions. Word has length 605 [2019-11-06 22:23:12,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:12,811 INFO L462 AbstractCegarLoop]: Abstraction has 1954 states and 2698 transitions. [2019-11-06 22:23:12,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:23:12,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2698 transitions. [2019-11-06 22:23:12,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2019-11-06 22:23:12,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:12,819 INFO L410 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 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, 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] [2019-11-06 22:23:13,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:23:13,025 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:13,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:13,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1901319823, now seen corresponding path program 1 times [2019-11-06 22:23:13,026 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:13,026 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351603506] [2019-11-06 22:23:13,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:13,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5249 backedges. 2922 proven. 0 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2019-11-06 22:23:13,399 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351603506] [2019-11-06 22:23:13,400 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:13,400 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:23:13,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193117023] [2019-11-06 22:23:13,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:23:13,401 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:13,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:23:13,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:23:13,402 INFO L87 Difference]: Start difference. First operand 1954 states and 2698 transitions. Second operand 3 states. [2019-11-06 22:23:13,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:13,645 INFO L93 Difference]: Finished difference Result 3929 states and 5418 transitions. [2019-11-06 22:23:13,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:23:13,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 675 [2019-11-06 22:23:13,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:13,652 INFO L225 Difference]: With dead ends: 3929 [2019-11-06 22:23:13,653 INFO L226 Difference]: Without dead ends: 1994 [2019-11-06 22:23:13,657 INFO L630 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-11-06 22:23:13,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2019-11-06 22:23:13,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1954. [2019-11-06 22:23:13,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2019-11-06 22:23:13,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2678 transitions. [2019-11-06 22:23:13,743 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2678 transitions. Word has length 675 [2019-11-06 22:23:13,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:13,744 INFO L462 AbstractCegarLoop]: Abstraction has 1954 states and 2678 transitions. [2019-11-06 22:23:13,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:23:13,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2678 transitions. [2019-11-06 22:23:13,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2019-11-06 22:23:13,751 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:13,752 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 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, 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] [2019-11-06 22:23:13,752 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:13,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:13,752 INFO L82 PathProgramCache]: Analyzing trace with hash -554544010, now seen corresponding path program 1 times [2019-11-06 22:23:13,752 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:13,753 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473952901] [2019-11-06 22:23:13,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:14,090 INFO L134 CoverageAnalysis]: Checked inductivity of 5385 backedges. 2915 proven. 0 refuted. 0 times theorem prover too weak. 2470 trivial. 0 not checked. [2019-11-06 22:23:14,090 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473952901] [2019-11-06 22:23:14,091 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:14,091 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:23:14,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833054389] [2019-11-06 22:23:14,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:23:14,092 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:14,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:23:14,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:23:14,092 INFO L87 Difference]: Start difference. First operand 1954 states and 2678 transitions. Second operand 3 states. [2019-11-06 22:23:14,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:14,305 INFO L93 Difference]: Finished difference Result 3921 states and 5369 transitions. [2019-11-06 22:23:14,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:23:14,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 689 [2019-11-06 22:23:14,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:14,310 INFO L225 Difference]: With dead ends: 3921 [2019-11-06 22:23:14,310 INFO L226 Difference]: Without dead ends: 1986 [2019-11-06 22:23:14,314 INFO L630 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-11-06 22:23:14,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2019-11-06 22:23:14,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1941. [2019-11-06 22:23:14,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1941 states. [2019-11-06 22:23:14,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2619 transitions. [2019-11-06 22:23:14,399 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2619 transitions. Word has length 689 [2019-11-06 22:23:14,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:14,399 INFO L462 AbstractCegarLoop]: Abstraction has 1941 states and 2619 transitions. [2019-11-06 22:23:14,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:23:14,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2619 transitions. [2019-11-06 22:23:14,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 718 [2019-11-06 22:23:14,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:14,408 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 22, 22, 22, 20, 20, 18, 18, 16, 16, 14, 14, 14, 14, 12, 10, 10, 8, 8, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:14,408 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:14,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:14,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1850705057, now seen corresponding path program 1 times [2019-11-06 22:23:14,409 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:14,409 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555115246] [2019-11-06 22:23:14,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:14,875 INFO L134 CoverageAnalysis]: Checked inductivity of 5826 backedges. 3231 proven. 0 refuted. 0 times theorem prover too weak. 2595 trivial. 0 not checked. [2019-11-06 22:23:14,875 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555115246] [2019-11-06 22:23:14,876 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:14,876 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:23:14,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179604072] [2019-11-06 22:23:14,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:23:14,878 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:14,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:23:14,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:23:14,879 INFO L87 Difference]: Start difference. First operand 1941 states and 2619 transitions. Second operand 3 states. [2019-11-06 22:23:15,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:15,080 INFO L93 Difference]: Finished difference Result 3943 states and 5323 transitions. [2019-11-06 22:23:15,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:23:15,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 717 [2019-11-06 22:23:15,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:15,085 INFO L225 Difference]: With dead ends: 3943 [2019-11-06 22:23:15,085 INFO L226 Difference]: Without dead ends: 2003 [2019-11-06 22:23:15,088 INFO L630 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-11-06 22:23:15,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2019-11-06 22:23:15,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1983. [2019-11-06 22:23:15,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1983 states. [2019-11-06 22:23:15,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 2664 transitions. [2019-11-06 22:23:15,224 INFO L78 Accepts]: Start accepts. Automaton has 1983 states and 2664 transitions. Word has length 717 [2019-11-06 22:23:15,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:15,225 INFO L462 AbstractCegarLoop]: Abstraction has 1983 states and 2664 transitions. [2019-11-06 22:23:15,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:23:15,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 2664 transitions. [2019-11-06 22:23:15,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2019-11-06 22:23:15,232 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:15,233 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 20, 20, 18, 18, 16, 16, 14, 14, 14, 14, 12, 10, 10, 8, 8, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:15,233 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:15,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:15,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1896110854, now seen corresponding path program 1 times [2019-11-06 22:23:15,234 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:15,234 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476617323] [2019-11-06 22:23:15,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:15,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5992 backedges. 3254 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2019-11-06 22:23:15,563 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476617323] [2019-11-06 22:23:15,563 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:15,563 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:23:15,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141722386] [2019-11-06 22:23:15,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:23:15,564 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:15,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:23:15,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:23:15,565 INFO L87 Difference]: Start difference. First operand 1983 states and 2664 transitions. Second operand 3 states. [2019-11-06 22:23:15,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:15,720 INFO L93 Difference]: Finished difference Result 2548 states and 3406 transitions. [2019-11-06 22:23:15,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:23:15,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 732 [2019-11-06 22:23:15,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:15,721 INFO L225 Difference]: With dead ends: 2548 [2019-11-06 22:23:15,721 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 22:23:15,726 INFO L630 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-11-06 22:23:15,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 22:23:15,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 22:23:15,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 22:23:15,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 22:23:15,727 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 732 [2019-11-06 22:23:15,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:15,727 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 22:23:15,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:23:15,728 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 22:23:15,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 22:23:15,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 22:23:16,960 WARN L191 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 176 [2019-11-06 22:23:17,361 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 159 [2019-11-06 22:23:17,712 WARN L191 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 175 [2019-11-06 22:23:19,193 WARN L191 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 151 DAG size of output: 117 [2019-11-06 22:23:20,064 WARN L191 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 118 [2019-11-06 22:23:20,848 WARN L191 SmtUtils]: Spent 776.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 120 [2019-11-06 22:23:21,844 WARN L191 SmtUtils]: Spent 993.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 123 [2019-11-06 22:23:22,302 WARN L191 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 108 [2019-11-06 22:23:23,105 WARN L191 SmtUtils]: Spent 800.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 117 [2019-11-06 22:23:23,913 WARN L191 SmtUtils]: Spent 806.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 117 [2019-11-06 22:23:25,218 WARN L191 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 151 DAG size of output: 117 [2019-11-06 22:23:26,362 WARN L191 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 157 DAG size of output: 120 [2019-11-06 22:23:28,138 WARN L191 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 171 DAG size of output: 120