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_8.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:50:49,825 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:50:49,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:50:49,844 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:50:49,845 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:50:49,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:50:49,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:50:49,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:50:49,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:50:49,851 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:50:49,852 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:50:49,853 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:50:49,854 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:50:49,855 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:50:49,855 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:50:49,857 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:50:49,857 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:50:49,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:50:49,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:50:49,862 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:50:49,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:50:49,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:50:49,865 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:50:49,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:50:49,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:50:49,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:50:49,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:50:49,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:50:49,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:50:49,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:50:49,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:50:49,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:50:49,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:50:49,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:50:49,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:50:49,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:50:49,878 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:50:49,878 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:50:49,879 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:50:49,880 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:50:49,880 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:50:49,885 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 19:50:49,901 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:50:49,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:50:49,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:50:49,903 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:50:49,903 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:50:49,903 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:50:49,904 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:50:49,904 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:50:49,904 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:50:49,904 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:50:49,904 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:50:49,904 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:50:49,905 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:50:49,905 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:50:49,905 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:50:49,905 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:50:49,905 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:50:49,906 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:50:49,906 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:50:49,906 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:50:49,906 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:50:49,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:50:49,907 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:50:49,907 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:50:49,907 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:50:49,907 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:50:49,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:50:49,908 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:50:49,908 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:50:50,173 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:50:50,194 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:50:50,198 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:50:50,199 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:50:50,200 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:50:50,200 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_8.cil.c [2019-10-13 19:50:50,278 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db08ce3a7/5076555ed9664d1e84d139fd9aef362a/FLAG8e6a73f6d [2019-10-13 19:50:50,803 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:50:50,804 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_8.cil.c [2019-10-13 19:50:50,824 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db08ce3a7/5076555ed9664d1e84d139fd9aef362a/FLAG8e6a73f6d [2019-10-13 19:50:51,089 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db08ce3a7/5076555ed9664d1e84d139fd9aef362a [2019-10-13 19:50:51,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:50:51,098 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:50:51,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:50:51,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:50:51,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:50:51,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:50:51" (1/1) ... [2019-10-13 19:50:51,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@490a7745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:51, skipping insertion in model container [2019-10-13 19:50:51,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:50:51" (1/1) ... [2019-10-13 19:50:51,115 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:50:51,155 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:50:51,431 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:50:51,436 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:50:51,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:50:51,609 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:50:51,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:51 WrapperNode [2019-10-13 19:50:51,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:50:51,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:50:51,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:50:51,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:50:51,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:51" (1/1) ... [2019-10-13 19:50:51,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:51" (1/1) ... [2019-10-13 19:50:51,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:51" (1/1) ... [2019-10-13 19:50:51,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:51" (1/1) ... [2019-10-13 19:50:51,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:51" (1/1) ... [2019-10-13 19:50:51,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:51" (1/1) ... [2019-10-13 19:50:51,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:51" (1/1) ... [2019-10-13 19:50:51,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:50:51,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:50:51,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:50:51,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:50:51,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:50:51,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:50:51,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:50:51,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-13 19:50:51,733 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:50:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:50:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 19:50:51,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:50:51,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-13 19:50:51,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-13 19:50:51,734 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-13 19:50:51,734 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:50:51,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:50:51,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:50:51,992 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 19:50:52,534 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-13 19:50:52,534 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-13 19:50:52,539 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:50:52,543 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 19:50:52,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:50:52 BoogieIcfgContainer [2019-10-13 19:50:52,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:50:52,547 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:50:52,547 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:50:52,551 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:50:52,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:50:51" (1/3) ... [2019-10-13 19:50:52,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26eb6317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:50:52, skipping insertion in model container [2019-10-13 19:50:52,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:51" (2/3) ... [2019-10-13 19:50:52,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26eb6317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:50:52, skipping insertion in model container [2019-10-13 19:50:52,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:50:52" (3/3) ... [2019-10-13 19:50:52,569 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_8.cil.c [2019-10-13 19:50:52,578 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:50:52,587 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:50:52,595 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:50:52,621 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:50:52,621 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:50:52,622 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:50:52,622 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:50:52,622 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:50:52,622 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:50:52,622 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:50:52,623 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:50:52,645 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2019-10-13 19:50:52,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-13 19:50:52,655 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:52,656 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] [2019-10-13 19:50:52,658 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:52,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:52,664 INFO L82 PathProgramCache]: Analyzing trace with hash -617772913, now seen corresponding path program 1 times [2019-10-13 19:50:52,672 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:52,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975555652] [2019-10-13 19:50:52,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:52,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:52,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:52,953 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,954 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975555652] [2019-10-13 19:50:52,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:52,956 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:52,956 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335184632] [2019-10-13 19:50:52,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:52,963 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:52,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:52,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:52,982 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 5 states. [2019-10-13 19:50:53,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:53,481 INFO L93 Difference]: Finished difference Result 348 states and 596 transitions. [2019-10-13 19:50:53,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:53,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-13 19:50:53,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:53,496 INFO L225 Difference]: With dead ends: 348 [2019-10-13 19:50:53,496 INFO L226 Difference]: Without dead ends: 185 [2019-10-13 19:50:53,501 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,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-10-13 19:50:53,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 177. [2019-10-13 19:50:53,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-10-13 19:50:53,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 284 transitions. [2019-10-13 19:50:53,568 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 284 transitions. Word has length 47 [2019-10-13 19:50:53,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:53,570 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 284 transitions. [2019-10-13 19:50:53,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:53,571 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 284 transitions. [2019-10-13 19:50:53,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-13 19:50:53,575 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:53,576 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] [2019-10-13 19:50:53,576 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:53,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:53,577 INFO L82 PathProgramCache]: Analyzing trace with hash 401544370, now seen corresponding path program 1 times [2019-10-13 19:50:53,578 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:53,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881040860] [2019-10-13 19:50:53,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:53,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:53,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:53,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:50:53,755 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881040860] [2019-10-13 19:50:53,755 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:53,755 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:53,756 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449372122] [2019-10-13 19:50:53,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:53,757 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:53,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:53,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:53,758 INFO L87 Difference]: Start difference. First operand 177 states and 284 transitions. Second operand 5 states. [2019-10-13 19:50:54,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:54,093 INFO L93 Difference]: Finished difference Result 388 states and 636 transitions. [2019-10-13 19:50:54,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:54,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-10-13 19:50:54,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:54,096 INFO L225 Difference]: With dead ends: 388 [2019-10-13 19:50:54,097 INFO L226 Difference]: Without dead ends: 224 [2019-10-13 19:50:54,103 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,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-13 19:50:54,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 216. [2019-10-13 19:50:54,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-13 19:50:54,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 357 transitions. [2019-10-13 19:50:54,153 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 357 transitions. Word has length 48 [2019-10-13 19:50:54,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:54,154 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 357 transitions. [2019-10-13 19:50:54,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:54,154 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 357 transitions. [2019-10-13 19:50:54,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-13 19:50:54,163 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:54,164 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] [2019-10-13 19:50:54,164 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:54,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:54,166 INFO L82 PathProgramCache]: Analyzing trace with hash 353705226, now seen corresponding path program 1 times [2019-10-13 19:50:54,166 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:54,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989538963] [2019-10-13 19:50:54,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,344 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:54,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989538963] [2019-10-13 19:50:54,345 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:54,345 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:54,345 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102518515] [2019-10-13 19:50:54,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:54,347 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:54,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:54,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:54,348 INFO L87 Difference]: Start difference. First operand 216 states and 357 transitions. Second operand 5 states. [2019-10-13 19:50:54,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:54,590 INFO L93 Difference]: Finished difference Result 450 states and 755 transitions. [2019-10-13 19:50:54,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:54,590 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-10-13 19:50:54,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:54,593 INFO L225 Difference]: With dead ends: 450 [2019-10-13 19:50:54,593 INFO L226 Difference]: Without dead ends: 247 [2019-10-13 19:50:54,594 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,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-13 19:50:54,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-10-13 19:50:54,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-10-13 19:50:54,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 413 transitions. [2019-10-13 19:50:54,611 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 413 transitions. Word has length 75 [2019-10-13 19:50:54,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:54,612 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 413 transitions. [2019-10-13 19:50:54,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:54,612 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 413 transitions. [2019-10-13 19:50:54,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-13 19:50:54,614 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:54,614 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:54,615 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:54,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:54,615 INFO L82 PathProgramCache]: Analyzing trace with hash -668843297, now seen corresponding path program 1 times [2019-10-13 19:50:54,615 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:54,616 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878578740] [2019-10-13 19:50:54,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,715 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:50:54,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878578740] [2019-10-13 19:50:54,716 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:54,716 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:54,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238975922] [2019-10-13 19:50:54,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:54,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:54,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:54,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:54,719 INFO L87 Difference]: Start difference. First operand 247 states and 413 transitions. Second operand 5 states. [2019-10-13 19:50:54,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:54,985 INFO L93 Difference]: Finished difference Result 519 states and 878 transitions. [2019-10-13 19:50:54,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:54,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-10-13 19:50:54,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:54,988 INFO L225 Difference]: With dead ends: 519 [2019-10-13 19:50:54,989 INFO L226 Difference]: Without dead ends: 285 [2019-10-13 19:50:54,990 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,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-10-13 19:50:55,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2019-10-13 19:50:55,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-10-13 19:50:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 478 transitions. [2019-10-13 19:50:55,004 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 478 transitions. Word has length 80 [2019-10-13 19:50:55,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:55,005 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 478 transitions. [2019-10-13 19:50:55,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:55,005 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 478 transitions. [2019-10-13 19:50:55,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-13 19:50:55,007 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:55,007 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:55,008 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:55,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:55,008 INFO L82 PathProgramCache]: Analyzing trace with hash 293568124, now seen corresponding path program 1 times [2019-10-13 19:50:55,008 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:55,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523262086] [2019-10-13 19:50:55,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,071 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:50:55,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523262086] [2019-10-13 19:50:55,071 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:55,072 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:55,072 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179585873] [2019-10-13 19:50:55,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:55,073 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:55,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:55,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:55,073 INFO L87 Difference]: Start difference. First operand 283 states and 478 transitions. Second operand 5 states. [2019-10-13 19:50:55,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:55,311 INFO L93 Difference]: Finished difference Result 555 states and 941 transitions. [2019-10-13 19:50:55,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:55,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-10-13 19:50:55,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:55,314 INFO L225 Difference]: With dead ends: 555 [2019-10-13 19:50:55,314 INFO L226 Difference]: Without dead ends: 285 [2019-10-13 19:50:55,316 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,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-10-13 19:50:55,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2019-10-13 19:50:55,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-10-13 19:50:55,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 476 transitions. [2019-10-13 19:50:55,334 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 476 transitions. Word has length 81 [2019-10-13 19:50:55,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:55,335 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 476 transitions. [2019-10-13 19:50:55,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:55,335 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 476 transitions. [2019-10-13 19:50:55,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-13 19:50:55,338 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:55,339 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] [2019-10-13 19:50:55,339 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:55,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:55,339 INFO L82 PathProgramCache]: Analyzing trace with hash -95009440, now seen corresponding path program 1 times [2019-10-13 19:50:55,340 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:55,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360952099] [2019-10-13 19:50:55,340 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,340 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,431 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:55,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360952099] [2019-10-13 19:50:55,432 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:55,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:55,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994672631] [2019-10-13 19:50:55,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:55,434 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:55,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:55,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:55,435 INFO L87 Difference]: Start difference. First operand 283 states and 476 transitions. Second operand 5 states. [2019-10-13 19:50:55,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:55,626 INFO L93 Difference]: Finished difference Result 570 states and 963 transitions. [2019-10-13 19:50:55,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:55,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-10-13 19:50:55,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:55,633 INFO L225 Difference]: With dead ends: 570 [2019-10-13 19:50:55,634 INFO L226 Difference]: Without dead ends: 300 [2019-10-13 19:50:55,635 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:55,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-13 19:50:55,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-10-13 19:50:55,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-13 19:50:55,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 498 transitions. [2019-10-13 19:50:55,656 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 498 transitions. Word has length 87 [2019-10-13 19:50:55,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:55,656 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 498 transitions. [2019-10-13 19:50:55,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:55,656 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 498 transitions. [2019-10-13 19:50:55,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-13 19:50:55,657 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:55,658 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] [2019-10-13 19:50:55,658 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:55,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:55,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1081604216, now seen corresponding path program 1 times [2019-10-13 19:50:55,658 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:55,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002651463] [2019-10-13 19:50:55,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,743 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:55,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002651463] [2019-10-13 19:50:55,743 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:55,744 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:55,744 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421019959] [2019-10-13 19:50:55,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:55,744 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:55,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:55,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:55,745 INFO L87 Difference]: Start difference. First operand 298 states and 498 transitions. Second operand 5 states. [2019-10-13 19:50:55,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:55,944 INFO L93 Difference]: Finished difference Result 585 states and 981 transitions. [2019-10-13 19:50:55,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:55,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-10-13 19:50:55,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:55,947 INFO L225 Difference]: With dead ends: 585 [2019-10-13 19:50:55,947 INFO L226 Difference]: Without dead ends: 300 [2019-10-13 19:50:55,948 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,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-13 19:50:55,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-10-13 19:50:55,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-13 19:50:55,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 494 transitions. [2019-10-13 19:50:55,961 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 494 transitions. Word has length 88 [2019-10-13 19:50:55,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:55,961 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 494 transitions. [2019-10-13 19:50:55,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:55,961 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 494 transitions. [2019-10-13 19:50:55,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-13 19:50:55,963 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:55,963 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:55,963 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:55,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:55,964 INFO L82 PathProgramCache]: Analyzing trace with hash 2001210697, now seen corresponding path program 1 times [2019-10-13 19:50:55,964 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:55,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253469556] [2019-10-13 19:50:55,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,027 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:56,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253469556] [2019-10-13 19:50:56,028 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:56,030 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:56,030 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4295519] [2019-10-13 19:50:56,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:56,031 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:56,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:56,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:56,031 INFO L87 Difference]: Start difference. First operand 298 states and 494 transitions. Second operand 5 states. [2019-10-13 19:50:56,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:56,190 INFO L93 Difference]: Finished difference Result 592 states and 983 transitions. [2019-10-13 19:50:56,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:56,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-13 19:50:56,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:56,192 INFO L225 Difference]: With dead ends: 592 [2019-10-13 19:50:56,192 INFO L226 Difference]: Without dead ends: 307 [2019-10-13 19:50:56,193 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,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-10-13 19:50:56,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2019-10-13 19:50:56,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-10-13 19:50:56,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 500 transitions. [2019-10-13 19:50:56,209 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 500 transitions. Word has length 100 [2019-10-13 19:50:56,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:56,210 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 500 transitions. [2019-10-13 19:50:56,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:56,210 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 500 transitions. [2019-10-13 19:50:56,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-13 19:50:56,213 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:56,213 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] [2019-10-13 19:50:56,214 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:56,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:56,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1192129085, now seen corresponding path program 1 times [2019-10-13 19:50:56,215 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:56,215 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509604694] [2019-10-13 19:50:56,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,275 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:56,275 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509604694] [2019-10-13 19:50:56,276 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:56,276 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:56,276 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547663860] [2019-10-13 19:50:56,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:56,277 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:56,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:56,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:56,277 INFO L87 Difference]: Start difference. First operand 307 states and 500 transitions. Second operand 5 states. [2019-10-13 19:50:56,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:56,498 INFO L93 Difference]: Finished difference Result 632 states and 1036 transitions. [2019-10-13 19:50:56,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:56,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-10-13 19:50:56,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:56,501 INFO L225 Difference]: With dead ends: 632 [2019-10-13 19:50:56,501 INFO L226 Difference]: Without dead ends: 338 [2019-10-13 19:50:56,503 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,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-10-13 19:50:56,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-10-13 19:50:56,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-10-13 19:50:56,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 547 transitions. [2019-10-13 19:50:56,518 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 547 transitions. Word has length 101 [2019-10-13 19:50:56,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:56,519 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 547 transitions. [2019-10-13 19:50:56,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 547 transitions. [2019-10-13 19:50:56,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 19:50:56,520 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:56,521 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] [2019-10-13 19:50:56,521 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:56,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:56,521 INFO L82 PathProgramCache]: Analyzing trace with hash 775386699, now seen corresponding path program 1 times [2019-10-13 19:50:56,521 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:56,522 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420974954] [2019-10-13 19:50:56,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,578 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:56,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420974954] [2019-10-13 19:50:56,579 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:56,579 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:56,580 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957860103] [2019-10-13 19:50:56,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:56,580 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:56,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:56,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:56,581 INFO L87 Difference]: Start difference. First operand 336 states and 547 transitions. Second operand 5 states. [2019-10-13 19:50:56,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:56,795 INFO L93 Difference]: Finished difference Result 661 states and 1079 transitions. [2019-10-13 19:50:56,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:56,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-13 19:50:56,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:56,798 INFO L225 Difference]: With dead ends: 661 [2019-10-13 19:50:56,798 INFO L226 Difference]: Without dead ends: 338 [2019-10-13 19:50:56,799 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,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-10-13 19:50:56,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-10-13 19:50:56,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-10-13 19:50:56,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 543 transitions. [2019-10-13 19:50:56,814 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 543 transitions. Word has length 102 [2019-10-13 19:50:56,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:56,814 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 543 transitions. [2019-10-13 19:50:56,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:56,814 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 543 transitions. [2019-10-13 19:50:56,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-13 19:50:56,816 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:56,816 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] [2019-10-13 19:50:56,816 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:56,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:56,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1217428909, now seen corresponding path program 1 times [2019-10-13 19:50:56,817 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:56,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850849094] [2019-10-13 19:50:56,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,887 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:56,888 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850849094] [2019-10-13 19:50:56,888 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:56,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:56,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599134720] [2019-10-13 19:50:56,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:56,889 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:56,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:56,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:56,890 INFO L87 Difference]: Start difference. First operand 336 states and 543 transitions. Second operand 5 states. [2019-10-13 19:50:57,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:57,073 INFO L93 Difference]: Finished difference Result 694 states and 1129 transitions. [2019-10-13 19:50:57,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:57,073 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-13 19:50:57,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:57,076 INFO L225 Difference]: With dead ends: 694 [2019-10-13 19:50:57,076 INFO L226 Difference]: Without dead ends: 371 [2019-10-13 19:50:57,077 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:57,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-10-13 19:50:57,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-10-13 19:50:57,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-10-13 19:50:57,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 585 transitions. [2019-10-13 19:50:57,093 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 585 transitions. Word has length 103 [2019-10-13 19:50:57,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:57,094 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 585 transitions. [2019-10-13 19:50:57,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:57,094 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 585 transitions. [2019-10-13 19:50:57,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 19:50:57,095 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:57,095 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] [2019-10-13 19:50:57,096 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:57,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:57,096 INFO L82 PathProgramCache]: Analyzing trace with hash -141729733, now seen corresponding path program 1 times [2019-10-13 19:50:57,096 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:57,097 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809262524] [2019-10-13 19:50:57,097 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,097 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,149 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:57,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809262524] [2019-10-13 19:50:57,150 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:57,150 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:57,150 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653332123] [2019-10-13 19:50:57,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:57,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:57,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:57,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:57,152 INFO L87 Difference]: Start difference. First operand 363 states and 585 transitions. Second operand 5 states. [2019-10-13 19:50:57,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:57,350 INFO L93 Difference]: Finished difference Result 721 states and 1166 transitions. [2019-10-13 19:50:57,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:57,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-13 19:50:57,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:57,353 INFO L225 Difference]: With dead ends: 721 [2019-10-13 19:50:57,353 INFO L226 Difference]: Without dead ends: 371 [2019-10-13 19:50:57,354 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:57,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-10-13 19:50:57,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-10-13 19:50:57,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-10-13 19:50:57,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 580 transitions. [2019-10-13 19:50:57,387 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 580 transitions. Word has length 104 [2019-10-13 19:50:57,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:57,387 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 580 transitions. [2019-10-13 19:50:57,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:57,387 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 580 transitions. [2019-10-13 19:50:57,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 19:50:57,389 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:57,389 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:57,389 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:57,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:57,390 INFO L82 PathProgramCache]: Analyzing trace with hash -564771468, now seen corresponding path program 1 times [2019-10-13 19:50:57,390 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:57,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433787917] [2019-10-13 19:50:57,393 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,465 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-13 19:50:57,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433787917] [2019-10-13 19:50:57,466 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:57,466 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:57,466 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456304289] [2019-10-13 19:50:57,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:57,467 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:57,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:57,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:57,468 INFO L87 Difference]: Start difference. First operand 363 states and 580 transitions. Second operand 5 states. [2019-10-13 19:50:57,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:57,665 INFO L93 Difference]: Finished difference Result 749 states and 1201 transitions. [2019-10-13 19:50:57,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:57,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-10-13 19:50:57,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:57,668 INFO L225 Difference]: With dead ends: 749 [2019-10-13 19:50:57,668 INFO L226 Difference]: Without dead ends: 399 [2019-10-13 19:50:57,669 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:57,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-10-13 19:50:57,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 397. [2019-10-13 19:50:57,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-10-13 19:50:57,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 633 transitions. [2019-10-13 19:50:57,686 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 633 transitions. Word has length 111 [2019-10-13 19:50:57,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:57,686 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 633 transitions. [2019-10-13 19:50:57,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:57,686 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 633 transitions. [2019-10-13 19:50:57,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-13 19:50:57,688 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:57,688 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:57,688 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:57,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:57,689 INFO L82 PathProgramCache]: Analyzing trace with hash -285750569, now seen corresponding path program 1 times [2019-10-13 19:50:57,689 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:57,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374615903] [2019-10-13 19:50:57,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,741 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-13 19:50:57,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374615903] [2019-10-13 19:50:57,741 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:57,742 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:57,742 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735777663] [2019-10-13 19:50:57,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:57,742 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:57,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:57,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:57,743 INFO L87 Difference]: Start difference. First operand 397 states and 633 transitions. Second operand 5 states. [2019-10-13 19:50:57,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:57,940 INFO L93 Difference]: Finished difference Result 783 states and 1251 transitions. [2019-10-13 19:50:57,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:57,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-10-13 19:50:57,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:57,943 INFO L225 Difference]: With dead ends: 783 [2019-10-13 19:50:57,943 INFO L226 Difference]: Without dead ends: 399 [2019-10-13 19:50:57,945 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:57,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-10-13 19:50:57,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 397. [2019-10-13 19:50:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-10-13 19:50:57,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 630 transitions. [2019-10-13 19:50:57,961 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 630 transitions. Word has length 112 [2019-10-13 19:50:57,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:57,961 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 630 transitions. [2019-10-13 19:50:57,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:57,962 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 630 transitions. [2019-10-13 19:50:57,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-13 19:50:57,963 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:57,963 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:57,964 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:57,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:57,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1187170139, now seen corresponding path program 1 times [2019-10-13 19:50:57,964 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:57,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416433247] [2019-10-13 19:50:57,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,035 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 19:50:58,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416433247] [2019-10-13 19:50:58,036 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:58,036 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:58,036 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25808596] [2019-10-13 19:50:58,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:58,037 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:58,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:58,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:58,037 INFO L87 Difference]: Start difference. First operand 397 states and 630 transitions. Second operand 5 states. [2019-10-13 19:50:58,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:58,255 INFO L93 Difference]: Finished difference Result 828 states and 1317 transitions. [2019-10-13 19:50:58,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:58,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-10-13 19:50:58,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:58,258 INFO L225 Difference]: With dead ends: 828 [2019-10-13 19:50:58,258 INFO L226 Difference]: Without dead ends: 444 [2019-10-13 19:50:58,259 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:58,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-10-13 19:50:58,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 439. [2019-10-13 19:50:58,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-10-13 19:50:58,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 695 transitions. [2019-10-13 19:50:58,277 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 695 transitions. Word has length 117 [2019-10-13 19:50:58,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:58,278 INFO L462 AbstractCegarLoop]: Abstraction has 439 states and 695 transitions. [2019-10-13 19:50:58,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:58,278 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 695 transitions. [2019-10-13 19:50:58,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-13 19:50:58,279 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:58,280 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:58,280 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:58,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:58,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1861118978, now seen corresponding path program 1 times [2019-10-13 19:50:58,281 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:58,281 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3497124] [2019-10-13 19:50:58,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,337 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 19:50:58,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3497124] [2019-10-13 19:50:58,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:58,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:58,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446662478] [2019-10-13 19:50:58,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:58,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:58,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:58,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:58,339 INFO L87 Difference]: Start difference. First operand 439 states and 695 transitions. Second operand 5 states. [2019-10-13 19:50:58,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:58,536 INFO L93 Difference]: Finished difference Result 874 states and 1388 transitions. [2019-10-13 19:50:58,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:58,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2019-10-13 19:50:58,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:58,539 INFO L225 Difference]: With dead ends: 874 [2019-10-13 19:50:58,539 INFO L226 Difference]: Without dead ends: 446 [2019-10-13 19:50:58,540 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:58,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-10-13 19:50:58,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 441. [2019-10-13 19:50:58,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-10-13 19:50:58,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 698 transitions. [2019-10-13 19:50:58,558 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 698 transitions. Word has length 118 [2019-10-13 19:50:58,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:58,558 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 698 transitions. [2019-10-13 19:50:58,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:58,558 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 698 transitions. [2019-10-13 19:50:58,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-13 19:50:58,560 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:58,560 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:58,561 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:58,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:58,561 INFO L82 PathProgramCache]: Analyzing trace with hash 385795336, now seen corresponding path program 1 times [2019-10-13 19:50:58,561 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:58,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135735923] [2019-10-13 19:50:58,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,616 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-13 19:50:58,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135735923] [2019-10-13 19:50:58,617 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:58,617 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:58,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292764063] [2019-10-13 19:50:58,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:58,618 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:58,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:58,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:58,618 INFO L87 Difference]: Start difference. First operand 441 states and 698 transitions. Second operand 5 states. [2019-10-13 19:50:58,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:58,851 INFO L93 Difference]: Finished difference Result 907 states and 1443 transitions. [2019-10-13 19:50:58,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:58,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2019-10-13 19:50:58,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:58,854 INFO L225 Difference]: With dead ends: 907 [2019-10-13 19:50:58,854 INFO L226 Difference]: Without dead ends: 479 [2019-10-13 19:50:58,855 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:58,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-10-13 19:50:58,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 466. [2019-10-13 19:50:58,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-13 19:50:58,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 733 transitions. [2019-10-13 19:50:58,874 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 733 transitions. Word has length 129 [2019-10-13 19:50:58,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:58,874 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 733 transitions. [2019-10-13 19:50:58,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:58,875 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 733 transitions. [2019-10-13 19:50:58,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-13 19:50:58,876 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:58,877 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:58,877 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:58,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:58,877 INFO L82 PathProgramCache]: Analyzing trace with hash -177817520, now seen corresponding path program 1 times [2019-10-13 19:50:58,877 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:58,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839068553] [2019-10-13 19:50:58,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-13 19:50:58,976 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839068553] [2019-10-13 19:50:58,976 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:58,977 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:58,977 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232009926] [2019-10-13 19:50:58,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:58,977 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:58,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:58,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:58,978 INFO L87 Difference]: Start difference. First operand 466 states and 733 transitions. Second operand 5 states. [2019-10-13 19:50:59,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:59,350 INFO L93 Difference]: Finished difference Result 932 states and 1470 transitions. [2019-10-13 19:50:59,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:59,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-10-13 19:50:59,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:59,355 INFO L225 Difference]: With dead ends: 932 [2019-10-13 19:50:59,355 INFO L226 Difference]: Without dead ends: 479 [2019-10-13 19:50:59,356 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:59,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-10-13 19:50:59,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 466. [2019-10-13 19:50:59,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-13 19:50:59,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 725 transitions. [2019-10-13 19:50:59,377 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 725 transitions. Word has length 130 [2019-10-13 19:50:59,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:59,377 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 725 transitions. [2019-10-13 19:50:59,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:59,378 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 725 transitions. [2019-10-13 19:50:59,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 19:50:59,379 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:59,380 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:59,380 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:59,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:59,381 INFO L82 PathProgramCache]: Analyzing trace with hash 755280415, now seen corresponding path program 1 times [2019-10-13 19:50:59,381 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:59,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013740150] [2019-10-13 19:50:59,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:59,382 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:59,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,471 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-13 19:50:59,471 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013740150] [2019-10-13 19:50:59,471 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:59,472 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:59,472 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739061965] [2019-10-13 19:50:59,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:59,474 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:59,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:59,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:59,475 INFO L87 Difference]: Start difference. First operand 466 states and 725 transitions. Second operand 5 states. [2019-10-13 19:50:59,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:59,755 INFO L93 Difference]: Finished difference Result 923 states and 1438 transitions. [2019-10-13 19:50:59,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:59,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2019-10-13 19:50:59,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:59,759 INFO L225 Difference]: With dead ends: 923 [2019-10-13 19:50:59,759 INFO L226 Difference]: Without dead ends: 470 [2019-10-13 19:50:59,760 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:59,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-10-13 19:50:59,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 466. [2019-10-13 19:50:59,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-13 19:50:59,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 720 transitions. [2019-10-13 19:50:59,785 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 720 transitions. Word has length 142 [2019-10-13 19:50:59,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:59,786 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 720 transitions. [2019-10-13 19:50:59,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:59,786 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 720 transitions. [2019-10-13 19:50:59,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 19:50:59,788 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:59,789 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:59,789 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:59,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:59,789 INFO L82 PathProgramCache]: Analyzing trace with hash -816490564, now seen corresponding path program 1 times [2019-10-13 19:50:59,790 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:59,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97898420] [2019-10-13 19:50:59,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:59,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:59,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:59,800 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,859 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-13 19:50:59,860 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97898420] [2019-10-13 19:50:59,860 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:59,860 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:59,860 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406702903] [2019-10-13 19:50:59,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:59,861 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:59,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:59,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:59,862 INFO L87 Difference]: Start difference. First operand 466 states and 720 transitions. Second operand 5 states. [2019-10-13 19:51:00,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:00,094 INFO L93 Difference]: Finished difference Result 923 states and 1428 transitions. [2019-10-13 19:51:00,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:00,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-10-13 19:51:00,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:00,097 INFO L225 Difference]: With dead ends: 923 [2019-10-13 19:51:00,097 INFO L226 Difference]: Without dead ends: 470 [2019-10-13 19:51:00,098 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:51:00,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-10-13 19:51:00,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 466. [2019-10-13 19:51:00,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-13 19:51:00,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 715 transitions. [2019-10-13 19:51:00,121 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 715 transitions. Word has length 143 [2019-10-13 19:51:00,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:00,122 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 715 transitions. [2019-10-13 19:51:00,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:51:00,122 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 715 transitions. [2019-10-13 19:51:00,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 19:51:00,124 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:00,125 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:00,125 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:00,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:00,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1136592958, now seen corresponding path program 1 times [2019-10-13 19:51:00,126 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:00,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141476885] [2019-10-13 19:51:00,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:00,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:00,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,190 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-10-13 19:51:00,190 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141476885] [2019-10-13 19:51:00,190 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:00,190 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:51:00,191 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992974028] [2019-10-13 19:51:00,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:51:00,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:00,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:51:00,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:00,196 INFO L87 Difference]: Start difference. First operand 466 states and 715 transitions. Second operand 5 states. [2019-10-13 19:51:00,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:00,433 INFO L93 Difference]: Finished difference Result 947 states and 1458 transitions. [2019-10-13 19:51:00,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:00,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-13 19:51:00,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:00,438 INFO L225 Difference]: With dead ends: 947 [2019-10-13 19:51:00,438 INFO L226 Difference]: Without dead ends: 494 [2019-10-13 19:51:00,443 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:51:00,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-10-13 19:51:00,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 490. [2019-10-13 19:51:00,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-10-13 19:51:00,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 746 transitions. [2019-10-13 19:51:00,478 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 746 transitions. Word has length 150 [2019-10-13 19:51:00,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:00,478 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 746 transitions. [2019-10-13 19:51:00,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:51:00,478 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 746 transitions. [2019-10-13 19:51:00,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-13 19:51:00,484 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:00,485 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:00,485 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:00,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:00,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1424495078, now seen corresponding path program 1 times [2019-10-13 19:51:00,486 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:00,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624932663] [2019-10-13 19:51:00,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:00,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:00,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,563 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-10-13 19:51:00,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624932663] [2019-10-13 19:51:00,563 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:00,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:51:00,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988549298] [2019-10-13 19:51:00,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:51:00,564 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:00,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:51:00,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:00,565 INFO L87 Difference]: Start difference. First operand 490 states and 746 transitions. Second operand 5 states. [2019-10-13 19:51:00,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:00,776 INFO L93 Difference]: Finished difference Result 971 states and 1480 transitions. [2019-10-13 19:51:00,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:00,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-10-13 19:51:00,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:00,781 INFO L225 Difference]: With dead ends: 971 [2019-10-13 19:51:00,782 INFO L226 Difference]: Without dead ends: 494 [2019-10-13 19:51:00,783 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:51:00,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-10-13 19:51:00,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 490. [2019-10-13 19:51:00,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-10-13 19:51:00,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 737 transitions. [2019-10-13 19:51:00,819 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 737 transitions. Word has length 151 [2019-10-13 19:51:00,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:00,820 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 737 transitions. [2019-10-13 19:51:00,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:51:00,820 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 737 transitions. [2019-10-13 19:51:00,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-13 19:51:00,822 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:00,829 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:00,829 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:00,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:00,830 INFO L82 PathProgramCache]: Analyzing trace with hash 311984194, now seen corresponding path program 1 times [2019-10-13 19:51:00,830 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:00,830 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027892585] [2019-10-13 19:51:00,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:00,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:00,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,897 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-13 19:51:00,898 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027892585] [2019-10-13 19:51:00,898 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:00,898 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:51:00,898 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278041175] [2019-10-13 19:51:00,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:51:00,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:00,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:51:00,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:00,902 INFO L87 Difference]: Start difference. First operand 490 states and 737 transitions. Second operand 5 states. [2019-10-13 19:51:01,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:01,175 INFO L93 Difference]: Finished difference Result 1014 states and 1523 transitions. [2019-10-13 19:51:01,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:01,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-10-13 19:51:01,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:01,180 INFO L225 Difference]: With dead ends: 1014 [2019-10-13 19:51:01,180 INFO L226 Difference]: Without dead ends: 537 [2019-10-13 19:51:01,182 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:51:01,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-10-13 19:51:01,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 531. [2019-10-13 19:51:01,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-10-13 19:51:01,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 792 transitions. [2019-10-13 19:51:01,220 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 792 transitions. Word has length 157 [2019-10-13 19:51:01,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:01,220 INFO L462 AbstractCegarLoop]: Abstraction has 531 states and 792 transitions. [2019-10-13 19:51:01,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:51:01,221 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 792 transitions. [2019-10-13 19:51:01,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-13 19:51:01,225 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:01,225 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:01,225 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:01,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:01,226 INFO L82 PathProgramCache]: Analyzing trace with hash -611548539, now seen corresponding path program 1 times [2019-10-13 19:51:01,227 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:01,227 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321873182] [2019-10-13 19:51:01,227 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,228 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,334 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-13 19:51:01,335 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321873182] [2019-10-13 19:51:01,335 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:01,335 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:51:01,336 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069129314] [2019-10-13 19:51:01,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:51:01,337 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:01,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:51:01,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:01,338 INFO L87 Difference]: Start difference. First operand 531 states and 792 transitions. Second operand 5 states. [2019-10-13 19:51:01,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:01,658 INFO L93 Difference]: Finished difference Result 1055 states and 1576 transitions. [2019-10-13 19:51:01,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:01,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-10-13 19:51:01,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:01,663 INFO L225 Difference]: With dead ends: 1055 [2019-10-13 19:51:01,663 INFO L226 Difference]: Without dead ends: 518 [2019-10-13 19:51:01,667 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:51:01,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-10-13 19:51:01,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 512. [2019-10-13 19:51:01,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-10-13 19:51:01,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 762 transitions. [2019-10-13 19:51:01,704 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 762 transitions. Word has length 158 [2019-10-13 19:51:01,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:01,705 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 762 transitions. [2019-10-13 19:51:01,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:51:01,705 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 762 transitions. [2019-10-13 19:51:01,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-13 19:51:01,708 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:01,708 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:01,709 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:01,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:01,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1831676618, now seen corresponding path program 1 times [2019-10-13 19:51:01,710 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:01,711 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587021812] [2019-10-13 19:51:01,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,837 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-10-13 19:51:01,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587021812] [2019-10-13 19:51:01,838 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:01,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:51:01,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424750389] [2019-10-13 19:51:01,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:51:01,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:01,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:51:01,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:01,841 INFO L87 Difference]: Start difference. First operand 512 states and 762 transitions. Second operand 5 states. [2019-10-13 19:51:02,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:02,146 INFO L93 Difference]: Finished difference Result 1036 states and 1548 transitions. [2019-10-13 19:51:02,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:02,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2019-10-13 19:51:02,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:02,149 INFO L225 Difference]: With dead ends: 1036 [2019-10-13 19:51:02,149 INFO L226 Difference]: Without dead ends: 537 [2019-10-13 19:51:02,151 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:51:02,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-10-13 19:51:02,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 533. [2019-10-13 19:51:02,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-10-13 19:51:02,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 786 transitions. [2019-10-13 19:51:02,191 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 786 transitions. Word has length 171 [2019-10-13 19:51:02,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:02,191 INFO L462 AbstractCegarLoop]: Abstraction has 533 states and 786 transitions. [2019-10-13 19:51:02,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:51:02,191 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 786 transitions. [2019-10-13 19:51:02,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-13 19:51:02,196 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:02,196 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:02,196 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:02,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:02,197 INFO L82 PathProgramCache]: Analyzing trace with hash -813103810, now seen corresponding path program 1 times [2019-10-13 19:51:02,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:02,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355029611] [2019-10-13 19:51:02,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:02,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:02,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,286 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-10-13 19:51:02,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355029611] [2019-10-13 19:51:02,286 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:02,287 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:51:02,287 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949902660] [2019-10-13 19:51:02,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:51:02,288 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:02,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:51:02,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:02,288 INFO L87 Difference]: Start difference. First operand 533 states and 786 transitions. Second operand 5 states. [2019-10-13 19:51:02,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:02,481 INFO L93 Difference]: Finished difference Result 1057 states and 1561 transitions. [2019-10-13 19:51:02,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:02,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2019-10-13 19:51:02,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:02,485 INFO L225 Difference]: With dead ends: 1057 [2019-10-13 19:51:02,485 INFO L226 Difference]: Without dead ends: 535 [2019-10-13 19:51:02,488 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:51:02,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-10-13 19:51:02,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 531. [2019-10-13 19:51:02,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-10-13 19:51:02,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 772 transitions. [2019-10-13 19:51:02,516 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 772 transitions. Word has length 172 [2019-10-13 19:51:02,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:02,516 INFO L462 AbstractCegarLoop]: Abstraction has 531 states and 772 transitions. [2019-10-13 19:51:02,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:51:02,516 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 772 transitions. [2019-10-13 19:51:02,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-13 19:51:02,519 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:02,519 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:02,519 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:02,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:02,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1628821973, now seen corresponding path program 1 times [2019-10-13 19:51:02,520 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:02,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818722100] [2019-10-13 19:51:02,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:02,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:02,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,597 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-13 19:51:02,597 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818722100] [2019-10-13 19:51:02,597 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719510112] [2019-10-13 19:51:02,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 19:51:02,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:02,826 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-10-13 19:51:02,827 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:51:02,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:51:02,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137520790] [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,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:02,830 INFO L87 Difference]: Start difference. First operand 531 states and 772 transitions. Second operand 3 states. [2019-10-13 19:51:02,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:02,967 INFO L93 Difference]: Finished difference Result 1565 states and 2281 transitions. [2019-10-13 19:51:02,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:02,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-10-13 19:51:02,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:02,976 INFO L225 Difference]: With dead ends: 1565 [2019-10-13 19:51:02,976 INFO L226 Difference]: Without dead ends: 1047 [2019-10-13 19:51:02,978 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 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:02,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2019-10-13 19:51:03,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1047. [2019-10-13 19:51:03,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2019-10-13 19:51:03,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1518 transitions. [2019-10-13 19:51:03,087 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1518 transitions. Word has length 187 [2019-10-13 19:51:03,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:03,088 INFO L462 AbstractCegarLoop]: Abstraction has 1047 states and 1518 transitions. [2019-10-13 19:51:03,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:03,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1518 transitions. [2019-10-13 19:51:03,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-13 19:51:03,094 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:03,095 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:03,301 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:03,301 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:03,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:03,302 INFO L82 PathProgramCache]: Analyzing trace with hash -845275759, now seen corresponding path program 1 times [2019-10-13 19:51:03,302 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:03,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802411567] [2019-10-13 19:51:03,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:03,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:03,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,430 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-13 19:51:03,430 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802411567] [2019-10-13 19:51:03,430 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:03,430 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:03,431 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376672619] [2019-10-13 19:51:03,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:03,431 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:03,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:03,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:03,432 INFO L87 Difference]: Start difference. First operand 1047 states and 1518 transitions. Second operand 3 states. [2019-10-13 19:51:03,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:03,617 INFO L93 Difference]: Finished difference Result 2591 states and 3764 transitions. [2019-10-13 19:51:03,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:03,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-10-13 19:51:03,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:03,628 INFO L225 Difference]: With dead ends: 2591 [2019-10-13 19:51:03,629 INFO L226 Difference]: Without dead ends: 1557 [2019-10-13 19:51:03,632 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,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2019-10-13 19:51:03,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1557. [2019-10-13 19:51:03,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1557 states. [2019-10-13 19:51:03,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2254 transitions. [2019-10-13 19:51:03,768 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2254 transitions. Word has length 194 [2019-10-13 19:51:03,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:03,769 INFO L462 AbstractCegarLoop]: Abstraction has 1557 states and 2254 transitions. [2019-10-13 19:51:03,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:03,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2254 transitions. [2019-10-13 19:51:03,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-13 19:51:03,777 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:03,777 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:03,778 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:03,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:03,778 INFO L82 PathProgramCache]: Analyzing trace with hash -977462684, now seen corresponding path program 1 times [2019-10-13 19:51:03,779 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:03,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845185820] [2019-10-13 19:51:03,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:03,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:03,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,903 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-13 19:51:03,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845185820] [2019-10-13 19:51:03,904 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:03,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:03,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048344789] [2019-10-13 19:51:03,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:03,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:03,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:03,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:03,908 INFO L87 Difference]: Start difference. First operand 1557 states and 2254 transitions. Second operand 3 states. [2019-10-13 19:51:04,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:04,152 INFO L93 Difference]: Finished difference Result 3612 states and 5237 transitions. [2019-10-13 19:51:04,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:04,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-10-13 19:51:04,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:04,163 INFO L225 Difference]: With dead ends: 3612 [2019-10-13 19:51:04,164 INFO L226 Difference]: Without dead ends: 2068 [2019-10-13 19:51:04,169 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,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2019-10-13 19:51:04,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 2068. [2019-10-13 19:51:04,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2068 states. [2019-10-13 19:51:04,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 2068 states and 2991 transitions. [2019-10-13 19:51:04,282 INFO L78 Accepts]: Start accepts. Automaton has 2068 states and 2991 transitions. Word has length 195 [2019-10-13 19:51:04,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:04,282 INFO L462 AbstractCegarLoop]: Abstraction has 2068 states and 2991 transitions. [2019-10-13 19:51:04,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:04,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2991 transitions. [2019-10-13 19:51:04,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-10-13 19:51:04,292 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:04,292 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,292 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:04,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:04,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1729777908, now seen corresponding path program 1 times [2019-10-13 19:51:04,294 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:04,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174545956] [2019-10-13 19:51:04,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:04,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:04,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 719 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-10-13 19:51:04,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174545956] [2019-10-13 19:51:04,466 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:04,466 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:04,467 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897903041] [2019-10-13 19:51:04,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:04,469 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:04,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:04,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:04,469 INFO L87 Difference]: Start difference. First operand 2068 states and 2991 transitions. Second operand 3 states. [2019-10-13 19:51:04,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:04,710 INFO L93 Difference]: Finished difference Result 5698 states and 8235 transitions. [2019-10-13 19:51:04,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:04,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 344 [2019-10-13 19:51:04,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:04,728 INFO L225 Difference]: With dead ends: 5698 [2019-10-13 19:51:04,729 INFO L226 Difference]: Without dead ends: 3643 [2019-10-13 19:51:04,734 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,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2019-10-13 19:51:04,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3641. [2019-10-13 19:51:04,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3641 states. [2019-10-13 19:51:04,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 5251 transitions. [2019-10-13 19:51:04,947 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 5251 transitions. Word has length 344 [2019-10-13 19:51:04,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:04,948 INFO L462 AbstractCegarLoop]: Abstraction has 3641 states and 5251 transitions. [2019-10-13 19:51:04,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:04,948 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 5251 transitions. [2019-10-13 19:51:04,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-10-13 19:51:04,961 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:04,961 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:04,962 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:04,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:04,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1198848905, now seen corresponding path program 1 times [2019-10-13 19:51:04,962 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:04,963 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843101211] [2019-10-13 19:51:04,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:04,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:04,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 851 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2019-10-13 19:51:05,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843101211] [2019-10-13 19:51:05,129 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:05,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:05,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953893169] [2019-10-13 19:51:05,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:05,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:05,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:05,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:05,133 INFO L87 Difference]: Start difference. First operand 3641 states and 5251 transitions. Second operand 3 states. [2019-10-13 19:51:05,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:05,417 INFO L93 Difference]: Finished difference Result 7429 states and 10741 transitions. [2019-10-13 19:51:05,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:05,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 381 [2019-10-13 19:51:05,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:05,430 INFO L225 Difference]: With dead ends: 7429 [2019-10-13 19:51:05,430 INFO L226 Difference]: Without dead ends: 2504 [2019-10-13 19:51:05,441 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:05,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2019-10-13 19:51:05,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2504. [2019-10-13 19:51:05,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2019-10-13 19:51:05,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3558 transitions. [2019-10-13 19:51:05,565 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3558 transitions. Word has length 381 [2019-10-13 19:51:05,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:05,565 INFO L462 AbstractCegarLoop]: Abstraction has 2504 states and 3558 transitions. [2019-10-13 19:51:05,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:05,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3558 transitions. [2019-10-13 19:51:05,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-10-13 19:51:05,582 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:05,583 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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, 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,583 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:05,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:05,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1350004073, now seen corresponding path program 1 times [2019-10-13 19:51:05,584 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:05,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731764254] [2019-10-13 19:51:05,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:05,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:05,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-10-13 19:51:05,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731764254] [2019-10-13 19:51:05,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14907139] [2019-10-13 19:51:05,835 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:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:05,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:06,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 850 proven. 0 refuted. 0 times theorem prover too weak. 1154 trivial. 0 not checked. [2019-10-13 19:51:06,202 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:51:06,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:51:06,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242146847] [2019-10-13 19:51:06,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:06,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:06,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:06,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:06,203 INFO L87 Difference]: Start difference. First operand 2504 states and 3558 transitions. Second operand 3 states. [2019-10-13 19:51:06,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:06,279 INFO L93 Difference]: Finished difference Result 2564 states and 3644 transitions. [2019-10-13 19:51:06,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:06,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 447 [2019-10-13 19:51:06,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:06,290 INFO L225 Difference]: With dead ends: 2564 [2019-10-13 19:51:06,290 INFO L226 Difference]: Without dead ends: 2075 [2019-10-13 19:51:06,292 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 449 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:06,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2019-10-13 19:51:06,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 2017. [2019-10-13 19:51:06,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2017 states. [2019-10-13 19:51:06,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 2866 transitions. [2019-10-13 19:51:06,383 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 2866 transitions. Word has length 447 [2019-10-13 19:51:06,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:06,383 INFO L462 AbstractCegarLoop]: Abstraction has 2017 states and 2866 transitions. [2019-10-13 19:51:06,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:06,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2866 transitions. [2019-10-13 19:51:06,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-10-13 19:51:06,394 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:06,395 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,607 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:06,607 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:06,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:06,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1991023065, now seen corresponding path program 1 times [2019-10-13 19:51:06,608 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:06,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453835450] [2019-10-13 19:51:06,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:06,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:06,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-10-13 19:51:06,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453835450] [2019-10-13 19:51:06,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978070249] [2019-10-13 19:51:06,781 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:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:06,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:07,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 582 proven. 0 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2019-10-13 19:51:07,104 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:51:07,104 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:51:07,104 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859551183] [2019-10-13 19:51:07,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:07,105 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:07,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:07,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:07,106 INFO L87 Difference]: Start difference. First operand 2017 states and 2866 transitions. Second operand 3 states. [2019-10-13 19:51:07,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:07,259 INFO L93 Difference]: Finished difference Result 4490 states and 6393 transitions. [2019-10-13 19:51:07,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:07,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 447 [2019-10-13 19:51:07,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:07,286 INFO L225 Difference]: With dead ends: 4490 [2019-10-13 19:51:07,290 INFO L226 Difference]: Without dead ends: 2486 [2019-10-13 19:51:07,299 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 449 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:07,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2019-10-13 19:51:07,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2486. [2019-10-13 19:51:07,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2486 states. [2019-10-13 19:51:07,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 3534 transitions. [2019-10-13 19:51:07,416 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 3534 transitions. Word has length 447 [2019-10-13 19:51:07,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:07,417 INFO L462 AbstractCegarLoop]: Abstraction has 2486 states and 3534 transitions. [2019-10-13 19:51:07,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:07,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 3534 transitions. [2019-10-13 19:51:07,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2019-10-13 19:51:07,431 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:07,431 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,635 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:07,636 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:07,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:07,636 INFO L82 PathProgramCache]: Analyzing trace with hash -213147291, now seen corresponding path program 1 times [2019-10-13 19:51:07,636 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:07,636 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265574883] [2019-10-13 19:51:07,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:07,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:07,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-10-13 19:51:07,847 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265574883] [2019-10-13 19:51:07,847 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525144527] [2019-10-13 19:51:07,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:07,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:08,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 865 proven. 0 refuted. 0 times theorem prover too weak. 1139 trivial. 0 not checked. [2019-10-13 19:51:08,101 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:51:08,101 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:51:08,102 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914987666] [2019-10-13 19:51:08,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:08,102 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:08,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:08,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:08,103 INFO L87 Difference]: Start difference. First operand 2486 states and 3534 transitions. Second operand 3 states. [2019-10-13 19:51:08,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:08,283 INFO L93 Difference]: Finished difference Result 5468 states and 7781 transitions. [2019-10-13 19:51:08,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:08,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 448 [2019-10-13 19:51:08,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:08,291 INFO L225 Difference]: With dead ends: 5468 [2019-10-13 19:51:08,292 INFO L226 Difference]: Without dead ends: 2995 [2019-10-13 19:51:08,297 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:08,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2019-10-13 19:51:08,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2995. [2019-10-13 19:51:08,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2995 states. [2019-10-13 19:51:08,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2995 states to 2995 states and 4254 transitions. [2019-10-13 19:51:08,425 INFO L78 Accepts]: Start accepts. Automaton has 2995 states and 4254 transitions. Word has length 448 [2019-10-13 19:51:08,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:08,426 INFO L462 AbstractCegarLoop]: Abstraction has 2995 states and 4254 transitions. [2019-10-13 19:51:08,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:08,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2995 states and 4254 transitions. [2019-10-13 19:51:08,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2019-10-13 19:51:08,434 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:08,435 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:08,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:08,643 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:08,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:08,643 INFO L82 PathProgramCache]: Analyzing trace with hash -915884239, now seen corresponding path program 1 times [2019-10-13 19:51:08,643 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:08,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140298605] [2019-10-13 19:51:08,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:08,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:08,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:08,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-10-13 19:51:08,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140298605] [2019-10-13 19:51:08,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203723456] [2019-10-13 19:51:08,813 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,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:08,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:08,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1051 proven. 0 refuted. 0 times theorem prover too weak. 953 trivial. 0 not checked. [2019-10-13 19:51:09,153 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:51:09,153 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:51:09,153 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572862172] [2019-10-13 19:51:09,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:09,155 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:09,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:09,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:09,156 INFO L87 Difference]: Start difference. First operand 2995 states and 4254 transitions. Second operand 3 states. [2019-10-13 19:51:09,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:09,321 INFO L93 Difference]: Finished difference Result 6445 states and 9168 transitions. [2019-10-13 19:51:09,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:09,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 449 [2019-10-13 19:51:09,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:09,329 INFO L225 Difference]: With dead ends: 6445 [2019-10-13 19:51:09,329 INFO L226 Difference]: Without dead ends: 3463 [2019-10-13 19:51:09,335 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 451 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:09,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3463 states. [2019-10-13 19:51:09,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3463 to 3463. [2019-10-13 19:51:09,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3463 states. [2019-10-13 19:51:09,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3463 states to 3463 states and 4921 transitions. [2019-10-13 19:51:09,477 INFO L78 Accepts]: Start accepts. Automaton has 3463 states and 4921 transitions. Word has length 449 [2019-10-13 19:51:09,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:09,478 INFO L462 AbstractCegarLoop]: Abstraction has 3463 states and 4921 transitions. [2019-10-13 19:51:09,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:09,478 INFO L276 IsEmpty]: Start isEmpty. Operand 3463 states and 4921 transitions. [2019-10-13 19:51:09,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2019-10-13 19:51:09,488 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:09,489 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 9, 9, 9, 9, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:09,693 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:09,694 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:09,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:09,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1109132628, now seen corresponding path program 1 times [2019-10-13 19:51:09,694 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:09,694 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149347819] [2019-10-13 19:51:09,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:09,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:09,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:10,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-10-13 19:51:10,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149347819] [2019-10-13 19:51:10,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862332464] [2019-10-13 19:51:10,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:10,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:10,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:10,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-10-13 19:51:10,480 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:51:10,480 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-13 19:51:10,480 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52717472] [2019-10-13 19:51:10,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:51:10,484 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:10,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:51:10,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:51:10,485 INFO L87 Difference]: Start difference. First operand 3463 states and 4921 transitions. Second operand 4 states. [2019-10-13 19:51:10,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:10,824 INFO L93 Difference]: Finished difference Result 6908 states and 9816 transitions. [2019-10-13 19:51:10,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:10,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 600 [2019-10-13 19:51:10,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:10,832 INFO L225 Difference]: With dead ends: 6908 [2019-10-13 19:51:10,832 INFO L226 Difference]: Without dead ends: 3381 [2019-10-13 19:51:10,840 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 604 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:10,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3381 states. [2019-10-13 19:51:10,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3381 to 3104. [2019-10-13 19:51:10,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2019-10-13 19:51:10,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 4254 transitions. [2019-10-13 19:51:10,964 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 4254 transitions. Word has length 600 [2019-10-13 19:51:10,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:10,968 INFO L462 AbstractCegarLoop]: Abstraction has 3104 states and 4254 transitions. [2019-10-13 19:51:10,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:51:10,968 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 4254 transitions. [2019-10-13 19:51:10,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1021 [2019-10-13 19:51:10,981 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:10,982 INFO L380 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 29, 29, 28, 28, 27, 27, 26, 26, 26, 26, 22, 18, 18, 14, 14, 10, 10, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:11,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:11,190 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:11,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:11,191 INFO L82 PathProgramCache]: Analyzing trace with hash 859855159, now seen corresponding path program 1 times [2019-10-13 19:51:11,191 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:11,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530653226] [2019-10-13 19:51:11,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:11,192 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:11,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:11,931 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2019-10-13 19:51:11,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530653226] [2019-10-13 19:51:11,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68283318] [2019-10-13 19:51:11,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:12,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 1517 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:12,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:12,588 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2019-10-13 19:51:12,588 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:51:12,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-13 19:51:12,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129728709] [2019-10-13 19:51:12,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:51:12,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:12,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:51:12,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:51:12,590 INFO L87 Difference]: Start difference. First operand 3104 states and 4254 transitions. Second operand 4 states. [2019-10-13 19:51:12,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:12,916 INFO L93 Difference]: Finished difference Result 7213 states and 9946 transitions. [2019-10-13 19:51:12,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:51:12,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1020 [2019-10-13 19:51:12,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:12,925 INFO L225 Difference]: With dead ends: 7213 [2019-10-13 19:51:12,925 INFO L226 Difference]: Without dead ends: 3944 [2019-10-13 19:51:12,931 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1027 GetRequests, 1024 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:12,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3944 states. [2019-10-13 19:51:13,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3944 to 3104. [2019-10-13 19:51:13,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2019-10-13 19:51:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 4254 transitions. [2019-10-13 19:51:13,060 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 4254 transitions. Word has length 1020 [2019-10-13 19:51:13,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:13,060 INFO L462 AbstractCegarLoop]: Abstraction has 3104 states and 4254 transitions. [2019-10-13 19:51:13,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:51:13,060 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 4254 transitions. [2019-10-13 19:51:13,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1271 [2019-10-13 19:51:13,075 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:13,076 INFO L380 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 43, 43, 40, 40, 40, 36, 36, 32, 32, 28, 28, 24, 24, 24, 24, 20, 16, 16, 12, 12, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:51:13,276 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:13,277 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:13,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:13,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1521228414, now seen corresponding path program 1 times [2019-10-13 19:51:13,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:13,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678631073] [2019-10-13 19:51:13,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:13,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:13,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:14,135 INFO L134 CoverageAnalysis]: Checked inductivity of 19529 backedges. 8440 proven. 0 refuted. 0 times theorem prover too weak. 11089 trivial. 0 not checked. [2019-10-13 19:51:14,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678631073] [2019-10-13 19:51:14,136 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:14,136 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:14,136 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646701808] [2019-10-13 19:51:14,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:14,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:14,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:14,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:14,142 INFO L87 Difference]: Start difference. First operand 3104 states and 4254 transitions. Second operand 3 states. [2019-10-13 19:51:14,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:14,370 INFO L93 Difference]: Finished difference Result 6339 states and 8682 transitions. [2019-10-13 19:51:14,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:14,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1270 [2019-10-13 19:51:14,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:14,377 INFO L225 Difference]: With dead ends: 6339 [2019-10-13 19:51:14,378 INFO L226 Difference]: Without dead ends: 3230 [2019-10-13 19:51:14,383 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:14,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2019-10-13 19:51:14,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 3160. [2019-10-13 19:51:14,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3160 states. [2019-10-13 19:51:14,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3160 states to 3160 states and 4313 transitions. [2019-10-13 19:51:14,544 INFO L78 Accepts]: Start accepts. Automaton has 3160 states and 4313 transitions. Word has length 1270 [2019-10-13 19:51:14,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:14,545 INFO L462 AbstractCegarLoop]: Abstraction has 3160 states and 4313 transitions. [2019-10-13 19:51:14,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:14,546 INFO L276 IsEmpty]: Start isEmpty. Operand 3160 states and 4313 transitions. [2019-10-13 19:51:14,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1301 [2019-10-13 19:51:14,579 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:14,580 INFO L380 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 45, 45, 44, 44, 44, 44, 44, 44, 40, 40, 40, 36, 36, 32, 32, 28, 28, 24, 24, 24, 24, 20, 16, 16, 12, 12, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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:51:14,580 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:14,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:14,581 INFO L82 PathProgramCache]: Analyzing trace with hash 492000992, now seen corresponding path program 1 times [2019-10-13 19:51:14,581 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:14,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985188965] [2019-10-13 19:51:14,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:14,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:14,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:15,792 INFO L134 CoverageAnalysis]: Checked inductivity of 20156 backedges. 8432 proven. 0 refuted. 0 times theorem prover too weak. 11724 trivial. 0 not checked. [2019-10-13 19:51:15,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985188965] [2019-10-13 19:51:15,792 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:15,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:15,793 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524519996] [2019-10-13 19:51:15,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:15,794 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:15,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:15,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:15,794 INFO L87 Difference]: Start difference. First operand 3160 states and 4313 transitions. Second operand 3 states. [2019-10-13 19:51:15,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:15,958 INFO L93 Difference]: Finished difference Result 4167 states and 5676 transitions. [2019-10-13 19:51:15,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:15,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1300 [2019-10-13 19:51:15,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:15,965 INFO L225 Difference]: With dead ends: 4167 [2019-10-13 19:51:15,965 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 19:51:15,971 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:15,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 19:51:15,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 19:51:15,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 19:51:15,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 19:51:15,972 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1300 [2019-10-13 19:51:15,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:15,973 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 19:51:15,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:15,973 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 19:51:15,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 19:51:15,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 19:51:16,250 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 160 [2019-10-13 19:51:17,326 WARN L191 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 195 [2019-10-13 19:51:17,778 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 166 [2019-10-13 19:51:18,206 WARN L191 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 195 [2019-10-13 19:51:20,123 WARN L191 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 154 DAG size of output: 123 [2019-10-13 19:51:21,701 WARN L191 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 147 DAG size of output: 121