java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_4.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:49:45,513 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:49:45,515 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:49:45,526 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:49:45,527 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:49:45,528 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:49:45,529 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:49:45,531 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:49:45,536 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:49:45,537 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:49:45,538 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:49:45,539 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:49:45,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:49:45,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:49:45,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:49:45,553 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:49:45,554 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:49:45,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:49:45,559 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:49:45,563 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:49:45,567 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:49:45,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:49:45,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:49:45,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:49:45,576 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:49:45,576 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:49:45,576 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:49:45,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:49:45,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:49:45,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:49:45,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:49:45,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:49:45,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:49:45,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:49:45,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:49:45,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:49:45,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:49:45,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:49:45,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:49:45,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:49:45,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:49:45,586 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:49:45,607 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:49:45,607 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:49:45,608 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:49:45,608 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:49:45,609 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:49:45,609 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:49:45,609 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:49:45,609 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:49:45,609 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:49:45,610 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:49:45,610 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:49:45,610 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:49:45,610 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:49:45,610 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:49:45,611 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:49:45,611 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:49:45,611 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:49:45,611 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:49:45,611 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:49:45,612 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:49:45,612 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:49:45,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:49:45,612 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:49:45,613 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:49:45,613 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:49:45,613 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:49:45,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:49:45,613 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:49:45,613 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:49:45,922 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:49:45,944 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:49:45,948 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:49:45,950 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:49:45,950 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:49:45,951 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_4.cil.c [2019-10-14 23:49:46,018 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4239e704c/9af685c3318d4e1b8c2cc14c517a8ca4/FLAG7034bb73d [2019-10-14 23:49:46,568 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:49:46,569 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_4.cil.c [2019-10-14 23:49:46,594 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4239e704c/9af685c3318d4e1b8c2cc14c517a8ca4/FLAG7034bb73d [2019-10-14 23:49:46,930 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4239e704c/9af685c3318d4e1b8c2cc14c517a8ca4 [2019-10-14 23:49:46,941 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:49:46,943 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:49:46,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:49:46,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:49:46,948 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:49:46,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:49:46" (1/1) ... [2019-10-14 23:49:46,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d996306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:46, skipping insertion in model container [2019-10-14 23:49:46,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:49:46" (1/1) ... [2019-10-14 23:49:46,960 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:49:47,018 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:49:47,301 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:49:47,306 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:49:47,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:49:47,491 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:49:47,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:47 WrapperNode [2019-10-14 23:49:47,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:49:47,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:49:47,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:49:47,493 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:49:47,504 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:47" (1/1) ... [2019-10-14 23:49:47,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:47" (1/1) ... [2019-10-14 23:49:47,515 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:47" (1/1) ... [2019-10-14 23:49:47,515 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:47" (1/1) ... [2019-10-14 23:49:47,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:47" (1/1) ... [2019-10-14 23:49:47,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:47" (1/1) ... [2019-10-14 23:49:47,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:47" (1/1) ... [2019-10-14 23:49:47,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:49:47,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:49:47,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:49:47,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:49:47,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:49:47,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:49:47,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:49:47,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-14 23:49:47,625 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:49:47,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:49:47,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-14 23:49:47,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:49:47,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-14 23:49:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-14 23:49:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-14 23:49:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:49:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:49:47,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:49:47,843 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-14 23:49:48,442 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-14 23:49:48,443 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-14 23:49:48,445 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:49:48,446 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:49:48,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:49:48 BoogieIcfgContainer [2019-10-14 23:49:48,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:49:48,448 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:49:48,449 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:49:48,452 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:49:48,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:49:46" (1/3) ... [2019-10-14 23:49:48,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48233b01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:49:48, skipping insertion in model container [2019-10-14 23:49:48,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:47" (2/3) ... [2019-10-14 23:49:48,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48233b01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:49:48, skipping insertion in model container [2019-10-14 23:49:48,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:49:48" (3/3) ... [2019-10-14 23:49:48,456 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_4.cil.c [2019-10-14 23:49:48,467 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:49:48,476 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:49:48,487 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:49:48,516 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:49:48,516 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:49:48,517 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:49:48,517 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:49:48,517 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:49:48,517 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:49:48,517 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:49:48,517 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:49:48,540 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-10-14 23:49:48,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-14 23:49:48,548 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:48,549 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:48,551 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:48,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:48,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1127072202, now seen corresponding path program 1 times [2019-10-14 23:49:48,564 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:48,564 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544583394] [2019-10-14 23:49:48,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:48,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:48,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:48,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:48,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544583394] [2019-10-14 23:49:48,860 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:48,860 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:48,861 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38748767] [2019-10-14 23:49:48,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:48,869 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:48,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:48,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:48,888 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 5 states. [2019-10-14 23:49:49,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:49,379 INFO L93 Difference]: Finished difference Result 337 states and 574 transitions. [2019-10-14 23:49:49,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:49,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-14 23:49:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:49,397 INFO L225 Difference]: With dead ends: 337 [2019-10-14 23:49:49,397 INFO L226 Difference]: Without dead ends: 180 [2019-10-14 23:49:49,402 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:49,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-14 23:49:49,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2019-10-14 23:49:49,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-14 23:49:49,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 280 transitions. [2019-10-14 23:49:49,485 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 280 transitions. Word has length 49 [2019-10-14 23:49:49,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:49,485 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 280 transitions. [2019-10-14 23:49:49,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:49,486 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 280 transitions. [2019-10-14 23:49:49,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-14 23:49:49,491 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:49,491 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:49,491 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:49,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:49,492 INFO L82 PathProgramCache]: Analyzing trace with hash 572375021, now seen corresponding path program 1 times [2019-10-14 23:49:49,494 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:49,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679691602] [2019-10-14 23:49:49,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:49,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:49,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:49,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:49,692 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679691602] [2019-10-14 23:49:49,692 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:49,692 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:49,692 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429027898] [2019-10-14 23:49:49,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:49,695 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:49,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:49,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:49,695 INFO L87 Difference]: Start difference. First operand 175 states and 280 transitions. Second operand 5 states. [2019-10-14 23:49:49,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:49,988 INFO L93 Difference]: Finished difference Result 385 states and 629 transitions. [2019-10-14 23:49:49,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:49,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-14 23:49:49,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:49,992 INFO L225 Difference]: With dead ends: 385 [2019-10-14 23:49:49,993 INFO L226 Difference]: Without dead ends: 221 [2019-10-14 23:49:49,995 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:49,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-10-14 23:49:50,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2019-10-14 23:49:50,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-14 23:49:50,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 357 transitions. [2019-10-14 23:49:50,037 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 357 transitions. Word has length 50 [2019-10-14 23:49:50,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:50,038 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 357 transitions. [2019-10-14 23:49:50,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:50,038 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 357 transitions. [2019-10-14 23:49:50,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-14 23:49:50,045 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:50,048 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:50,048 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:50,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:50,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1550770299, now seen corresponding path program 1 times [2019-10-14 23:49:50,049 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:50,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305245860] [2019-10-14 23:49:50,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:50,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:50,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:50,233 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:50,234 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305245860] [2019-10-14 23:49:50,234 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:50,235 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:50,235 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886087343] [2019-10-14 23:49:50,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:50,243 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:50,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:50,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:50,245 INFO L87 Difference]: Start difference. First operand 216 states and 357 transitions. Second operand 5 states. [2019-10-14 23:49:50,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:50,528 INFO L93 Difference]: Finished difference Result 450 states and 755 transitions. [2019-10-14 23:49:50,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:50,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-14 23:49:50,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:50,531 INFO L225 Difference]: With dead ends: 450 [2019-10-14 23:49:50,531 INFO L226 Difference]: Without dead ends: 247 [2019-10-14 23:49:50,533 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:50,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-14 23:49:50,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-10-14 23:49:50,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-10-14 23:49:50,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 413 transitions. [2019-10-14 23:49:50,549 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 413 transitions. Word has length 77 [2019-10-14 23:49:50,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:50,550 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 413 transitions. [2019-10-14 23:49:50,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:50,550 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 413 transitions. [2019-10-14 23:49:50,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-14 23:49:50,552 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:50,552 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:50,552 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:50,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:50,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1202289061, now seen corresponding path program 1 times [2019-10-14 23:49:50,553 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:50,553 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146072953] [2019-10-14 23:49:50,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:50,554 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:50,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:50,672 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:50,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146072953] [2019-10-14 23:49:50,672 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:50,673 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:50,673 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183855299] [2019-10-14 23:49:50,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:50,674 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:50,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:50,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:50,675 INFO L87 Difference]: Start difference. First operand 247 states and 413 transitions. Second operand 5 states. [2019-10-14 23:49:50,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:50,884 INFO L93 Difference]: Finished difference Result 498 states and 837 transitions. [2019-10-14 23:49:50,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:50,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-14 23:49:50,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:50,886 INFO L225 Difference]: With dead ends: 498 [2019-10-14 23:49:50,887 INFO L226 Difference]: Without dead ends: 264 [2019-10-14 23:49:50,888 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:50,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-10-14 23:49:50,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-10-14 23:49:50,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-10-14 23:49:50,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 436 transitions. [2019-10-14 23:49:50,903 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 436 transitions. Word has length 89 [2019-10-14 23:49:50,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:50,904 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 436 transitions. [2019-10-14 23:49:50,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:50,904 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 436 transitions. [2019-10-14 23:49:50,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-14 23:49:50,906 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:50,906 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:50,906 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:50,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:50,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1597952639, now seen corresponding path program 1 times [2019-10-14 23:49:50,907 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:50,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371378228] [2019-10-14 23:49:50,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:50,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:50,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:50,978 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:50,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371378228] [2019-10-14 23:49:50,979 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:50,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:50,980 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316318837] [2019-10-14 23:49:50,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:50,981 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:50,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:50,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:50,981 INFO L87 Difference]: Start difference. First operand 262 states and 436 transitions. Second operand 5 states. [2019-10-14 23:49:51,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:51,240 INFO L93 Difference]: Finished difference Result 558 states and 938 transitions. [2019-10-14 23:49:51,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:51,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-14 23:49:51,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:51,243 INFO L225 Difference]: With dead ends: 558 [2019-10-14 23:49:51,244 INFO L226 Difference]: Without dead ends: 309 [2019-10-14 23:49:51,245 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:51,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-10-14 23:49:51,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 304. [2019-10-14 23:49:51,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-14 23:49:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 510 transitions. [2019-10-14 23:49:51,264 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 510 transitions. Word has length 89 [2019-10-14 23:49:51,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:51,264 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 510 transitions. [2019-10-14 23:49:51,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:51,264 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 510 transitions. [2019-10-14 23:49:51,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-14 23:49:51,267 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:51,267 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:51,268 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:51,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:51,268 INFO L82 PathProgramCache]: Analyzing trace with hash -2044645757, now seen corresponding path program 1 times [2019-10-14 23:49:51,268 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:51,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730165917] [2019-10-14 23:49:51,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,373 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:51,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730165917] [2019-10-14 23:49:51,375 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:51,375 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:51,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750824309] [2019-10-14 23:49:51,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:51,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:51,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:51,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:51,377 INFO L87 Difference]: Start difference. First operand 304 states and 510 transitions. Second operand 5 states. [2019-10-14 23:49:51,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:51,561 INFO L93 Difference]: Finished difference Result 597 states and 1005 transitions. [2019-10-14 23:49:51,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:51,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-14 23:49:51,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:51,568 INFO L225 Difference]: With dead ends: 597 [2019-10-14 23:49:51,568 INFO L226 Difference]: Without dead ends: 306 [2019-10-14 23:49:51,569 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:51,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-14 23:49:51,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-10-14 23:49:51,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-14 23:49:51,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 506 transitions. [2019-10-14 23:49:51,591 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 506 transitions. Word has length 90 [2019-10-14 23:49:51,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:51,591 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 506 transitions. [2019-10-14 23:49:51,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:51,592 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 506 transitions. [2019-10-14 23:49:51,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-14 23:49:51,593 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:51,593 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:51,594 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:51,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:51,594 INFO L82 PathProgramCache]: Analyzing trace with hash -176213692, now seen corresponding path program 1 times [2019-10-14 23:49:51,594 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:51,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233574457] [2019-10-14 23:49:51,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:51,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233574457] [2019-10-14 23:49:51,678 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:51,678 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:51,678 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13165504] [2019-10-14 23:49:51,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:51,679 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:51,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:51,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:51,679 INFO L87 Difference]: Start difference. First operand 304 states and 506 transitions. Second operand 5 states. [2019-10-14 23:49:51,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:51,914 INFO L93 Difference]: Finished difference Result 600 states and 1002 transitions. [2019-10-14 23:49:51,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:51,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-14 23:49:51,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:51,917 INFO L225 Difference]: With dead ends: 600 [2019-10-14 23:49:51,917 INFO L226 Difference]: Without dead ends: 307 [2019-10-14 23:49:51,918 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:51,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-10-14 23:49:51,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 302. [2019-10-14 23:49:51,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-10-14 23:49:51,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 501 transitions. [2019-10-14 23:49:51,931 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 501 transitions. Word has length 90 [2019-10-14 23:49:51,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:51,932 INFO L462 AbstractCegarLoop]: Abstraction has 302 states and 501 transitions. [2019-10-14 23:49:51,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:51,932 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 501 transitions. [2019-10-14 23:49:51,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-14 23:49:51,933 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:51,933 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:51,934 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:51,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:51,934 INFO L82 PathProgramCache]: Analyzing trace with hash -690895868, now seen corresponding path program 1 times [2019-10-14 23:49:51,934 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:51,935 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553536943] [2019-10-14 23:49:51,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,985 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-14 23:49:51,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553536943] [2019-10-14 23:49:51,986 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:51,986 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:51,986 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468596965] [2019-10-14 23:49:51,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:51,987 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:51,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:51,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:51,988 INFO L87 Difference]: Start difference. First operand 302 states and 501 transitions. Second operand 5 states. [2019-10-14 23:49:52,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:52,162 INFO L93 Difference]: Finished difference Result 600 states and 997 transitions. [2019-10-14 23:49:52,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:52,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-14 23:49:52,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:52,164 INFO L225 Difference]: With dead ends: 600 [2019-10-14 23:49:52,165 INFO L226 Difference]: Without dead ends: 311 [2019-10-14 23:49:52,166 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:52,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-10-14 23:49:52,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2019-10-14 23:49:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-10-14 23:49:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 507 transitions. [2019-10-14 23:49:52,179 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 507 transitions. Word has length 102 [2019-10-14 23:49:52,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:52,180 INFO L462 AbstractCegarLoop]: Abstraction has 311 states and 507 transitions. [2019-10-14 23:49:52,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:52,180 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 507 transitions. [2019-10-14 23:49:52,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-14 23:49:52,181 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:52,182 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:52,182 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:52,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:52,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1568096766, now seen corresponding path program 1 times [2019-10-14 23:49:52,182 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:52,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027258411] [2019-10-14 23:49:52,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:52,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:52,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:52,237 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:52,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027258411] [2019-10-14 23:49:52,238 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:52,238 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:52,238 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822283206] [2019-10-14 23:49:52,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:52,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:52,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:52,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:52,239 INFO L87 Difference]: Start difference. First operand 311 states and 507 transitions. Second operand 5 states. [2019-10-14 23:49:52,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:52,554 INFO L93 Difference]: Finished difference Result 640 states and 1050 transitions. [2019-10-14 23:49:52,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:52,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-14 23:49:52,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:52,557 INFO L225 Difference]: With dead ends: 640 [2019-10-14 23:49:52,557 INFO L226 Difference]: Without dead ends: 342 [2019-10-14 23:49:52,558 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:52,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-14 23:49:52,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-10-14 23:49:52,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-14 23:49:52,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 554 transitions. [2019-10-14 23:49:52,576 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 554 transitions. Word has length 103 [2019-10-14 23:49:52,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:52,577 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 554 transitions. [2019-10-14 23:49:52,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:52,577 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 554 transitions. [2019-10-14 23:49:52,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-14 23:49:52,579 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:52,579 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:52,580 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:52,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:52,580 INFO L82 PathProgramCache]: Analyzing trace with hash -314967930, now seen corresponding path program 1 times [2019-10-14 23:49:52,580 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:52,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180265459] [2019-10-14 23:49:52,581 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:52,581 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:52,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:52,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:52,667 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:52,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180265459] [2019-10-14 23:49:52,668 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:52,668 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:52,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752300187] [2019-10-14 23:49:52,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:52,669 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:52,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:52,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:52,669 INFO L87 Difference]: Start difference. First operand 340 states and 554 transitions. Second operand 5 states. [2019-10-14 23:49:52,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:52,903 INFO L93 Difference]: Finished difference Result 669 states and 1093 transitions. [2019-10-14 23:49:52,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:52,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-14 23:49:52,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:52,906 INFO L225 Difference]: With dead ends: 669 [2019-10-14 23:49:52,906 INFO L226 Difference]: Without dead ends: 342 [2019-10-14 23:49:52,907 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:52,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-14 23:49:52,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-10-14 23:49:52,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-14 23:49:52,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 550 transitions. [2019-10-14 23:49:52,921 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 550 transitions. Word has length 104 [2019-10-14 23:49:52,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:52,922 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 550 transitions. [2019-10-14 23:49:52,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:52,922 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 550 transitions. [2019-10-14 23:49:52,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:49:52,923 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:52,924 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:52,924 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:52,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:52,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1055150734, now seen corresponding path program 1 times [2019-10-14 23:49:52,924 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:52,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792852515] [2019-10-14 23:49:52,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:52,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:52,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:52,986 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:52,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792852515] [2019-10-14 23:49:52,987 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:52,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:52,987 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453936138] [2019-10-14 23:49:52,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:52,988 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:52,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:52,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:52,988 INFO L87 Difference]: Start difference. First operand 340 states and 550 transitions. Second operand 5 states. [2019-10-14 23:49:53,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:53,185 INFO L93 Difference]: Finished difference Result 702 states and 1143 transitions. [2019-10-14 23:49:53,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:53,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-14 23:49:53,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:53,189 INFO L225 Difference]: With dead ends: 702 [2019-10-14 23:49:53,189 INFO L226 Difference]: Without dead ends: 375 [2019-10-14 23:49:53,191 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:53,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-14 23:49:53,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-10-14 23:49:53,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-14 23:49:53,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 592 transitions. [2019-10-14 23:49:53,205 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 592 transitions. Word has length 105 [2019-10-14 23:49:53,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:53,206 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 592 transitions. [2019-10-14 23:49:53,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:53,206 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 592 transitions. [2019-10-14 23:49:53,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-14 23:49:53,208 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:53,208 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:53,208 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:53,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:53,209 INFO L82 PathProgramCache]: Analyzing trace with hash -2124208522, now seen corresponding path program 1 times [2019-10-14 23:49:53,209 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:53,209 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173102855] [2019-10-14 23:49:53,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,264 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:53,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173102855] [2019-10-14 23:49:53,264 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:53,264 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:53,265 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698031493] [2019-10-14 23:49:53,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:53,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:53,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:53,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:53,266 INFO L87 Difference]: Start difference. First operand 367 states and 592 transitions. Second operand 5 states. [2019-10-14 23:49:53,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:53,495 INFO L93 Difference]: Finished difference Result 729 states and 1180 transitions. [2019-10-14 23:49:53,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:53,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-14 23:49:53,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:53,498 INFO L225 Difference]: With dead ends: 729 [2019-10-14 23:49:53,498 INFO L226 Difference]: Without dead ends: 375 [2019-10-14 23:49:53,500 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:53,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-14 23:49:53,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-10-14 23:49:53,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-14 23:49:53,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 587 transitions. [2019-10-14 23:49:53,516 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 587 transitions. Word has length 106 [2019-10-14 23:49:53,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:53,517 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 587 transitions. [2019-10-14 23:49:53,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:53,517 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 587 transitions. [2019-10-14 23:49:53,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-14 23:49:53,519 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:53,519 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:53,519 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:53,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:53,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1027752783, now seen corresponding path program 1 times [2019-10-14 23:49:53,520 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:53,522 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009707850] [2019-10-14 23:49:53,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,581 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-14 23:49:53,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009707850] [2019-10-14 23:49:53,582 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:53,582 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:53,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781402536] [2019-10-14 23:49:53,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:53,583 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:53,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:53,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:53,584 INFO L87 Difference]: Start difference. First operand 367 states and 587 transitions. Second operand 5 states. [2019-10-14 23:49:53,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:53,776 INFO L93 Difference]: Finished difference Result 746 states and 1198 transitions. [2019-10-14 23:49:53,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:53,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-10-14 23:49:53,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:53,780 INFO L225 Difference]: With dead ends: 746 [2019-10-14 23:49:53,780 INFO L226 Difference]: Without dead ends: 392 [2019-10-14 23:49:53,781 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:53,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-10-14 23:49:53,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2019-10-14 23:49:53,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-14 23:49:53,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 616 transitions. [2019-10-14 23:49:53,803 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 616 transitions. Word has length 110 [2019-10-14 23:49:53,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:53,804 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 616 transitions. [2019-10-14 23:49:53,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:53,804 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 616 transitions. [2019-10-14 23:49:53,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-14 23:49:53,806 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:53,807 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:53,807 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:53,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:53,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1923701177, now seen corresponding path program 1 times [2019-10-14 23:49:53,808 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:53,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011284547] [2019-10-14 23:49:53,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,867 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-14 23:49:53,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011284547] [2019-10-14 23:49:53,868 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:53,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:53,868 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621111176] [2019-10-14 23:49:53,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:53,869 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:53,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:53,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:53,870 INFO L87 Difference]: Start difference. First operand 388 states and 616 transitions. Second operand 5 states. [2019-10-14 23:49:54,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:54,086 INFO L93 Difference]: Finished difference Result 767 states and 1221 transitions. [2019-10-14 23:49:54,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:54,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-10-14 23:49:54,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:54,090 INFO L225 Difference]: With dead ends: 767 [2019-10-14 23:49:54,090 INFO L226 Difference]: Without dead ends: 392 [2019-10-14 23:49:54,091 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:54,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-10-14 23:49:54,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2019-10-14 23:49:54,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-14 23:49:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 610 transitions. [2019-10-14 23:49:54,112 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 610 transitions. Word has length 111 [2019-10-14 23:49:54,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:54,112 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 610 transitions. [2019-10-14 23:49:54,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:54,112 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 610 transitions. [2019-10-14 23:49:54,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-14 23:49:54,114 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:54,115 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:54,115 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:54,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:54,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1132457392, now seen corresponding path program 1 times [2019-10-14 23:49:54,116 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:54,116 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952323512] [2019-10-14 23:49:54,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-14 23:49:54,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952323512] [2019-10-14 23:49:54,199 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:54,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:54,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145088841] [2019-10-14 23:49:54,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:54,200 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:54,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:54,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:54,200 INFO L87 Difference]: Start difference. First operand 388 states and 610 transitions. Second operand 3 states. [2019-10-14 23:49:54,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:54,249 INFO L93 Difference]: Finished difference Result 763 states and 1203 transitions. [2019-10-14 23:49:54,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:54,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-10-14 23:49:54,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:54,253 INFO L225 Difference]: With dead ends: 763 [2019-10-14 23:49:54,254 INFO L226 Difference]: Without dead ends: 761 [2019-10-14 23:49:54,254 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:54,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-10-14 23:49:54,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2019-10-14 23:49:54,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-10-14 23:49:54,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1201 transitions. [2019-10-14 23:49:54,284 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1201 transitions. Word has length 126 [2019-10-14 23:49:54,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:54,285 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 1201 transitions. [2019-10-14 23:49:54,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:54,285 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1201 transitions. [2019-10-14 23:49:54,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-14 23:49:54,287 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:54,288 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:54,288 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:54,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:54,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1143263811, now seen corresponding path program 1 times [2019-10-14 23:49:54,289 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:54,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019767022] [2019-10-14 23:49:54,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,337 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-14 23:49:54,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019767022] [2019-10-14 23:49:54,337 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:54,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:54,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105253420] [2019-10-14 23:49:54,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:54,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:54,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:54,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:54,339 INFO L87 Difference]: Start difference. First operand 761 states and 1201 transitions. Second operand 3 states. [2019-10-14 23:49:54,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:54,397 INFO L93 Difference]: Finished difference Result 1837 states and 2905 transitions. [2019-10-14 23:49:54,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:54,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-14 23:49:54,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:54,403 INFO L225 Difference]: With dead ends: 1837 [2019-10-14 23:49:54,403 INFO L226 Difference]: Without dead ends: 1089 [2019-10-14 23:49:54,405 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:54,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2019-10-14 23:49:54,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1089. [2019-10-14 23:49:54,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089 states. [2019-10-14 23:49:54,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1718 transitions. [2019-10-14 23:49:54,448 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1718 transitions. Word has length 127 [2019-10-14 23:49:54,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:54,448 INFO L462 AbstractCegarLoop]: Abstraction has 1089 states and 1718 transitions. [2019-10-14 23:49:54,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:54,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1718 transitions. [2019-10-14 23:49:54,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-14 23:49:54,451 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:54,452 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:54,452 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:54,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:54,452 INFO L82 PathProgramCache]: Analyzing trace with hash 733219007, now seen corresponding path program 1 times [2019-10-14 23:49:54,453 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:54,453 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147201137] [2019-10-14 23:49:54,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-14 23:49:54,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147201137] [2019-10-14 23:49:54,489 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:54,490 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:54,490 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201781532] [2019-10-14 23:49:54,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:54,490 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:54,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:54,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:54,491 INFO L87 Difference]: Start difference. First operand 1089 states and 1718 transitions. Second operand 3 states. [2019-10-14 23:49:54,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:54,567 INFO L93 Difference]: Finished difference Result 2534 states and 4005 transitions. [2019-10-14 23:49:54,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:54,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-14 23:49:54,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:54,575 INFO L225 Difference]: With dead ends: 2534 [2019-10-14 23:49:54,575 INFO L226 Difference]: Without dead ends: 1458 [2019-10-14 23:49:54,578 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:54,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2019-10-14 23:49:54,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1458. [2019-10-14 23:49:54,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1458 states. [2019-10-14 23:49:54,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 2300 transitions. [2019-10-14 23:49:54,674 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 2300 transitions. Word has length 127 [2019-10-14 23:49:54,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:54,674 INFO L462 AbstractCegarLoop]: Abstraction has 1458 states and 2300 transitions. [2019-10-14 23:49:54,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:54,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 2300 transitions. [2019-10-14 23:49:54,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-14 23:49:54,678 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:54,678 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:54,678 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:54,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:54,679 INFO L82 PathProgramCache]: Analyzing trace with hash 2122513021, now seen corresponding path program 1 times [2019-10-14 23:49:54,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:54,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540577414] [2019-10-14 23:49:54,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,714 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-14 23:49:54,714 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540577414] [2019-10-14 23:49:54,714 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:54,715 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:54,715 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675753977] [2019-10-14 23:49:54,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:54,715 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:54,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:54,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:54,716 INFO L87 Difference]: Start difference. First operand 1458 states and 2300 transitions. Second operand 3 states. [2019-10-14 23:49:54,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:54,803 INFO L93 Difference]: Finished difference Result 3254 states and 5138 transitions. [2019-10-14 23:49:54,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:54,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-14 23:49:54,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:54,814 INFO L225 Difference]: With dead ends: 3254 [2019-10-14 23:49:54,814 INFO L226 Difference]: Without dead ends: 1809 [2019-10-14 23:49:54,817 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:54,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2019-10-14 23:49:54,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2019-10-14 23:49:54,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1809 states. [2019-10-14 23:49:54,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2851 transitions. [2019-10-14 23:49:54,903 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2851 transitions. Word has length 127 [2019-10-14 23:49:54,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:54,903 INFO L462 AbstractCegarLoop]: Abstraction has 1809 states and 2851 transitions. [2019-10-14 23:49:54,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:54,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2851 transitions. [2019-10-14 23:49:54,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-14 23:49:54,911 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:54,911 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:54,912 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:54,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:54,912 INFO L82 PathProgramCache]: Analyzing trace with hash 913291395, now seen corresponding path program 1 times [2019-10-14 23:49:54,912 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:54,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381594715] [2019-10-14 23:49:54,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,913 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,993 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-14 23:49:54,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381594715] [2019-10-14 23:49:54,994 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:54,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:54,994 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853354655] [2019-10-14 23:49:54,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:54,996 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:54,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:54,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:54,997 INFO L87 Difference]: Start difference. First operand 1809 states and 2851 transitions. Second operand 3 states. [2019-10-14 23:49:55,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:55,244 INFO L93 Difference]: Finished difference Result 3655 states and 5745 transitions. [2019-10-14 23:49:55,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:55,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-10-14 23:49:55,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:55,255 INFO L225 Difference]: With dead ends: 3655 [2019-10-14 23:49:55,256 INFO L226 Difference]: Without dead ends: 1859 [2019-10-14 23:49:55,260 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:55,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2019-10-14 23:49:55,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1809. [2019-10-14 23:49:55,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1809 states. [2019-10-14 23:49:55,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2779 transitions. [2019-10-14 23:49:55,375 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2779 transitions. Word has length 204 [2019-10-14 23:49:55,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:55,375 INFO L462 AbstractCegarLoop]: Abstraction has 1809 states and 2779 transitions. [2019-10-14 23:49:55,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:55,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2779 transitions. [2019-10-14 23:49:55,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-14 23:49:55,384 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:55,385 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:55,385 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:55,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:55,385 INFO L82 PathProgramCache]: Analyzing trace with hash -555522276, now seen corresponding path program 1 times [2019-10-14 23:49:55,386 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:55,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629744336] [2019-10-14 23:49:55,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:55,460 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-14 23:49:55,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629744336] [2019-10-14 23:49:55,460 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:55,461 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:55,461 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079063306] [2019-10-14 23:49:55,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:55,462 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:55,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:55,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:55,462 INFO L87 Difference]: Start difference. First operand 1809 states and 2779 transitions. Second operand 3 states. [2019-10-14 23:49:55,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:55,702 INFO L93 Difference]: Finished difference Result 3704 states and 5669 transitions. [2019-10-14 23:49:55,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:55,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-10-14 23:49:55,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:55,713 INFO L225 Difference]: With dead ends: 3704 [2019-10-14 23:49:55,714 INFO L226 Difference]: Without dead ends: 1908 [2019-10-14 23:49:55,718 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:55,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2019-10-14 23:49:55,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1815. [2019-10-14 23:49:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1815 states. [2019-10-14 23:49:55,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 2712 transitions. [2019-10-14 23:49:55,797 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 2712 transitions. Word has length 218 [2019-10-14 23:49:55,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:55,797 INFO L462 AbstractCegarLoop]: Abstraction has 1815 states and 2712 transitions. [2019-10-14 23:49:55,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:55,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2712 transitions. [2019-10-14 23:49:55,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-14 23:49:55,803 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:55,803 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:55,804 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:55,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:55,804 INFO L82 PathProgramCache]: Analyzing trace with hash 2121219740, now seen corresponding path program 1 times [2019-10-14 23:49:55,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:55,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126891147] [2019-10-14 23:49:55,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:55,937 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-14 23:49:55,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126891147] [2019-10-14 23:49:55,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427332702] [2019-10-14 23:49:55,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:49:56,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:56,170 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-14 23:49:56,171 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:49:56,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:49:56,178 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159447026] [2019-10-14 23:49:56,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:49:56,179 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:56,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:49:56,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:49:56,180 INFO L87 Difference]: Start difference. First operand 1815 states and 2712 transitions. Second operand 4 states. [2019-10-14 23:49:56,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:56,591 INFO L93 Difference]: Finished difference Result 4312 states and 6397 transitions. [2019-10-14 23:49:56,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:56,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2019-10-14 23:49:56,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:56,604 INFO L225 Difference]: With dead ends: 4312 [2019-10-14 23:49:56,605 INFO L226 Difference]: Without dead ends: 2483 [2019-10-14 23:49:56,609 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:56,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2019-10-14 23:49:56,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 1641. [2019-10-14 23:49:56,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1641 states. [2019-10-14 23:49:56,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2418 transitions. [2019-10-14 23:49:56,709 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2418 transitions. Word has length 237 [2019-10-14 23:49:56,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:56,710 INFO L462 AbstractCegarLoop]: Abstraction has 1641 states and 2418 transitions. [2019-10-14 23:49:56,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:49:56,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2418 transitions. [2019-10-14 23:49:56,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-14 23:49:56,717 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:56,718 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:56,924 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:56,924 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:56,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:56,925 INFO L82 PathProgramCache]: Analyzing trace with hash 499648914, now seen corresponding path program 1 times [2019-10-14 23:49:56,925 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:56,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767934775] [2019-10-14 23:49:56,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:56,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:56,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:57,041 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-10-14 23:49:57,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767934775] [2019-10-14 23:49:57,042 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:57,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:57,042 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54062862] [2019-10-14 23:49:57,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:57,045 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:57,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:57,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:57,045 INFO L87 Difference]: Start difference. First operand 1641 states and 2418 transitions. Second operand 3 states. [2019-10-14 23:49:57,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:57,271 INFO L93 Difference]: Finished difference Result 3442 states and 5085 transitions. [2019-10-14 23:49:57,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:57,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-10-14 23:49:57,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:57,281 INFO L225 Difference]: With dead ends: 3442 [2019-10-14 23:49:57,281 INFO L226 Difference]: Without dead ends: 1726 [2019-10-14 23:49:57,286 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:57,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-10-14 23:49:57,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1716. [2019-10-14 23:49:57,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1716 states. [2019-10-14 23:49:57,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2483 transitions. [2019-10-14 23:49:57,360 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2483 transitions. Word has length 246 [2019-10-14 23:49:57,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:57,360 INFO L462 AbstractCegarLoop]: Abstraction has 1716 states and 2483 transitions. [2019-10-14 23:49:57,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:57,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2483 transitions. [2019-10-14 23:49:57,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-14 23:49:57,366 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:57,367 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:57,367 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:57,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:57,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1931626416, now seen corresponding path program 1 times [2019-10-14 23:49:57,368 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:57,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300635445] [2019-10-14 23:49:57,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:57,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:57,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:57,455 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-14 23:49:57,455 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300635445] [2019-10-14 23:49:57,456 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688442501] [2019-10-14 23:49:57,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:57,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:49:57,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:57,694 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-14 23:49:57,694 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:49:57,695 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:49:57,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305489128] [2019-10-14 23:49:57,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:49:57,696 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:57,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:49:57,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:49:57,697 INFO L87 Difference]: Start difference. First operand 1716 states and 2483 transitions. Second operand 4 states. [2019-10-14 23:49:58,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:58,125 INFO L93 Difference]: Finished difference Result 5367 states and 7801 transitions. [2019-10-14 23:49:58,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:58,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2019-10-14 23:49:58,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:58,142 INFO L225 Difference]: With dead ends: 5367 [2019-10-14 23:49:58,143 INFO L226 Difference]: Without dead ends: 3696 [2019-10-14 23:49:58,146 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:58,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3696 states. [2019-10-14 23:49:58,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3696 to 2041. [2019-10-14 23:49:58,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2041 states. [2019-10-14 23:49:58,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2041 states to 2041 states and 2785 transitions. [2019-10-14 23:49:58,234 INFO L78 Accepts]: Start accepts. Automaton has 2041 states and 2785 transitions. Word has length 258 [2019-10-14 23:49:58,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:58,234 INFO L462 AbstractCegarLoop]: Abstraction has 2041 states and 2785 transitions. [2019-10-14 23:49:58,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:49:58,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2041 states and 2785 transitions. [2019-10-14 23:49:58,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-14 23:49:58,240 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:58,240 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:58,445 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:58,446 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:58,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:58,447 INFO L82 PathProgramCache]: Analyzing trace with hash -2074521490, now seen corresponding path program 1 times [2019-10-14 23:49:58,447 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:58,448 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744643438] [2019-10-14 23:49:58,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:58,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:58,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,538 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-10-14 23:49:58,538 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744643438] [2019-10-14 23:49:58,538 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:58,539 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:58,539 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866565584] [2019-10-14 23:49:58,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:58,540 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:58,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:58,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:58,540 INFO L87 Difference]: Start difference. First operand 2041 states and 2785 transitions. Second operand 3 states. [2019-10-14 23:49:58,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:58,737 INFO L93 Difference]: Finished difference Result 5779 states and 7920 transitions. [2019-10-14 23:49:58,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:58,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-10-14 23:49:58,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:58,781 INFO L225 Difference]: With dead ends: 5779 [2019-10-14 23:49:58,781 INFO L226 Difference]: Without dead ends: 3783 [2019-10-14 23:49:58,788 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:58,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3783 states. [2019-10-14 23:49:58,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 3781. [2019-10-14 23:49:58,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3781 states. [2019-10-14 23:49:58,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3781 states to 3781 states and 5190 transitions. [2019-10-14 23:49:58,991 INFO L78 Accepts]: Start accepts. Automaton has 3781 states and 5190 transitions. Word has length 258 [2019-10-14 23:49:58,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:58,992 INFO L462 AbstractCegarLoop]: Abstraction has 3781 states and 5190 transitions. [2019-10-14 23:49:58,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:58,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3781 states and 5190 transitions. [2019-10-14 23:49:59,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-14 23:49:59,006 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:59,006 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:59,006 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:59,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:59,007 INFO L82 PathProgramCache]: Analyzing trace with hash -381613367, now seen corresponding path program 1 times [2019-10-14 23:49:59,007 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:59,007 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35860727] [2019-10-14 23:49:59,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,094 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-14 23:49:59,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35860727] [2019-10-14 23:49:59,095 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:59,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:59,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967273685] [2019-10-14 23:49:59,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:59,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:59,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:59,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:59,096 INFO L87 Difference]: Start difference. First operand 3781 states and 5190 transitions. Second operand 3 states. [2019-10-14 23:49:59,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:59,380 INFO L93 Difference]: Finished difference Result 7745 states and 10622 transitions. [2019-10-14 23:49:59,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:59,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-10-14 23:49:59,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:59,391 INFO L225 Difference]: With dead ends: 7745 [2019-10-14 23:49:59,391 INFO L226 Difference]: Without dead ends: 4009 [2019-10-14 23:49:59,400 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:59,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2019-10-14 23:49:59,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 3781. [2019-10-14 23:49:59,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3781 states. [2019-10-14 23:49:59,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3781 states to 3781 states and 5086 transitions. [2019-10-14 23:49:59,574 INFO L78 Accepts]: Start accepts. Automaton has 3781 states and 5086 transitions. Word has length 261 [2019-10-14 23:49:59,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:59,575 INFO L462 AbstractCegarLoop]: Abstraction has 3781 states and 5086 transitions. [2019-10-14 23:49:59,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:59,575 INFO L276 IsEmpty]: Start isEmpty. Operand 3781 states and 5086 transitions. [2019-10-14 23:49:59,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-10-14 23:49:59,590 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:59,590 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:59,590 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:59,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:59,591 INFO L82 PathProgramCache]: Analyzing trace with hash 281332617, now seen corresponding path program 1 times [2019-10-14 23:49:59,591 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:59,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444958123] [2019-10-14 23:49:59,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,728 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2019-10-14 23:49:59,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444958123] [2019-10-14 23:49:59,729 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:59,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:59,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272079325] [2019-10-14 23:49:59,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:59,730 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:59,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:59,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:59,731 INFO L87 Difference]: Start difference. First operand 3781 states and 5086 transitions. Second operand 3 states. [2019-10-14 23:49:59,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:59,986 INFO L93 Difference]: Finished difference Result 7649 states and 10286 transitions. [2019-10-14 23:49:59,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:59,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 295 [2019-10-14 23:49:59,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:59,995 INFO L225 Difference]: With dead ends: 7649 [2019-10-14 23:49:59,995 INFO L226 Difference]: Without dead ends: 3913 [2019-10-14 23:50:00,003 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:00,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3913 states. [2019-10-14 23:50:00,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3913 to 3873. [2019-10-14 23:50:00,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3873 states. [2019-10-14 23:50:00,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3873 states to 3873 states and 5198 transitions. [2019-10-14 23:50:00,145 INFO L78 Accepts]: Start accepts. Automaton has 3873 states and 5198 transitions. Word has length 295 [2019-10-14 23:50:00,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:00,146 INFO L462 AbstractCegarLoop]: Abstraction has 3873 states and 5198 transitions. [2019-10-14 23:50:00,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:00,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3873 states and 5198 transitions. [2019-10-14 23:50:00,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-10-14 23:50:00,157 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:00,157 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:00,158 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:00,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:00,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1099840201, now seen corresponding path program 1 times [2019-10-14 23:50:00,158 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:00,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575660418] [2019-10-14 23:50:00,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:00,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:00,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,245 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2019-10-14 23:50:00,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575660418] [2019-10-14 23:50:00,245 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:00,245 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:00,246 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252112943] [2019-10-14 23:50:00,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:00,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:00,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:00,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:00,247 INFO L87 Difference]: Start difference. First operand 3873 states and 5198 transitions. Second operand 3 states. [2019-10-14 23:50:00,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:00,587 INFO L93 Difference]: Finished difference Result 8081 states and 10908 transitions. [2019-10-14 23:50:00,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:00,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-10-14 23:50:00,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:00,597 INFO L225 Difference]: With dead ends: 8081 [2019-10-14 23:50:00,598 INFO L226 Difference]: Without dead ends: 4253 [2019-10-14 23:50:00,609 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:00,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4253 states. [2019-10-14 23:50:00,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4253 to 4123. [2019-10-14 23:50:00,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4123 states. [2019-10-14 23:50:00,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4123 states to 4123 states and 5498 transitions. [2019-10-14 23:50:00,821 INFO L78 Accepts]: Start accepts. Automaton has 4123 states and 5498 transitions. Word has length 316 [2019-10-14 23:50:00,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:00,822 INFO L462 AbstractCegarLoop]: Abstraction has 4123 states and 5498 transitions. [2019-10-14 23:50:00,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:00,822 INFO L276 IsEmpty]: Start isEmpty. Operand 4123 states and 5498 transitions. [2019-10-14 23:50:00,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-10-14 23:50:00,834 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:00,834 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:00,835 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:00,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:00,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1319175701, now seen corresponding path program 1 times [2019-10-14 23:50:00,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:00,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779374454] [2019-10-14 23:50:00,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:00,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:00,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,959 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-10-14 23:50:00,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779374454] [2019-10-14 23:50:00,960 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:00,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:00,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865664429] [2019-10-14 23:50:00,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:00,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:00,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:00,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:00,961 INFO L87 Difference]: Start difference. First operand 4123 states and 5498 transitions. Second operand 3 states. [2019-10-14 23:50:01,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:01,158 INFO L93 Difference]: Finished difference Result 6892 states and 9075 transitions. [2019-10-14 23:50:01,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:01,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-10-14 23:50:01,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:01,163 INFO L225 Difference]: With dead ends: 6892 [2019-10-14 23:50:01,164 INFO L226 Difference]: Without dead ends: 2170 [2019-10-14 23:50:01,174 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:01,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2019-10-14 23:50:01,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 2170. [2019-10-14 23:50:01,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2019-10-14 23:50:01,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 2829 transitions. [2019-10-14 23:50:01,250 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 2829 transitions. Word has length 326 [2019-10-14 23:50:01,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:01,250 INFO L462 AbstractCegarLoop]: Abstraction has 2170 states and 2829 transitions. [2019-10-14 23:50:01,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:01,250 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2829 transitions. [2019-10-14 23:50:01,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-10-14 23:50:01,256 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:01,257 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:01,257 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:01,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:01,257 INFO L82 PathProgramCache]: Analyzing trace with hash -231239372, now seen corresponding path program 1 times [2019-10-14 23:50:01,258 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:01,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976171654] [2019-10-14 23:50:01,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:01,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:01,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:01,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-14 23:50:01,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976171654] [2019-10-14 23:50:01,378 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:01,379 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:01,379 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066629859] [2019-10-14 23:50:01,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:01,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:01,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:01,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:01,383 INFO L87 Difference]: Start difference. First operand 2170 states and 2829 transitions. Second operand 3 states. [2019-10-14 23:50:01,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:01,556 INFO L93 Difference]: Finished difference Result 4335 states and 5656 transitions. [2019-10-14 23:50:01,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:01,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 342 [2019-10-14 23:50:01,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:01,561 INFO L225 Difference]: With dead ends: 4335 [2019-10-14 23:50:01,561 INFO L226 Difference]: Without dead ends: 2210 [2019-10-14 23:50:01,566 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:01,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2019-10-14 23:50:01,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 2170. [2019-10-14 23:50:01,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2019-10-14 23:50:01,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 2789 transitions. [2019-10-14 23:50:01,636 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 2789 transitions. Word has length 342 [2019-10-14 23:50:01,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:01,637 INFO L462 AbstractCegarLoop]: Abstraction has 2170 states and 2789 transitions. [2019-10-14 23:50:01,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:01,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2789 transitions. [2019-10-14 23:50:01,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-10-14 23:50:01,642 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:01,643 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:01,643 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:01,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:01,643 INFO L82 PathProgramCache]: Analyzing trace with hash -516641400, now seen corresponding path program 1 times [2019-10-14 23:50:01,643 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:01,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096217002] [2019-10-14 23:50:01,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:01,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:01,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:01,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-10-14 23:50:01,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096217002] [2019-10-14 23:50:01,759 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:01,759 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:01,759 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832183811] [2019-10-14 23:50:01,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:01,760 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:01,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:01,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:01,761 INFO L87 Difference]: Start difference. First operand 2170 states and 2789 transitions. Second operand 3 states. [2019-10-14 23:50:01,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:01,954 INFO L93 Difference]: Finished difference Result 4305 states and 5521 transitions. [2019-10-14 23:50:01,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:01,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 365 [2019-10-14 23:50:01,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:01,959 INFO L225 Difference]: With dead ends: 4305 [2019-10-14 23:50:01,960 INFO L226 Difference]: Without dead ends: 2180 [2019-10-14 23:50:01,965 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:01,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2019-10-14 23:50:02,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2170. [2019-10-14 23:50:02,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2019-10-14 23:50:02,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 2749 transitions. [2019-10-14 23:50:02,036 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 2749 transitions. Word has length 365 [2019-10-14 23:50:02,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:02,036 INFO L462 AbstractCegarLoop]: Abstraction has 2170 states and 2749 transitions. [2019-10-14 23:50:02,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:02,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2749 transitions. [2019-10-14 23:50:02,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-10-14 23:50:02,042 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:02,042 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:02,043 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:02,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:02,043 INFO L82 PathProgramCache]: Analyzing trace with hash -753815824, now seen corresponding path program 1 times [2019-10-14 23:50:02,047 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:02,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777396297] [2019-10-14 23:50:02,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:02,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:02,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-10-14 23:50:02,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777396297] [2019-10-14 23:50:02,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77735359] [2019-10-14 23:50:02,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:02,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:02,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2019-10-14 23:50:02,469 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:02,469 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:50:02,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467198241] [2019-10-14 23:50:02,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:02,470 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:02,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:02,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:02,471 INFO L87 Difference]: Start difference. First operand 2170 states and 2749 transitions. Second operand 3 states. [2019-10-14 23:50:02,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:02,545 INFO L93 Difference]: Finished difference Result 2748 states and 3503 transitions. [2019-10-14 23:50:02,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:02,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 398 [2019-10-14 23:50:02,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:02,550 INFO L225 Difference]: With dead ends: 2748 [2019-10-14 23:50:02,551 INFO L226 Difference]: Without dead ends: 2610 [2019-10-14 23:50:02,552 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:02,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2019-10-14 23:50:02,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2034. [2019-10-14 23:50:02,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2034 states. [2019-10-14 23:50:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 2595 transitions. [2019-10-14 23:50:02,636 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 2595 transitions. Word has length 398 [2019-10-14 23:50:02,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:02,637 INFO L462 AbstractCegarLoop]: Abstraction has 2034 states and 2595 transitions. [2019-10-14 23:50:02,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:02,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2595 transitions. [2019-10-14 23:50:02,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2019-10-14 23:50:02,644 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:02,644 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:02,850 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:02,851 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:02,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:02,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1467408517, now seen corresponding path program 1 times [2019-10-14 23:50:02,852 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:02,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812566979] [2019-10-14 23:50:02,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:02,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:02,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:03,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-10-14 23:50:03,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812566979] [2019-10-14 23:50:03,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926657309] [2019-10-14 23:50:03,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:03,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:03,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:03,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2019-10-14 23:50:03,268 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:50:03,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:50:03,269 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315425063] [2019-10-14 23:50:03,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:50:03,270 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:03,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:50:03,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:50:03,270 INFO L87 Difference]: Start difference. First operand 2034 states and 2595 transitions. Second operand 4 states. [2019-10-14 23:50:03,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:03,664 INFO L93 Difference]: Finished difference Result 5073 states and 6483 transitions. [2019-10-14 23:50:03,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:03,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 414 [2019-10-14 23:50:03,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:03,671 INFO L225 Difference]: With dead ends: 5073 [2019-10-14 23:50:03,671 INFO L226 Difference]: Without dead ends: 3042 [2019-10-14 23:50:03,676 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:03,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2019-10-14 23:50:03,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 2194. [2019-10-14 23:50:03,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2194 states. [2019-10-14 23:50:03,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2194 states to 2194 states and 2815 transitions. [2019-10-14 23:50:03,757 INFO L78 Accepts]: Start accepts. Automaton has 2194 states and 2815 transitions. Word has length 414 [2019-10-14 23:50:03,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:03,758 INFO L462 AbstractCegarLoop]: Abstraction has 2194 states and 2815 transitions. [2019-10-14 23:50:03,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:50:03,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2194 states and 2815 transitions. [2019-10-14 23:50:03,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2019-10-14 23:50:03,765 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:03,765 INFO L380 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 8, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:03,970 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:03,971 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:03,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:03,972 INFO L82 PathProgramCache]: Analyzing trace with hash 591946799, now seen corresponding path program 1 times [2019-10-14 23:50:03,972 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:03,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159666317] [2019-10-14 23:50:03,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:03,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:03,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2337 backedges. 1323 proven. 0 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2019-10-14 23:50:04,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159666317] [2019-10-14 23:50:04,206 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:04,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:04,207 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439866339] [2019-10-14 23:50:04,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:04,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:04,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:04,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:04,208 INFO L87 Difference]: Start difference. First operand 2194 states and 2815 transitions. Second operand 3 states. [2019-10-14 23:50:04,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:04,464 INFO L93 Difference]: Finished difference Result 4523 states and 5818 transitions. [2019-10-14 23:50:04,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:04,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 476 [2019-10-14 23:50:04,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:04,475 INFO L225 Difference]: With dead ends: 4523 [2019-10-14 23:50:04,475 INFO L226 Difference]: Without dead ends: 2374 [2019-10-14 23:50:04,481 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:04,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2374 states. [2019-10-14 23:50:04,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2374 to 2364. [2019-10-14 23:50:04,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2364 states. [2019-10-14 23:50:04,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 3010 transitions. [2019-10-14 23:50:04,578 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 3010 transitions. Word has length 476 [2019-10-14 23:50:04,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:04,578 INFO L462 AbstractCegarLoop]: Abstraction has 2364 states and 3010 transitions. [2019-10-14 23:50:04,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:04,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 3010 transitions. [2019-10-14 23:50:04,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2019-10-14 23:50:04,587 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:04,587 INFO L380 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:04,588 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:04,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:04,588 INFO L82 PathProgramCache]: Analyzing trace with hash -957066491, now seen corresponding path program 1 times [2019-10-14 23:50:04,588 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:04,589 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563914318] [2019-10-14 23:50:04,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:04,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:04,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3102 backedges. 1760 proven. 0 refuted. 0 times theorem prover too weak. 1342 trivial. 0 not checked. [2019-10-14 23:50:04,828 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563914318] [2019-10-14 23:50:04,828 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:04,828 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:04,828 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127656214] [2019-10-14 23:50:04,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:04,829 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:04,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:04,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:04,829 INFO L87 Difference]: Start difference. First operand 2364 states and 3010 transitions. Second operand 3 states. [2019-10-14 23:50:05,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:05,034 INFO L93 Difference]: Finished difference Result 4680 states and 5945 transitions. [2019-10-14 23:50:05,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:05,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 538 [2019-10-14 23:50:05,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:05,040 INFO L225 Difference]: With dead ends: 4680 [2019-10-14 23:50:05,040 INFO L226 Difference]: Without dead ends: 2361 [2019-10-14 23:50:05,044 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:05,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2019-10-14 23:50:05,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 2359. [2019-10-14 23:50:05,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2359 states. [2019-10-14 23:50:05,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 2940 transitions. [2019-10-14 23:50:05,124 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 2940 transitions. Word has length 538 [2019-10-14 23:50:05,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:05,125 INFO L462 AbstractCegarLoop]: Abstraction has 2359 states and 2940 transitions. [2019-10-14 23:50:05,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:05,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 2940 transitions. [2019-10-14 23:50:05,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2019-10-14 23:50:05,135 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:05,135 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:05,135 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:05,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:05,136 INFO L82 PathProgramCache]: Analyzing trace with hash -995203399, now seen corresponding path program 1 times [2019-10-14 23:50:05,136 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:05,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372985235] [2019-10-14 23:50:05,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:05,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:05,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-10-14 23:50:05,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372985235] [2019-10-14 23:50:05,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984119213] [2019-10-14 23:50:05,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 961 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:05,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-10-14 23:50:05,716 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:50:05,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:50:05,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309912137] [2019-10-14 23:50:05,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:50:05,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:05,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:50:05,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:50:05,718 INFO L87 Difference]: Start difference. First operand 2359 states and 2940 transitions. Second operand 4 states. [2019-10-14 23:50:05,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:05,940 INFO L93 Difference]: Finished difference Result 3954 states and 4950 transitions. [2019-10-14 23:50:05,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:50:05,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 604 [2019-10-14 23:50:05,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:05,945 INFO L225 Difference]: With dead ends: 3954 [2019-10-14 23:50:05,945 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:50:05,952 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 608 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:05,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:50:05,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:50:05,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:50:05,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:50:05,953 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 604 [2019-10-14 23:50:05,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:05,953 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:50:05,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:50:05,953 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:50:05,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:50:06,159 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:06,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:50:06,278 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 116 [2019-10-14 23:50:06,712 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 114 [2019-10-14 23:50:07,810 WARN L191 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 368 DAG size of output: 229 [2019-10-14 23:50:08,745 WARN L191 SmtUtils]: Spent 788.00 ms on a formula simplification. DAG size of input: 369 DAG size of output: 228 [2019-10-14 23:50:10,284 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 113 DAG size of output: 67 [2019-10-14 23:50:11,037 WARN L191 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 69 [2019-10-14 23:50:11,529 WARN L191 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 66 [2019-10-14 23:50:12,123 WARN L191 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2019-10-14 23:50:12,700 WARN L191 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 65 [2019-10-14 23:50:13,606 WARN L191 SmtUtils]: Spent 902.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 66 [2019-10-14 23:50:14,756 WARN L191 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 106 DAG size of output: 59 [2019-10-14 23:50:18,984 WARN L191 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 193 DAG size of output: 118 [2019-10-14 23:50:19,964 WARN L191 SmtUtils]: Spent 978.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 67 [2019-10-14 23:50:20,686 WARN L191 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 81