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_4.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:50:48,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:50:48,071 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:50:48,090 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:50:48,090 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:50:48,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:50:48,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:50:48,107 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:50:48,109 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:50:48,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:50:48,113 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:50:48,114 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:50:48,115 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:50:48,118 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:50:48,121 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:50:48,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:50:48,124 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:50:48,127 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:50:48,129 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:50:48,134 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:50:48,139 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:50:48,142 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:50:48,143 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:50:48,144 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:50:48,149 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:50:48,149 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:50:48,150 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:50:48,151 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:50:48,153 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:50:48,154 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:50:48,154 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:50:48,156 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:50:48,156 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:50:48,157 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:50:48,159 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:50:48,159 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:50:48,160 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:50:48,160 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:50:48,160 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:50:48,161 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:50:48,162 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:50:48,163 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 19:50:48,182 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:50:48,182 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:50:48,184 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:50:48,185 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:50:48,185 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:50:48,185 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:50:48,185 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:50:48,186 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:50:48,186 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:50:48,186 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:50:48,187 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:50:48,188 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:50:48,188 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:50:48,189 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:50:48,189 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:50:48,189 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:50:48,189 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:50:48,189 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:50:48,190 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:50:48,190 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:50:48,190 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:50:48,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:50:48,190 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:50:48,191 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:50:48,191 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:50:48,191 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:50:48,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:50:48,191 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:50:48,191 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:50:48,487 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:50:48,499 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:50:48,503 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:50:48,505 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:50:48,505 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:50:48,506 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_4.cil.c [2019-10-13 19:50:48,570 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2762f28e7/879ba7604d534552a355068cf9db2e43/FLAGd1299182b [2019-10-13 19:50:49,052 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:50:49,053 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_4.cil.c [2019-10-13 19:50:49,065 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2762f28e7/879ba7604d534552a355068cf9db2e43/FLAGd1299182b [2019-10-13 19:50:49,380 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2762f28e7/879ba7604d534552a355068cf9db2e43 [2019-10-13 19:50:49,390 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:50:49,392 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:50:49,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:50:49,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:50:49,396 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:50:49,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:50:49" (1/1) ... [2019-10-13 19:50:49,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d4f7f74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:49, skipping insertion in model container [2019-10-13 19:50:49,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:50:49" (1/1) ... [2019-10-13 19:50:49,406 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:50:49,463 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:50:49,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:50:49,712 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:50:49,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:50:49,875 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:50:49,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:49 WrapperNode [2019-10-13 19:50:49,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:50:49,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:50:49,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:50:49,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:50:49,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:49" (1/1) ... [2019-10-13 19:50:49,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:49" (1/1) ... [2019-10-13 19:50:49,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:49" (1/1) ... [2019-10-13 19:50:49,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:49" (1/1) ... [2019-10-13 19:50:49,912 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:49" (1/1) ... [2019-10-13 19:50:49,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:49" (1/1) ... [2019-10-13 19:50:49,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:49" (1/1) ... [2019-10-13 19:50:49,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:50:49,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:50:49,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:50:49,935 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:50:49,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:50:49,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:50:49,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:50:49,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-13 19:50:49,997 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:50:49,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:50:49,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 19:50:49,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:50:49,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-13 19:50:49,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-13 19:50:49,998 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-13 19:50:49,998 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:50:49,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:50:49,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:50:50,250 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 19:50:50,768 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-13 19:50:50,769 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-13 19:50:50,774 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:50:50,774 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 19:50:50,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:50:50 BoogieIcfgContainer [2019-10-13 19:50:50,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:50:50,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:50:50,779 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:50:50,782 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:50:50,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:50:49" (1/3) ... [2019-10-13 19:50:50,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25dc9d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:50:50, skipping insertion in model container [2019-10-13 19:50:50,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:49" (2/3) ... [2019-10-13 19:50:50,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25dc9d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:50:50, skipping insertion in model container [2019-10-13 19:50:50,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:50:50" (3/3) ... [2019-10-13 19:50:50,800 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_4.cil.c [2019-10-13 19:50:50,811 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:50:50,821 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:50:50,833 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:50:50,871 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:50:50,871 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:50:50,871 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:50:50,871 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:50:50,872 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:50:50,872 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:50:50,872 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:50:50,872 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:50:50,898 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-10-13 19:50:50,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-13 19:50:50,908 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:50,909 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:50,912 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:50,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:50,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1127072202, now seen corresponding path program 1 times [2019-10-13 19:50:50,924 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:50,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160203385] [2019-10-13 19:50:50,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:50,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:50,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:51,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:50:51,228 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160203385] [2019-10-13 19:50:51,229 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:51,229 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:51,230 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520756358] [2019-10-13 19:50:51,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:51,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:51,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:51,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:51,253 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 5 states. [2019-10-13 19:50:51,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:51,749 INFO L93 Difference]: Finished difference Result 337 states and 574 transitions. [2019-10-13 19:50:51,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:51,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-13 19:50:51,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:51,770 INFO L225 Difference]: With dead ends: 337 [2019-10-13 19:50:51,771 INFO L226 Difference]: Without dead ends: 180 [2019-10-13 19:50:51,778 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:51,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-13 19:50:51,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2019-10-13 19:50:51,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-13 19:50:51,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 280 transitions. [2019-10-13 19:50:51,872 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 280 transitions. Word has length 49 [2019-10-13 19:50:51,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:51,873 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 280 transitions. [2019-10-13 19:50:51,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:51,873 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 280 transitions. [2019-10-13 19:50:51,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 19:50:51,876 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:51,876 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:51,876 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:51,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:51,877 INFO L82 PathProgramCache]: Analyzing trace with hash 572375021, now seen corresponding path program 1 times [2019-10-13 19:50:51,877 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:51,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575472646] [2019-10-13 19:50:51,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:51,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:51,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:52,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:50:52,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575472646] [2019-10-13 19:50:52,004 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:52,004 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:52,004 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224441294] [2019-10-13 19:50:52,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:52,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:52,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:52,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:52,008 INFO L87 Difference]: Start difference. First operand 175 states and 280 transitions. Second operand 5 states. [2019-10-13 19:50:52,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:52,366 INFO L93 Difference]: Finished difference Result 385 states and 629 transitions. [2019-10-13 19:50:52,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:52,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-13 19:50:52,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:52,374 INFO L225 Difference]: With dead ends: 385 [2019-10-13 19:50:52,374 INFO L226 Difference]: Without dead ends: 221 [2019-10-13 19:50:52,378 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:52,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-10-13 19:50:52,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2019-10-13 19:50:52,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-13 19:50:52,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 357 transitions. [2019-10-13 19:50:52,410 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 357 transitions. Word has length 50 [2019-10-13 19:50:52,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:52,411 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 357 transitions. [2019-10-13 19:50:52,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:52,411 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 357 transitions. [2019-10-13 19:50:52,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-13 19:50:52,415 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:52,415 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:52,415 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:52,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:52,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1550770299, now seen corresponding path program 1 times [2019-10-13 19:50:52,416 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:52,416 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114130931] [2019-10-13 19:50:52,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:52,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:52,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:52,566 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:50:52,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114130931] [2019-10-13 19:50:52,567 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:52,567 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:52,567 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629155618] [2019-10-13 19:50:52,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:52,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:52,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:52,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:52,575 INFO L87 Difference]: Start difference. First operand 216 states and 357 transitions. Second operand 5 states. [2019-10-13 19:50:52,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:52,838 INFO L93 Difference]: Finished difference Result 450 states and 755 transitions. [2019-10-13 19:50:52,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:52,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-13 19:50:52,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:52,841 INFO L225 Difference]: With dead ends: 450 [2019-10-13 19:50:52,841 INFO L226 Difference]: Without dead ends: 247 [2019-10-13 19:50:52,843 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:52,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-13 19:50:52,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-10-13 19:50:52,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-10-13 19:50:52,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 413 transitions. [2019-10-13 19:50:52,866 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 413 transitions. Word has length 77 [2019-10-13 19:50:52,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:52,866 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 413 transitions. [2019-10-13 19:50:52,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:52,866 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 413 transitions. [2019-10-13 19:50:52,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-13 19:50:52,874 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:52,874 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:52,875 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:52,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:52,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1202289061, now seen corresponding path program 1 times [2019-10-13 19:50:52,875 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:52,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157545477] [2019-10-13 19:50:52,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:52,876 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:52,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:52,982 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 19:50:52,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157545477] [2019-10-13 19:50:52,983 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:52,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:52,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857483937] [2019-10-13 19:50:52,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:52,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:52,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:52,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:52,985 INFO L87 Difference]: Start difference. First operand 247 states and 413 transitions. Second operand 5 states. [2019-10-13 19:50:53,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:53,197 INFO L93 Difference]: Finished difference Result 498 states and 837 transitions. [2019-10-13 19:50:53,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:53,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-13 19:50:53,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:53,200 INFO L225 Difference]: With dead ends: 498 [2019-10-13 19:50:53,201 INFO L226 Difference]: Without dead ends: 264 [2019-10-13 19:50:53,202 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:53,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-10-13 19:50:53,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-10-13 19:50:53,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-10-13 19:50:53,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 436 transitions. [2019-10-13 19:50:53,217 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 436 transitions. Word has length 89 [2019-10-13 19:50:53,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:53,217 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 436 transitions. [2019-10-13 19:50:53,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:53,218 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 436 transitions. [2019-10-13 19:50:53,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-13 19:50:53,219 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:53,219 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-13 19:50:53,220 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:53,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:53,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1597952639, now seen corresponding path program 1 times [2019-10-13 19:50:53,220 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:53,220 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481369715] [2019-10-13 19:50:53,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:53,221 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:53,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:53,320 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:50:53,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481369715] [2019-10-13 19:50:53,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:53,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:53,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951006436] [2019-10-13 19:50:53,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:53,322 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:53,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:53,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:53,323 INFO L87 Difference]: Start difference. First operand 262 states and 436 transitions. Second operand 5 states. [2019-10-13 19:50:53,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:53,575 INFO L93 Difference]: Finished difference Result 558 states and 938 transitions. [2019-10-13 19:50:53,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:53,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-13 19:50:53,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:53,578 INFO L225 Difference]: With dead ends: 558 [2019-10-13 19:50:53,578 INFO L226 Difference]: Without dead ends: 309 [2019-10-13 19:50:53,579 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:53,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-10-13 19:50:53,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 304. [2019-10-13 19:50:53,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-13 19:50:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 510 transitions. [2019-10-13 19:50:53,594 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 510 transitions. Word has length 89 [2019-10-13 19:50:53,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:53,595 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 510 transitions. [2019-10-13 19:50:53,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:53,595 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 510 transitions. [2019-10-13 19:50:53,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-13 19:50:53,596 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:53,597 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:53,597 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:53,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:53,597 INFO L82 PathProgramCache]: Analyzing trace with hash -2044645757, now seen corresponding path program 1 times [2019-10-13 19:50:53,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:53,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336298166] [2019-10-13 19:50:53,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:53,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:53,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:53,695 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 19:50:53,695 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336298166] [2019-10-13 19:50:53,695 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:53,696 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:53,696 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276176048] [2019-10-13 19:50:53,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:53,696 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:53,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:53,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:53,697 INFO L87 Difference]: Start difference. First operand 304 states and 510 transitions. Second operand 5 states. [2019-10-13 19:50:53,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:53,911 INFO L93 Difference]: Finished difference Result 597 states and 1005 transitions. [2019-10-13 19:50:53,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:53,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-13 19:50:53,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:53,913 INFO L225 Difference]: With dead ends: 597 [2019-10-13 19:50:53,914 INFO L226 Difference]: Without dead ends: 306 [2019-10-13 19:50:53,915 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:53,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-13 19:50:53,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-10-13 19:50:53,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-13 19:50:53,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 506 transitions. [2019-10-13 19:50:53,928 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 506 transitions. Word has length 90 [2019-10-13 19:50:53,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:53,929 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 506 transitions. [2019-10-13 19:50:53,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:53,929 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 506 transitions. [2019-10-13 19:50:53,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-13 19:50:53,930 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:53,930 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-13 19:50:53,931 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:53,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:53,931 INFO L82 PathProgramCache]: Analyzing trace with hash -176213692, now seen corresponding path program 1 times [2019-10-13 19:50:53,931 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:53,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019817184] [2019-10-13 19:50:53,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:53,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:53,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:50:54,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019817184] [2019-10-13 19:50:54,001 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:54,002 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:54,002 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371826869] [2019-10-13 19:50:54,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:54,002 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:54,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:54,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:54,003 INFO L87 Difference]: Start difference. First operand 304 states and 506 transitions. Second operand 5 states. [2019-10-13 19:50:54,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:54,275 INFO L93 Difference]: Finished difference Result 600 states and 1002 transitions. [2019-10-13 19:50:54,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:54,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-13 19:50:54,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:54,278 INFO L225 Difference]: With dead ends: 600 [2019-10-13 19:50:54,278 INFO L226 Difference]: Without dead ends: 307 [2019-10-13 19:50:54,279 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:54,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-10-13 19:50:54,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 302. [2019-10-13 19:50:54,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-10-13 19:50:54,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 501 transitions. [2019-10-13 19:50:54,292 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 501 transitions. Word has length 90 [2019-10-13 19:50:54,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:54,293 INFO L462 AbstractCegarLoop]: Abstraction has 302 states and 501 transitions. [2019-10-13 19:50:54,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:54,293 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 501 transitions. [2019-10-13 19:50:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 19:50:54,294 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:54,295 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:54,295 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:54,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:54,295 INFO L82 PathProgramCache]: Analyzing trace with hash -690895868, now seen corresponding path program 1 times [2019-10-13 19:50:54,296 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:54,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544674425] [2019-10-13 19:50:54,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,376 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-13 19:50:54,376 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544674425] [2019-10-13 19:50:54,377 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:54,377 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:54,377 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407721135] [2019-10-13 19:50:54,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:54,378 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:54,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:54,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:54,378 INFO L87 Difference]: Start difference. First operand 302 states and 501 transitions. Second operand 5 states. [2019-10-13 19:50:54,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:54,551 INFO L93 Difference]: Finished difference Result 600 states and 997 transitions. [2019-10-13 19:50:54,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:54,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-13 19:50:54,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:54,554 INFO L225 Difference]: With dead ends: 600 [2019-10-13 19:50:54,554 INFO L226 Difference]: Without dead ends: 311 [2019-10-13 19:50:54,555 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:54,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-10-13 19:50:54,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2019-10-13 19:50:54,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-10-13 19:50:54,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 507 transitions. [2019-10-13 19:50:54,569 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 507 transitions. Word has length 102 [2019-10-13 19:50:54,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:54,569 INFO L462 AbstractCegarLoop]: Abstraction has 311 states and 507 transitions. [2019-10-13 19:50:54,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:54,569 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 507 transitions. [2019-10-13 19:50:54,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-13 19:50:54,571 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:54,571 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:54,571 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:54,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:54,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1568096766, now seen corresponding path program 1 times [2019-10-13 19:50:54,572 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:54,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637289913] [2019-10-13 19:50:54,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,637 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 19:50:54,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637289913] [2019-10-13 19:50:54,638 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:54,638 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:54,639 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375050104] [2019-10-13 19:50:54,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:54,640 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:54,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:54,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:54,641 INFO L87 Difference]: Start difference. First operand 311 states and 507 transitions. Second operand 5 states. [2019-10-13 19:50:54,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:54,860 INFO L93 Difference]: Finished difference Result 640 states and 1050 transitions. [2019-10-13 19:50:54,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:54,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-13 19:50:54,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:54,863 INFO L225 Difference]: With dead ends: 640 [2019-10-13 19:50:54,864 INFO L226 Difference]: Without dead ends: 342 [2019-10-13 19:50:54,865 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:54,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-13 19:50:54,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-10-13 19:50:54,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-13 19:50:54,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 554 transitions. [2019-10-13 19:50:54,880 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 554 transitions. Word has length 103 [2019-10-13 19:50:54,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:54,881 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 554 transitions. [2019-10-13 19:50:54,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:54,882 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 554 transitions. [2019-10-13 19:50:54,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 19:50:54,883 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:54,884 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:54,884 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:54,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:54,884 INFO L82 PathProgramCache]: Analyzing trace with hash -314967930, now seen corresponding path program 1 times [2019-10-13 19:50:54,885 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:54,885 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988171502] [2019-10-13 19:50:54,885 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,885 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,945 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 19:50:54,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988171502] [2019-10-13 19:50:54,946 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:54,946 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:54,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185774176] [2019-10-13 19:50:54,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:54,947 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:54,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:54,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:54,948 INFO L87 Difference]: Start difference. First operand 340 states and 554 transitions. Second operand 5 states. [2019-10-13 19:50:55,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:55,143 INFO L93 Difference]: Finished difference Result 669 states and 1093 transitions. [2019-10-13 19:50:55,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:55,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-13 19:50:55,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:55,145 INFO L225 Difference]: With dead ends: 669 [2019-10-13 19:50:55,145 INFO L226 Difference]: Without dead ends: 342 [2019-10-13 19:50:55,146 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:55,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-13 19:50:55,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-10-13 19:50:55,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-13 19:50:55,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 550 transitions. [2019-10-13 19:50:55,160 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 550 transitions. Word has length 104 [2019-10-13 19:50:55,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:55,160 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 550 transitions. [2019-10-13 19:50:55,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:55,160 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 550 transitions. [2019-10-13 19:50:55,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 19:50:55,162 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:55,162 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:55,163 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:55,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:55,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1055150734, now seen corresponding path program 1 times [2019-10-13 19:50:55,163 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:55,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857126460] [2019-10-13 19:50:55,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,220 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 19:50:55,221 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857126460] [2019-10-13 19:50:55,221 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:55,221 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:55,221 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716798966] [2019-10-13 19:50:55,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:55,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:55,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:55,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:55,223 INFO L87 Difference]: Start difference. First operand 340 states and 550 transitions. Second operand 5 states. [2019-10-13 19:50:55,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:55,434 INFO L93 Difference]: Finished difference Result 702 states and 1143 transitions. [2019-10-13 19:50:55,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:55,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-13 19:50:55,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:55,437 INFO L225 Difference]: With dead ends: 702 [2019-10-13 19:50:55,437 INFO L226 Difference]: Without dead ends: 375 [2019-10-13 19:50:55,438 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:55,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-13 19:50:55,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-10-13 19:50:55,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-13 19:50:55,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 592 transitions. [2019-10-13 19:50:55,454 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 592 transitions. Word has length 105 [2019-10-13 19:50:55,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:55,454 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 592 transitions. [2019-10-13 19:50:55,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:55,454 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 592 transitions. [2019-10-13 19:50:55,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 19:50:55,456 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:55,456 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:55,456 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:55,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:55,457 INFO L82 PathProgramCache]: Analyzing trace with hash -2124208522, now seen corresponding path program 1 times [2019-10-13 19:50:55,457 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:55,457 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296042096] [2019-10-13 19:50:55,457 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,513 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 19:50:55,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296042096] [2019-10-13 19:50:55,513 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:55,514 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:55,514 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740151654] [2019-10-13 19:50:55,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:55,514 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:55,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:55,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:55,515 INFO L87 Difference]: Start difference. First operand 367 states and 592 transitions. Second operand 5 states. [2019-10-13 19:50:55,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:55,754 INFO L93 Difference]: Finished difference Result 729 states and 1180 transitions. [2019-10-13 19:50:55,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:55,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 19:50:55,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:55,758 INFO L225 Difference]: With dead ends: 729 [2019-10-13 19:50:55,758 INFO L226 Difference]: Without dead ends: 375 [2019-10-13 19:50:55,759 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:55,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-13 19:50:55,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-10-13 19:50:55,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-13 19:50:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 587 transitions. [2019-10-13 19:50:55,776 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 587 transitions. Word has length 106 [2019-10-13 19:50:55,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:55,777 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 587 transitions. [2019-10-13 19:50:55,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:55,777 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 587 transitions. [2019-10-13 19:50:55,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-13 19:50:55,779 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:55,779 INFO L380 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-10-13 19:50:55,779 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:55,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:55,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1027752783, now seen corresponding path program 1 times [2019-10-13 19:50:55,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:55,781 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723568216] [2019-10-13 19:50:55,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,835 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-13 19:50:55,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723568216] [2019-10-13 19:50:55,836 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:55,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:55,836 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751702744] [2019-10-13 19:50:55,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:55,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:55,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:55,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:55,838 INFO L87 Difference]: Start difference. First operand 367 states and 587 transitions. Second operand 5 states. [2019-10-13 19:50:56,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:56,053 INFO L93 Difference]: Finished difference Result 746 states and 1198 transitions. [2019-10-13 19:50:56,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:56,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-10-13 19:50:56,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:56,057 INFO L225 Difference]: With dead ends: 746 [2019-10-13 19:50:56,057 INFO L226 Difference]: Without dead ends: 392 [2019-10-13 19:50:56,059 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:56,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-10-13 19:50:56,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2019-10-13 19:50:56,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-13 19:50:56,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 616 transitions. [2019-10-13 19:50:56,110 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 616 transitions. Word has length 110 [2019-10-13 19:50:56,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:56,110 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 616 transitions. [2019-10-13 19:50:56,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:56,111 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 616 transitions. [2019-10-13 19:50:56,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 19:50:56,112 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:56,113 INFO L380 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-10-13 19:50:56,113 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:56,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:56,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1923701177, now seen corresponding path program 1 times [2019-10-13 19:50:56,114 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:56,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004596443] [2019-10-13 19:50:56,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,188 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-13 19:50:56,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004596443] [2019-10-13 19:50:56,189 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:56,190 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:56,190 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715299365] [2019-10-13 19:50:56,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:56,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:56,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:56,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:56,192 INFO L87 Difference]: Start difference. First operand 388 states and 616 transitions. Second operand 5 states. [2019-10-13 19:50:56,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:56,403 INFO L93 Difference]: Finished difference Result 767 states and 1221 transitions. [2019-10-13 19:50:56,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:56,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-10-13 19:50:56,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:56,405 INFO L225 Difference]: With dead ends: 767 [2019-10-13 19:50:56,406 INFO L226 Difference]: Without dead ends: 392 [2019-10-13 19:50:56,407 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:56,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-10-13 19:50:56,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2019-10-13 19:50:56,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-13 19:50:56,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 610 transitions. [2019-10-13 19:50:56,425 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 610 transitions. Word has length 111 [2019-10-13 19:50:56,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:56,426 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 610 transitions. [2019-10-13 19:50:56,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:56,426 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 610 transitions. [2019-10-13 19:50:56,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-13 19:50:56,428 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:56,428 INFO L380 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-10-13 19:50:56,428 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:56,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:56,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1132457392, now seen corresponding path program 1 times [2019-10-13 19:50:56,429 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:56,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791364517] [2019-10-13 19:50:56,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-13 19:50:56,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791364517] [2019-10-13 19:50:56,486 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:56,486 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:56,486 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574431124] [2019-10-13 19:50:56,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:56,487 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:56,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:56,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:56,488 INFO L87 Difference]: Start difference. First operand 388 states and 610 transitions. Second operand 3 states. [2019-10-13 19:50:56,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:56,547 INFO L93 Difference]: Finished difference Result 763 states and 1203 transitions. [2019-10-13 19:50:56,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:56,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-10-13 19:50:56,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:56,552 INFO L225 Difference]: With dead ends: 763 [2019-10-13 19:50:56,552 INFO L226 Difference]: Without dead ends: 761 [2019-10-13 19:50:56,553 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:56,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-10-13 19:50:56,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2019-10-13 19:50:56,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-10-13 19:50:56,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1201 transitions. [2019-10-13 19:50:56,587 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1201 transitions. Word has length 126 [2019-10-13 19:50:56,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:56,588 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 1201 transitions. [2019-10-13 19:50:56,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:56,588 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1201 transitions. [2019-10-13 19:50:56,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-13 19:50:56,591 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:56,591 INFO L380 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, 1] [2019-10-13 19:50:56,592 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:56,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:56,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1143263811, now seen corresponding path program 1 times [2019-10-13 19:50:56,592 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:56,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9999012] [2019-10-13 19:50:56,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,639 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-13 19:50:56,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9999012] [2019-10-13 19:50:56,640 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:56,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:56,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6256446] [2019-10-13 19:50:56,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:56,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:56,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:56,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:56,641 INFO L87 Difference]: Start difference. First operand 761 states and 1201 transitions. Second operand 3 states. [2019-10-13 19:50:56,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:56,721 INFO L93 Difference]: Finished difference Result 1837 states and 2905 transitions. [2019-10-13 19:50:56,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:56,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-13 19:50:56,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:56,727 INFO L225 Difference]: With dead ends: 1837 [2019-10-13 19:50:56,727 INFO L226 Difference]: Without dead ends: 1089 [2019-10-13 19:50:56,729 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:56,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2019-10-13 19:50:56,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1089. [2019-10-13 19:50:56,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089 states. [2019-10-13 19:50:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1718 transitions. [2019-10-13 19:50:56,776 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1718 transitions. Word has length 127 [2019-10-13 19:50:56,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:56,776 INFO L462 AbstractCegarLoop]: Abstraction has 1089 states and 1718 transitions. [2019-10-13 19:50:56,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:56,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1718 transitions. [2019-10-13 19:50:56,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-13 19:50:56,779 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:56,780 INFO L380 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, 1] [2019-10-13 19:50:56,780 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:56,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:56,780 INFO L82 PathProgramCache]: Analyzing trace with hash 733219007, now seen corresponding path program 1 times [2019-10-13 19:50:56,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:56,781 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632128771] [2019-10-13 19:50:56,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,815 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-13 19:50:56,815 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632128771] [2019-10-13 19:50:56,816 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:56,816 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:56,816 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139235035] [2019-10-13 19:50:56,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:56,817 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:56,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:56,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:56,817 INFO L87 Difference]: Start difference. First operand 1089 states and 1718 transitions. Second operand 3 states. [2019-10-13 19:50:56,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:56,892 INFO L93 Difference]: Finished difference Result 2534 states and 4005 transitions. [2019-10-13 19:50:56,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:56,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-13 19:50:56,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:56,901 INFO L225 Difference]: With dead ends: 2534 [2019-10-13 19:50:56,901 INFO L226 Difference]: Without dead ends: 1458 [2019-10-13 19:50:56,903 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:56,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2019-10-13 19:50:56,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1458. [2019-10-13 19:50:56,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1458 states. [2019-10-13 19:50:56,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 2300 transitions. [2019-10-13 19:50:56,961 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 2300 transitions. Word has length 127 [2019-10-13 19:50:56,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:56,962 INFO L462 AbstractCegarLoop]: Abstraction has 1458 states and 2300 transitions. [2019-10-13 19:50:56,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:56,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 2300 transitions. [2019-10-13 19:50:56,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-13 19:50:56,966 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:56,966 INFO L380 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, 1] [2019-10-13 19:50:56,966 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:56,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:56,967 INFO L82 PathProgramCache]: Analyzing trace with hash 2122513021, now seen corresponding path program 1 times [2019-10-13 19:50:56,967 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:56,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210899306] [2019-10-13 19:50:56,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,001 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-13 19:50:57,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210899306] [2019-10-13 19:50:57,002 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:57,002 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:57,002 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155787511] [2019-10-13 19:50:57,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:57,003 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:57,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:57,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:57,003 INFO L87 Difference]: Start difference. First operand 1458 states and 2300 transitions. Second operand 3 states. [2019-10-13 19:50:57,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:57,092 INFO L93 Difference]: Finished difference Result 3254 states and 5138 transitions. [2019-10-13 19:50:57,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:57,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-13 19:50:57,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:57,103 INFO L225 Difference]: With dead ends: 3254 [2019-10-13 19:50:57,103 INFO L226 Difference]: Without dead ends: 1809 [2019-10-13 19:50:57,107 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:57,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2019-10-13 19:50:57,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2019-10-13 19:50:57,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1809 states. [2019-10-13 19:50:57,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2851 transitions. [2019-10-13 19:50:57,255 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2851 transitions. Word has length 127 [2019-10-13 19:50:57,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:57,255 INFO L462 AbstractCegarLoop]: Abstraction has 1809 states and 2851 transitions. [2019-10-13 19:50:57,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:57,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2851 transitions. [2019-10-13 19:50:57,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-13 19:50:57,267 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:57,267 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-13 19:50:57,268 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:57,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:57,268 INFO L82 PathProgramCache]: Analyzing trace with hash 913291395, now seen corresponding path program 1 times [2019-10-13 19:50:57,269 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:57,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382114282] [2019-10-13 19:50:57,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,365 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-13 19:50:57,366 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382114282] [2019-10-13 19:50:57,366 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:57,367 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:57,367 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340580897] [2019-10-13 19:50:57,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:57,369 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:57,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:57,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:57,370 INFO L87 Difference]: Start difference. First operand 1809 states and 2851 transitions. Second operand 3 states. [2019-10-13 19:50:57,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:57,623 INFO L93 Difference]: Finished difference Result 3655 states and 5745 transitions. [2019-10-13 19:50:57,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:57,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-10-13 19:50:57,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:57,633 INFO L225 Difference]: With dead ends: 3655 [2019-10-13 19:50:57,634 INFO L226 Difference]: Without dead ends: 1859 [2019-10-13 19:50:57,640 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:57,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2019-10-13 19:50:57,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1809. [2019-10-13 19:50:57,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1809 states. [2019-10-13 19:50:57,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2779 transitions. [2019-10-13 19:50:57,733 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2779 transitions. Word has length 204 [2019-10-13 19:50:57,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:57,733 INFO L462 AbstractCegarLoop]: Abstraction has 1809 states and 2779 transitions. [2019-10-13 19:50:57,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:57,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2779 transitions. [2019-10-13 19:50:57,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-13 19:50:57,740 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:57,740 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:57,740 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:57,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:57,741 INFO L82 PathProgramCache]: Analyzing trace with hash -555522276, now seen corresponding path program 1 times [2019-10-13 19:50:57,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:57,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060493681] [2019-10-13 19:50:57,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,846 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-13 19:50:57,846 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060493681] [2019-10-13 19:50:57,846 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:57,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:57,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295190112] [2019-10-13 19:50:57,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:57,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:57,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:57,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:57,848 INFO L87 Difference]: Start difference. First operand 1809 states and 2779 transitions. Second operand 3 states. [2019-10-13 19:50:58,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:58,081 INFO L93 Difference]: Finished difference Result 3704 states and 5669 transitions. [2019-10-13 19:50:58,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:58,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-10-13 19:50:58,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:58,093 INFO L225 Difference]: With dead ends: 3704 [2019-10-13 19:50:58,093 INFO L226 Difference]: Without dead ends: 1908 [2019-10-13 19:50:58,098 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:58,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2019-10-13 19:50:58,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1815. [2019-10-13 19:50:58,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1815 states. [2019-10-13 19:50:58,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 2712 transitions. [2019-10-13 19:50:58,172 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 2712 transitions. Word has length 218 [2019-10-13 19:50:58,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:58,173 INFO L462 AbstractCegarLoop]: Abstraction has 1815 states and 2712 transitions. [2019-10-13 19:50:58,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:58,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2712 transitions. [2019-10-13 19:50:58,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-13 19:50:58,179 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:58,179 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-10-13 19:50:58,180 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:58,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:58,180 INFO L82 PathProgramCache]: Analyzing trace with hash 2121219740, now seen corresponding path program 1 times [2019-10-13 19:50:58,180 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:58,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357399354] [2019-10-13 19:50:58,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,275 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-13 19:50:58,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357399354] [2019-10-13 19:50:58,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199744561] [2019-10-13 19:50:58,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:50:58,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:50:58,539 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-13 19:50:58,539 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:50:58,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-13 19:50:58,544 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094790373] [2019-10-13 19:50:58,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:50:58,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:58,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:50:58,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:50:58,549 INFO L87 Difference]: Start difference. First operand 1815 states and 2712 transitions. Second operand 4 states. [2019-10-13 19:50:59,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:59,024 INFO L93 Difference]: Finished difference Result 4312 states and 6397 transitions. [2019-10-13 19:50:59,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:59,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2019-10-13 19:50:59,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:59,040 INFO L225 Difference]: With dead ends: 4312 [2019-10-13 19:50:59,040 INFO L226 Difference]: Without dead ends: 2483 [2019-10-13 19:50:59,044 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:59,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2019-10-13 19:50:59,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 1641. [2019-10-13 19:50:59,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1641 states. [2019-10-13 19:50:59,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2418 transitions. [2019-10-13 19:50:59,139 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2418 transitions. Word has length 237 [2019-10-13 19:50:59,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:59,139 INFO L462 AbstractCegarLoop]: Abstraction has 1641 states and 2418 transitions. [2019-10-13 19:50:59,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:50:59,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2418 transitions. [2019-10-13 19:50:59,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-13 19:50:59,145 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:59,146 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-10-13 19:50:59,351 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:59,352 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:59,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:59,352 INFO L82 PathProgramCache]: Analyzing trace with hash 499648914, now seen corresponding path program 1 times [2019-10-13 19:50:59,352 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:59,353 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297626005] [2019-10-13 19:50:59,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:59,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:59,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,461 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-10-13 19:50:59,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297626005] [2019-10-13 19:50:59,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:59,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:59,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000019343] [2019-10-13 19:50:59,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:59,463 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:59,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:59,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:59,463 INFO L87 Difference]: Start difference. First operand 1641 states and 2418 transitions. Second operand 3 states. [2019-10-13 19:50:59,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:59,657 INFO L93 Difference]: Finished difference Result 3442 states and 5085 transitions. [2019-10-13 19:50:59,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:59,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-10-13 19:50:59,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:59,666 INFO L225 Difference]: With dead ends: 3442 [2019-10-13 19:50:59,666 INFO L226 Difference]: Without dead ends: 1726 [2019-10-13 19:50:59,669 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:59,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-10-13 19:50:59,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1716. [2019-10-13 19:50:59,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1716 states. [2019-10-13 19:50:59,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2483 transitions. [2019-10-13 19:50:59,752 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2483 transitions. Word has length 246 [2019-10-13 19:50:59,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:59,753 INFO L462 AbstractCegarLoop]: Abstraction has 1716 states and 2483 transitions. [2019-10-13 19:50:59,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:59,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2483 transitions. [2019-10-13 19:50:59,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-13 19:50:59,758 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:59,759 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:59,759 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:59,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:59,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1931626416, now seen corresponding path program 1 times [2019-10-13 19:50:59,760 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:59,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090811431] [2019-10-13 19:50:59,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:59,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:59,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,871 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-13 19:50:59,871 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090811431] [2019-10-13 19:50:59,871 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825302691] [2019-10-13 19:50:59,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:00,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:00,183 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-13 19:51:00,183 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:51:00,184 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-13 19:51:00,185 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754562086] [2019-10-13 19:51:00,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:51:00,186 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:00,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:51:00,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:51:00,187 INFO L87 Difference]: Start difference. First operand 1716 states and 2483 transitions. Second operand 4 states. [2019-10-13 19:51:00,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:00,684 INFO L93 Difference]: Finished difference Result 5367 states and 7801 transitions. [2019-10-13 19:51:00,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:00,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2019-10-13 19:51:00,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:00,705 INFO L225 Difference]: With dead ends: 5367 [2019-10-13 19:51:00,705 INFO L226 Difference]: Without dead ends: 3696 [2019-10-13 19:51:00,710 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:00,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3696 states. [2019-10-13 19:51:00,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3696 to 2041. [2019-10-13 19:51:00,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2041 states. [2019-10-13 19:51:00,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 2785 transitions. [2019-10-13 19:51:00,810 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 2785 transitions. Word has length 258 [2019-10-13 19:51:00,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:00,810 INFO L462 AbstractCegarLoop]: Abstraction has 2041 states and 2785 transitions. [2019-10-13 19:51:00,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:51:00,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 2785 transitions. [2019-10-13 19:51:00,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-13 19:51:00,817 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:00,817 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:01,021 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:01,024 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:01,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:01,024 INFO L82 PathProgramCache]: Analyzing trace with hash -2074521490, now seen corresponding path program 1 times [2019-10-13 19:51:01,025 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:01,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257003861] [2019-10-13 19:51:01,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,137 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-10-13 19:51:01,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257003861] [2019-10-13 19:51:01,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:01,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:01,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415842979] [2019-10-13 19:51:01,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:01,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:01,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:01,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:01,141 INFO L87 Difference]: Start difference. First operand 2041 states and 2785 transitions. Second operand 3 states. [2019-10-13 19:51:01,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:01,280 INFO L93 Difference]: Finished difference Result 5779 states and 7920 transitions. [2019-10-13 19:51:01,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:01,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-10-13 19:51:01,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:01,325 INFO L225 Difference]: With dead ends: 5779 [2019-10-13 19:51:01,326 INFO L226 Difference]: Without dead ends: 3783 [2019-10-13 19:51:01,337 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:01,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3783 states. [2019-10-13 19:51:01,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 3781. [2019-10-13 19:51:01,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3781 states. [2019-10-13 19:51:01,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3781 states to 3781 states and 5190 transitions. [2019-10-13 19:51:01,538 INFO L78 Accepts]: Start accepts. Automaton has 3781 states and 5190 transitions. Word has length 258 [2019-10-13 19:51:01,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:01,539 INFO L462 AbstractCegarLoop]: Abstraction has 3781 states and 5190 transitions. [2019-10-13 19:51:01,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:01,539 INFO L276 IsEmpty]: Start isEmpty. Operand 3781 states and 5190 transitions. [2019-10-13 19:51:01,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-13 19:51:01,551 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:01,551 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1] [2019-10-13 19:51:01,552 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:01,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:01,552 INFO L82 PathProgramCache]: Analyzing trace with hash -381613367, now seen corresponding path program 1 times [2019-10-13 19:51:01,552 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:01,552 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666364456] [2019-10-13 19:51:01,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,637 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-13 19:51:01,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666364456] [2019-10-13 19:51:01,637 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:01,637 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:01,638 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700873832] [2019-10-13 19:51:01,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:01,638 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:01,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:01,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:01,639 INFO L87 Difference]: Start difference. First operand 3781 states and 5190 transitions. Second operand 3 states. [2019-10-13 19:51:01,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:01,948 INFO L93 Difference]: Finished difference Result 7745 states and 10622 transitions. [2019-10-13 19:51:01,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:01,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-10-13 19:51:01,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:01,957 INFO L225 Difference]: With dead ends: 7745 [2019-10-13 19:51:01,957 INFO L226 Difference]: Without dead ends: 4009 [2019-10-13 19:51:01,964 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:01,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2019-10-13 19:51:02,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 3781. [2019-10-13 19:51:02,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3781 states. [2019-10-13 19:51:02,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3781 states to 3781 states and 5086 transitions. [2019-10-13 19:51:02,136 INFO L78 Accepts]: Start accepts. Automaton has 3781 states and 5086 transitions. Word has length 261 [2019-10-13 19:51:02,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:02,136 INFO L462 AbstractCegarLoop]: Abstraction has 3781 states and 5086 transitions. [2019-10-13 19:51:02,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:02,137 INFO L276 IsEmpty]: Start isEmpty. Operand 3781 states and 5086 transitions. [2019-10-13 19:51:02,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-10-13 19:51:02,153 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:02,153 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:02,154 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:02,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:02,154 INFO L82 PathProgramCache]: Analyzing trace with hash 281332617, now seen corresponding path program 1 times [2019-10-13 19:51:02,154 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:02,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875576746] [2019-10-13 19:51:02,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:02,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:02,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,257 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2019-10-13 19:51:02,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875576746] [2019-10-13 19:51:02,258 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:02,258 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:02,258 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060734630] [2019-10-13 19:51:02,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:02,259 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:02,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:02,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:02,260 INFO L87 Difference]: Start difference. First operand 3781 states and 5086 transitions. Second operand 3 states. [2019-10-13 19:51:02,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:02,543 INFO L93 Difference]: Finished difference Result 7649 states and 10286 transitions. [2019-10-13 19:51:02,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:02,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 295 [2019-10-13 19:51:02,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:02,551 INFO L225 Difference]: With dead ends: 7649 [2019-10-13 19:51:02,551 INFO L226 Difference]: Without dead ends: 3913 [2019-10-13 19:51:02,558 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:02,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3913 states. [2019-10-13 19:51:02,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3913 to 3873. [2019-10-13 19:51:02,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3873 states. [2019-10-13 19:51:02,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3873 states to 3873 states and 5198 transitions. [2019-10-13 19:51:02,729 INFO L78 Accepts]: Start accepts. Automaton has 3873 states and 5198 transitions. Word has length 295 [2019-10-13 19:51:02,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:02,730 INFO L462 AbstractCegarLoop]: Abstraction has 3873 states and 5198 transitions. [2019-10-13 19:51:02,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:02,730 INFO L276 IsEmpty]: Start isEmpty. Operand 3873 states and 5198 transitions. [2019-10-13 19:51:02,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-10-13 19:51:02,740 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:02,741 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:02,741 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:02,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:02,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1099840201, now seen corresponding path program 1 times [2019-10-13 19:51:02,742 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:02,742 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278292278] [2019-10-13 19:51:02,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:02,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:02,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,826 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2019-10-13 19:51:02,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278292278] [2019-10-13 19:51:02,827 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:02,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:02,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245936520] [2019-10-13 19:51:02,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:02,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:02,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:02,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:02,829 INFO L87 Difference]: Start difference. First operand 3873 states and 5198 transitions. Second operand 3 states. [2019-10-13 19:51:03,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:03,115 INFO L93 Difference]: Finished difference Result 8081 states and 10908 transitions. [2019-10-13 19:51:03,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:03,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-10-13 19:51:03,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:03,125 INFO L225 Difference]: With dead ends: 8081 [2019-10-13 19:51:03,125 INFO L226 Difference]: Without dead ends: 4253 [2019-10-13 19:51:03,132 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:03,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4253 states. [2019-10-13 19:51:03,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4253 to 4123. [2019-10-13 19:51:03,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4123 states. [2019-10-13 19:51:03,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4123 states to 4123 states and 5498 transitions. [2019-10-13 19:51:03,308 INFO L78 Accepts]: Start accepts. Automaton has 4123 states and 5498 transitions. Word has length 316 [2019-10-13 19:51:03,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:03,309 INFO L462 AbstractCegarLoop]: Abstraction has 4123 states and 5498 transitions. [2019-10-13 19:51:03,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:03,309 INFO L276 IsEmpty]: Start isEmpty. Operand 4123 states and 5498 transitions. [2019-10-13 19:51:03,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-10-13 19:51:03,356 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:03,357 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:03,357 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:03,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:03,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1319175701, now seen corresponding path program 1 times [2019-10-13 19:51:03,358 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:03,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866563640] [2019-10-13 19:51:03,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:03,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:03,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-10-13 19:51:03,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866563640] [2019-10-13 19:51:03,467 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:03,467 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:03,467 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253441034] [2019-10-13 19:51:03,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:03,468 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:03,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:03,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:03,468 INFO L87 Difference]: Start difference. First operand 4123 states and 5498 transitions. Second operand 3 states. [2019-10-13 19:51:03,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:03,645 INFO L93 Difference]: Finished difference Result 6892 states and 9075 transitions. [2019-10-13 19:51:03,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:03,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-10-13 19:51:03,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:03,650 INFO L225 Difference]: With dead ends: 6892 [2019-10-13 19:51:03,650 INFO L226 Difference]: Without dead ends: 2170 [2019-10-13 19:51:03,657 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:03,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2019-10-13 19:51:03,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 2170. [2019-10-13 19:51:03,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2019-10-13 19:51:03,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 2829 transitions. [2019-10-13 19:51:03,729 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 2829 transitions. Word has length 326 [2019-10-13 19:51:03,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:03,729 INFO L462 AbstractCegarLoop]: Abstraction has 2170 states and 2829 transitions. [2019-10-13 19:51:03,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:03,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2829 transitions. [2019-10-13 19:51:03,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-10-13 19:51:03,734 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:03,735 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:03,735 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:03,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:03,735 INFO L82 PathProgramCache]: Analyzing trace with hash -231239372, now seen corresponding path program 1 times [2019-10-13 19:51:03,735 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:03,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417911053] [2019-10-13 19:51:03,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:03,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:03,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-13 19:51:03,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417911053] [2019-10-13 19:51:03,852 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:03,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:03,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637440022] [2019-10-13 19:51:03,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:03,853 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:03,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:03,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:03,854 INFO L87 Difference]: Start difference. First operand 2170 states and 2829 transitions. Second operand 3 states. [2019-10-13 19:51:04,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:04,067 INFO L93 Difference]: Finished difference Result 4335 states and 5656 transitions. [2019-10-13 19:51:04,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:04,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 342 [2019-10-13 19:51:04,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:04,074 INFO L225 Difference]: With dead ends: 4335 [2019-10-13 19:51:04,074 INFO L226 Difference]: Without dead ends: 2210 [2019-10-13 19:51:04,078 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:04,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2019-10-13 19:51:04,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 2170. [2019-10-13 19:51:04,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2019-10-13 19:51:04,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 2789 transitions. [2019-10-13 19:51:04,152 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 2789 transitions. Word has length 342 [2019-10-13 19:51:04,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:04,152 INFO L462 AbstractCegarLoop]: Abstraction has 2170 states and 2789 transitions. [2019-10-13 19:51:04,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:04,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2789 transitions. [2019-10-13 19:51:04,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-10-13 19:51:04,157 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:04,158 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:04,158 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:04,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:04,158 INFO L82 PathProgramCache]: Analyzing trace with hash -516641400, now seen corresponding path program 1 times [2019-10-13 19:51:04,159 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:04,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058610266] [2019-10-13 19:51:04,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:04,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:04,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-10-13 19:51:04,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058610266] [2019-10-13 19:51:04,278 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:04,278 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:04,278 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629511577] [2019-10-13 19:51:04,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:04,279 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:04,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:04,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:04,279 INFO L87 Difference]: Start difference. First operand 2170 states and 2789 transitions. Second operand 3 states. [2019-10-13 19:51:04,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:04,506 INFO L93 Difference]: Finished difference Result 4305 states and 5521 transitions. [2019-10-13 19:51:04,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:04,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 365 [2019-10-13 19:51:04,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:04,513 INFO L225 Difference]: With dead ends: 4305 [2019-10-13 19:51:04,513 INFO L226 Difference]: Without dead ends: 2180 [2019-10-13 19:51:04,519 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:04,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2019-10-13 19:51:04,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2170. [2019-10-13 19:51:04,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2019-10-13 19:51:04,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 2749 transitions. [2019-10-13 19:51:04,608 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 2749 transitions. Word has length 365 [2019-10-13 19:51:04,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:04,608 INFO L462 AbstractCegarLoop]: Abstraction has 2170 states and 2749 transitions. [2019-10-13 19:51:04,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:04,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2749 transitions. [2019-10-13 19:51:04,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-10-13 19:51:04,616 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:04,616 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 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, 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] [2019-10-13 19:51:04,617 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:04,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:04,617 INFO L82 PathProgramCache]: Analyzing trace with hash -753815824, now seen corresponding path program 1 times [2019-10-13 19:51:04,621 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:04,621 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825305620] [2019-10-13 19:51:04,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:04,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:04,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-10-13 19:51:04,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825305620] [2019-10-13 19:51:04,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708125100] [2019-10-13 19:51:04,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:04,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:05,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2019-10-13 19:51:05,075 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:51:05,076 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:51:05,076 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203877471] [2019-10-13 19:51:05,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:05,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:05,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:05,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:05,077 INFO L87 Difference]: Start difference. First operand 2170 states and 2749 transitions. Second operand 3 states. [2019-10-13 19:51:05,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:05,168 INFO L93 Difference]: Finished difference Result 2748 states and 3503 transitions. [2019-10-13 19:51:05,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:05,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 398 [2019-10-13 19:51:05,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:05,174 INFO L225 Difference]: With dead ends: 2748 [2019-10-13 19:51:05,175 INFO L226 Difference]: Without dead ends: 2610 [2019-10-13 19:51:05,175 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:05,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2019-10-13 19:51:05,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2034. [2019-10-13 19:51:05,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2034 states. [2019-10-13 19:51:05,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 2595 transitions. [2019-10-13 19:51:05,264 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 2595 transitions. Word has length 398 [2019-10-13 19:51:05,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:05,265 INFO L462 AbstractCegarLoop]: Abstraction has 2034 states and 2595 transitions. [2019-10-13 19:51:05,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:05,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2595 transitions. [2019-10-13 19:51:05,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2019-10-13 19:51:05,273 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:05,273 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:05,477 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:05,478 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:05,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:05,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1467408517, now seen corresponding path program 1 times [2019-10-13 19:51:05,478 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:05,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814559036] [2019-10-13 19:51:05,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:05,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:05,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-10-13 19:51:05,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814559036] [2019-10-13 19:51:05,655 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006610261] [2019-10-13 19:51:05,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:05,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:05,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-10-13 19:51:05,929 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:51:05,929 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-13 19:51:05,930 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311533141] [2019-10-13 19:51:05,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:51:05,934 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:05,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:51:05,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:51:05,934 INFO L87 Difference]: Start difference. First operand 2034 states and 2595 transitions. Second operand 4 states. [2019-10-13 19:51:06,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:06,334 INFO L93 Difference]: Finished difference Result 5073 states and 6483 transitions. [2019-10-13 19:51:06,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:06,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 414 [2019-10-13 19:51:06,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:06,343 INFO L225 Difference]: With dead ends: 5073 [2019-10-13 19:51:06,343 INFO L226 Difference]: Without dead ends: 3042 [2019-10-13 19:51:06,347 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:06,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2019-10-13 19:51:06,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 2194. [2019-10-13 19:51:06,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2194 states. [2019-10-13 19:51:06,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2194 states to 2194 states and 2815 transitions. [2019-10-13 19:51:06,438 INFO L78 Accepts]: Start accepts. Automaton has 2194 states and 2815 transitions. Word has length 414 [2019-10-13 19:51:06,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:06,438 INFO L462 AbstractCegarLoop]: Abstraction has 2194 states and 2815 transitions. [2019-10-13 19:51:06,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:51:06,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2194 states and 2815 transitions. [2019-10-13 19:51:06,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-10-13 19:51:06,448 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:06,449 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:06,661 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:06,662 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:06,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:06,662 INFO L82 PathProgramCache]: Analyzing trace with hash 591946799, now seen corresponding path program 1 times [2019-10-13 19:51:06,662 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:06,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967961522] [2019-10-13 19:51:06,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:06,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:06,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2337 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2019-10-13 19:51:06,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967961522] [2019-10-13 19:51:06,811 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:06,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:06,812 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820571134] [2019-10-13 19:51:06,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:06,813 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:06,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:06,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:06,813 INFO L87 Difference]: Start difference. First operand 2194 states and 2815 transitions. Second operand 3 states. [2019-10-13 19:51:07,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:07,025 INFO L93 Difference]: Finished difference Result 4523 states and 5818 transitions. [2019-10-13 19:51:07,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:07,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 476 [2019-10-13 19:51:07,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:07,030 INFO L225 Difference]: With dead ends: 4523 [2019-10-13 19:51:07,031 INFO L226 Difference]: Without dead ends: 2374 [2019-10-13 19:51:07,034 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:07,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2374 states. [2019-10-13 19:51:07,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2374 to 2364. [2019-10-13 19:51:07,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2364 states. [2019-10-13 19:51:07,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 3010 transitions. [2019-10-13 19:51:07,148 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 3010 transitions. Word has length 476 [2019-10-13 19:51:07,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:07,148 INFO L462 AbstractCegarLoop]: Abstraction has 2364 states and 3010 transitions. [2019-10-13 19:51:07,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:07,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 3010 transitions. [2019-10-13 19:51:07,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2019-10-13 19:51:07,155 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:07,155 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:07,156 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:07,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:07,156 INFO L82 PathProgramCache]: Analyzing trace with hash -957066491, now seen corresponding path program 1 times [2019-10-13 19:51:07,156 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:07,156 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934852769] [2019-10-13 19:51:07,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:07,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:07,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3102 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1342 trivial. 0 not checked. [2019-10-13 19:51:07,347 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934852769] [2019-10-13 19:51:07,347 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:07,348 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:07,348 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950764188] [2019-10-13 19:51:07,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:07,349 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:07,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:07,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:07,349 INFO L87 Difference]: Start difference. First operand 2364 states and 3010 transitions. Second operand 3 states. [2019-10-13 19:51:07,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:07,530 INFO L93 Difference]: Finished difference Result 4680 states and 5945 transitions. [2019-10-13 19:51:07,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:07,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 538 [2019-10-13 19:51:07,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:07,536 INFO L225 Difference]: With dead ends: 4680 [2019-10-13 19:51:07,536 INFO L226 Difference]: Without dead ends: 2361 [2019-10-13 19:51:07,540 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:07,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2019-10-13 19:51:07,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 2359. [2019-10-13 19:51:07,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2359 states. [2019-10-13 19:51:07,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 2940 transitions. [2019-10-13 19:51:07,611 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 2940 transitions. Word has length 538 [2019-10-13 19:51:07,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:07,612 INFO L462 AbstractCegarLoop]: Abstraction has 2359 states and 2940 transitions. [2019-10-13 19:51:07,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:07,612 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 2940 transitions. [2019-10-13 19:51:07,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2019-10-13 19:51:07,619 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:07,619 INFO L380 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] [2019-10-13 19:51:07,620 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:07,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:07,620 INFO L82 PathProgramCache]: Analyzing trace with hash -995203399, now seen corresponding path program 1 times [2019-10-13 19:51:07,620 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:07,621 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608321704] [2019-10-13 19:51:07,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:07,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:07,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-10-13 19:51:07,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608321704] [2019-10-13 19:51:07,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402133717] [2019-10-13 19:51:07,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:08,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 961 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:08,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:08,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-10-13 19:51:08,296 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:51:08,296 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-13 19:51:08,296 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878854272] [2019-10-13 19:51:08,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:51:08,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:08,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:51:08,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:51:08,297 INFO L87 Difference]: Start difference. First operand 2359 states and 2940 transitions. Second operand 4 states. [2019-10-13 19:51:08,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:08,514 INFO L93 Difference]: Finished difference Result 3954 states and 4950 transitions. [2019-10-13 19:51:08,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:51:08,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 604 [2019-10-13 19:51:08,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:08,516 INFO L225 Difference]: With dead ends: 3954 [2019-10-13 19:51:08,516 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 19:51:08,522 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 608 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:08,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 19:51:08,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 19:51:08,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 19:51:08,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 19:51:08,523 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 604 [2019-10-13 19:51:08,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:08,523 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 19:51:08,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:51:08,523 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 19:51:08,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 19:51:08,729 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:08,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 19:51:08,861 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 116 [2019-10-13 19:51:09,232 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 125 [2019-10-13 19:51:09,349 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 114 [2019-10-13 19:51:10,359 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 368 DAG size of output: 229 [2019-10-13 19:51:11,099 WARN L191 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 369 DAG size of output: 228 [2019-10-13 19:51:12,590 WARN L191 SmtUtils]: Spent 967.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 67 [2019-10-13 19:51:13,382 WARN L191 SmtUtils]: Spent 790.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 69 [2019-10-13 19:51:13,887 WARN L191 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 66 [2019-10-13 19:51:14,529 WARN L191 SmtUtils]: Spent 640.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2019-10-13 19:51:15,119 WARN L191 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 65 [2019-10-13 19:51:16,056 WARN L191 SmtUtils]: Spent 934.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 66 [2019-10-13 19:51:17,199 WARN L191 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 106 DAG size of output: 59 [2019-10-13 19:51:21,482 WARN L191 SmtUtils]: Spent 4.28 s on a formula simplification. DAG size of input: 193 DAG size of output: 118 [2019-10-13 19:51:22,523 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 113 DAG size of output: 67 [2019-10-13 19:51:23,247 WARN L191 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 81