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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_8.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:49:07,110 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:49:07,112 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:49:07,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:49:07,125 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:49:07,126 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:49:07,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:49:07,129 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:49:07,131 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:49:07,132 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:49:07,133 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:49:07,135 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:49:07,135 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:49:07,136 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:49:07,137 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:49:07,139 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:49:07,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:49:07,141 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:49:07,143 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:49:07,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:49:07,147 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:49:07,148 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:49:07,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:49:07,150 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:49:07,153 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:49:07,153 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:49:07,154 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:49:07,155 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:49:07,155 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:49:07,156 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:49:07,156 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:49:07,157 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:49:07,158 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:49:07,159 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:49:07,160 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:49:07,160 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:49:07,161 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:49:07,161 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:49:07,161 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:49:07,162 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:49:07,163 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:49:07,163 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 05:49:07,179 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:49:07,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:49:07,180 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:49:07,180 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:49:07,181 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:49:07,181 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:49:07,181 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:49:07,181 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:49:07,181 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:49:07,182 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:49:07,182 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:49:07,183 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:49:07,183 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:49:07,183 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:49:07,183 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:49:07,183 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:49:07,184 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:49:07,184 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:49:07,184 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:49:07,185 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:49:07,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:49:07,186 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:49:07,186 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:49:07,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:49:07,187 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:49:07,187 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:49:07,187 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:49:07,188 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:49:07,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:49:07,188 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:49:07,241 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:49:07,257 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:49:07,261 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:49:07,262 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:49:07,262 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:49:07,263 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_8.cil.c [2019-09-09 05:49:07,335 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/293dea411/81cee79e66034499862230273a664365/FLAGd4fdb801c [2019-09-09 05:49:07,901 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:49:07,904 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_8.cil.c [2019-09-09 05:49:07,929 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/293dea411/81cee79e66034499862230273a664365/FLAGd4fdb801c [2019-09-09 05:49:08,160 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/293dea411/81cee79e66034499862230273a664365 [2019-09-09 05:49:08,172 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:49:08,173 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:49:08,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:49:08,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:49:08,180 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:49:08,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:49:08" (1/1) ... [2019-09-09 05:49:08,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70c2cca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:08, skipping insertion in model container [2019-09-09 05:49:08,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:49:08" (1/1) ... [2019-09-09 05:49:08,193 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:49:08,247 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:49:08,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:49:08,512 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:49:08,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:49:08,696 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:49:08,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:08 WrapperNode [2019-09-09 05:49:08,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:49:08,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:49:08,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:49:08,697 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:49:08,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:08" (1/1) ... [2019-09-09 05:49:08,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:08" (1/1) ... [2019-09-09 05:49:08,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:08" (1/1) ... [2019-09-09 05:49:08,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:08" (1/1) ... [2019-09-09 05:49:08,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:08" (1/1) ... [2019-09-09 05:49:08,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:08" (1/1) ... [2019-09-09 05:49:08,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:08" (1/1) ... [2019-09-09 05:49:08,754 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:49:08,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:49:08,755 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:49:08,755 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:49:08,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:08" (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-09-09 05:49:08,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:49:08,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:49:08,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-09 05:49:08,816 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:49:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:49:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-09 05:49:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:49:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:49:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-09 05:49:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-09 05:49:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:49:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:49:08,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:49:09,108 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:49:09,605 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-09-09 05:49:09,606 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-09-09 05:49:09,608 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:49:09,609 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:49:09,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:49:09 BoogieIcfgContainer [2019-09-09 05:49:09,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:49:09,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:49:09,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:49:09,615 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:49:09,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:49:08" (1/3) ... [2019-09-09 05:49:09,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d74c813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:49:09, skipping insertion in model container [2019-09-09 05:49:09,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:08" (2/3) ... [2019-09-09 05:49:09,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d74c813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:49:09, skipping insertion in model container [2019-09-09 05:49:09,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:49:09" (3/3) ... [2019-09-09 05:49:09,619 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_8.cil.c [2019-09-09 05:49:09,630 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:49:09,639 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:49:09,656 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:49:09,685 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:49:09,686 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:49:09,686 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:49:09,686 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:49:09,686 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:49:09,686 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:49:09,686 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:49:09,687 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:49:09,709 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2019-09-09 05:49:09,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-09 05:49:09,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:09,725 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:09,728 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:09,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:09,734 INFO L82 PathProgramCache]: Analyzing trace with hash -617772913, now seen corresponding path program 1 times [2019-09-09 05:49:09,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:09,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:09,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:09,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:09,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:10,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:10,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:10,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:49:10,032 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:10,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:49:10,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:49:10,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:10,060 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 5 states. [2019-09-09 05:49:10,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:10,530 INFO L93 Difference]: Finished difference Result 206 states and 347 transitions. [2019-09-09 05:49:10,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:10,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-09-09 05:49:10,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:10,548 INFO L225 Difference]: With dead ends: 206 [2019-09-09 05:49:10,548 INFO L226 Difference]: Without dead ends: 185 [2019-09-09 05:49:10,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-09 05:49:10,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-09-09 05:49:10,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 177. [2019-09-09 05:49:10,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-09 05:49:10,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 284 transitions. [2019-09-09 05:49:10,606 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 284 transitions. Word has length 47 [2019-09-09 05:49:10,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:10,607 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 284 transitions. [2019-09-09 05:49:10,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:49:10,607 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 284 transitions. [2019-09-09 05:49:10,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-09 05:49:10,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:10,610 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:10,611 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:10,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:10,611 INFO L82 PathProgramCache]: Analyzing trace with hash 401544370, now seen corresponding path program 1 times [2019-09-09 05:49:10,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:10,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:10,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:10,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:10,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:10,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:10,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:10,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:49:10,754 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:10,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:49:10,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:49:10,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:10,757 INFO L87 Difference]: Start difference. First operand 177 states and 284 transitions. Second operand 5 states. [2019-09-09 05:49:11,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:11,076 INFO L93 Difference]: Finished difference Result 224 states and 368 transitions. [2019-09-09 05:49:11,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:11,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-09-09 05:49:11,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:11,080 INFO L225 Difference]: With dead ends: 224 [2019-09-09 05:49:11,080 INFO L226 Difference]: Without dead ends: 224 [2019-09-09 05:49:11,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-09 05:49:11,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-09-09 05:49:11,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 216. [2019-09-09 05:49:11,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-09-09 05:49:11,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 357 transitions. [2019-09-09 05:49:11,099 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 357 transitions. Word has length 48 [2019-09-09 05:49:11,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:11,100 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 357 transitions. [2019-09-09 05:49:11,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:49:11,101 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 357 transitions. [2019-09-09 05:49:11,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-09 05:49:11,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:11,108 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:11,108 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:11,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:11,109 INFO L82 PathProgramCache]: Analyzing trace with hash 353705226, now seen corresponding path program 1 times [2019-09-09 05:49:11,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:11,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:11,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:11,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:11,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:11,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:11,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:49:11,239 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:11,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:49:11,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:49:11,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:11,240 INFO L87 Difference]: Start difference. First operand 216 states and 357 transitions. Second operand 5 states. [2019-09-09 05:49:11,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:11,512 INFO L93 Difference]: Finished difference Result 247 states and 413 transitions. [2019-09-09 05:49:11,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:11,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-09 05:49:11,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:11,515 INFO L225 Difference]: With dead ends: 247 [2019-09-09 05:49:11,515 INFO L226 Difference]: Without dead ends: 247 [2019-09-09 05:49:11,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-09 05:49:11,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-09-09 05:49:11,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-09-09 05:49:11,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-09 05:49:11,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 413 transitions. [2019-09-09 05:49:11,531 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 413 transitions. Word has length 75 [2019-09-09 05:49:11,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:11,531 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 413 transitions. [2019-09-09 05:49:11,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:49:11,532 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 413 transitions. [2019-09-09 05:49:11,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-09 05:49:11,535 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:11,535 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:11,536 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:11,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:11,536 INFO L82 PathProgramCache]: Analyzing trace with hash -668843297, now seen corresponding path program 1 times [2019-09-09 05:49:11,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:11,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:11,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:11,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:11,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:11,640 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:11,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:11,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:49:11,641 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:11,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:49:11,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:49:11,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:11,642 INFO L87 Difference]: Start difference. First operand 247 states and 413 transitions. Second operand 5 states. [2019-09-09 05:49:11,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:11,884 INFO L93 Difference]: Finished difference Result 285 states and 480 transitions. [2019-09-09 05:49:11,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:11,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-09-09 05:49:11,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:11,888 INFO L225 Difference]: With dead ends: 285 [2019-09-09 05:49:11,889 INFO L226 Difference]: Without dead ends: 285 [2019-09-09 05:49:11,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-09 05:49:11,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-09 05:49:11,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2019-09-09 05:49:11,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-09 05:49:11,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 478 transitions. [2019-09-09 05:49:11,926 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 478 transitions. Word has length 80 [2019-09-09 05:49:11,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:11,927 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 478 transitions. [2019-09-09 05:49:11,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:49:11,929 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 478 transitions. [2019-09-09 05:49:11,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-09 05:49:11,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:11,935 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:11,936 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:11,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:11,939 INFO L82 PathProgramCache]: Analyzing trace with hash 293568124, now seen corresponding path program 1 times [2019-09-09 05:49:11,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:11,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:11,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:11,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:11,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:12,070 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:12,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:12,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:49:12,071 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:12,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:49:12,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:49:12,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:12,072 INFO L87 Difference]: Start difference. First operand 283 states and 478 transitions. Second operand 5 states. [2019-09-09 05:49:12,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:12,342 INFO L93 Difference]: Finished difference Result 285 states and 478 transitions. [2019-09-09 05:49:12,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:12,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-09 05:49:12,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:12,346 INFO L225 Difference]: With dead ends: 285 [2019-09-09 05:49:12,346 INFO L226 Difference]: Without dead ends: 285 [2019-09-09 05:49:12,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-09 05:49:12,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-09 05:49:12,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2019-09-09 05:49:12,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-09 05:49:12,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 476 transitions. [2019-09-09 05:49:12,357 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 476 transitions. Word has length 81 [2019-09-09 05:49:12,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:12,358 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 476 transitions. [2019-09-09 05:49:12,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:49:12,358 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 476 transitions. [2019-09-09 05:49:12,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-09 05:49:12,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:12,360 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:12,361 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:12,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:12,361 INFO L82 PathProgramCache]: Analyzing trace with hash -95009440, now seen corresponding path program 1 times [2019-09-09 05:49:12,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:12,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:12,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:12,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:12,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:12,439 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:49:12,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:12,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:49:12,440 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:12,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:49:12,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:49:12,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:12,442 INFO L87 Difference]: Start difference. First operand 283 states and 476 transitions. Second operand 5 states. [2019-09-09 05:49:12,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:12,646 INFO L93 Difference]: Finished difference Result 300 states and 500 transitions. [2019-09-09 05:49:12,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:12,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-09-09 05:49:12,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:12,649 INFO L225 Difference]: With dead ends: 300 [2019-09-09 05:49:12,649 INFO L226 Difference]: Without dead ends: 300 [2019-09-09 05:49:12,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-09 05:49:12,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-09-09 05:49:12,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-09-09 05:49:12,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-09 05:49:12,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 498 transitions. [2019-09-09 05:49:12,659 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 498 transitions. Word has length 87 [2019-09-09 05:49:12,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:12,659 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 498 transitions. [2019-09-09 05:49:12,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:49:12,660 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 498 transitions. [2019-09-09 05:49:12,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-09 05:49:12,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:12,661 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:12,662 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:12,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:12,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1081604216, now seen corresponding path program 1 times [2019-09-09 05:49:12,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:12,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:12,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:12,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:12,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:12,720 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:49:12,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:12,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:49:12,721 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:12,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:49:12,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:49:12,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:12,722 INFO L87 Difference]: Start difference. First operand 298 states and 498 transitions. Second operand 5 states. [2019-09-09 05:49:12,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:12,892 INFO L93 Difference]: Finished difference Result 300 states and 496 transitions. [2019-09-09 05:49:12,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:12,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-09-09 05:49:12,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:12,895 INFO L225 Difference]: With dead ends: 300 [2019-09-09 05:49:12,895 INFO L226 Difference]: Without dead ends: 300 [2019-09-09 05:49:12,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-09 05:49:12,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-09-09 05:49:12,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-09-09 05:49:12,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-09-09 05:49:12,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 494 transitions. [2019-09-09 05:49:12,903 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 494 transitions. Word has length 88 [2019-09-09 05:49:12,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:12,904 INFO L475 AbstractCegarLoop]: Abstraction has 298 states and 494 transitions. [2019-09-09 05:49:12,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:49:12,904 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 494 transitions. [2019-09-09 05:49:12,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-09 05:49:12,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:12,906 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:12,906 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:12,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:12,907 INFO L82 PathProgramCache]: Analyzing trace with hash 2001210697, now seen corresponding path program 1 times [2019-09-09 05:49:12,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:12,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:12,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:12,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:12,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:12,956 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-09 05:49:12,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:12,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:49:12,957 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:12,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:49:12,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:49:12,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:12,958 INFO L87 Difference]: Start difference. First operand 298 states and 494 transitions. Second operand 5 states. [2019-09-09 05:49:13,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:13,140 INFO L93 Difference]: Finished difference Result 307 states and 500 transitions. [2019-09-09 05:49:13,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:13,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-09-09 05:49:13,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:13,143 INFO L225 Difference]: With dead ends: 307 [2019-09-09 05:49:13,143 INFO L226 Difference]: Without dead ends: 307 [2019-09-09 05:49:13,144 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-09 05:49:13,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-09 05:49:13,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2019-09-09 05:49:13,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-09-09 05:49:13,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 500 transitions. [2019-09-09 05:49:13,153 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 500 transitions. Word has length 100 [2019-09-09 05:49:13,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:13,153 INFO L475 AbstractCegarLoop]: Abstraction has 307 states and 500 transitions. [2019-09-09 05:49:13,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:49:13,154 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 500 transitions. [2019-09-09 05:49:13,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-09 05:49:13,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:13,155 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:13,156 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:13,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:13,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1192129085, now seen corresponding path program 1 times [2019-09-09 05:49:13,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:13,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:13,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:13,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:13,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:49:13,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:13,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:49:13,211 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:13,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:49:13,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:49:13,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:13,212 INFO L87 Difference]: Start difference. First operand 307 states and 500 transitions. Second operand 5 states. [2019-09-09 05:49:13,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:13,422 INFO L93 Difference]: Finished difference Result 338 states and 549 transitions. [2019-09-09 05:49:13,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:13,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-09-09 05:49:13,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:13,425 INFO L225 Difference]: With dead ends: 338 [2019-09-09 05:49:13,425 INFO L226 Difference]: Without dead ends: 338 [2019-09-09 05:49:13,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-09 05:49:13,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-09-09 05:49:13,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-09-09 05:49:13,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-09 05:49:13,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 547 transitions. [2019-09-09 05:49:13,435 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 547 transitions. Word has length 101 [2019-09-09 05:49:13,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:13,436 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 547 transitions. [2019-09-09 05:49:13,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:49:13,436 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 547 transitions. [2019-09-09 05:49:13,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-09 05:49:13,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:13,438 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:13,438 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:13,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:13,439 INFO L82 PathProgramCache]: Analyzing trace with hash 775386699, now seen corresponding path program 1 times [2019-09-09 05:49:13,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:13,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:13,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:13,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:13,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:13,504 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:49:13,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:13,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:49:13,505 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:13,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:49:13,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:49:13,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:13,506 INFO L87 Difference]: Start difference. First operand 336 states and 547 transitions. Second operand 5 states. [2019-09-09 05:49:13,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:13,726 INFO L93 Difference]: Finished difference Result 338 states and 545 transitions. [2019-09-09 05:49:13,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:13,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-09 05:49:13,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:13,733 INFO L225 Difference]: With dead ends: 338 [2019-09-09 05:49:13,734 INFO L226 Difference]: Without dead ends: 338 [2019-09-09 05:49:13,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-09 05:49:13,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-09-09 05:49:13,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-09-09 05:49:13,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-09 05:49:13,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 543 transitions. [2019-09-09 05:49:13,752 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 543 transitions. Word has length 102 [2019-09-09 05:49:13,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:13,753 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 543 transitions. [2019-09-09 05:49:13,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:49:13,753 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 543 transitions. [2019-09-09 05:49:13,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:49:13,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:13,756 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:13,757 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:13,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:13,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1217428909, now seen corresponding path program 1 times [2019-09-09 05:49:13,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:13,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:13,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:13,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:13,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:13,851 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:49:13,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:13,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:49:13,852 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:13,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:49:13,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:49:13,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:13,853 INFO L87 Difference]: Start difference. First operand 336 states and 543 transitions. Second operand 5 states. [2019-09-09 05:49:14,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:14,061 INFO L93 Difference]: Finished difference Result 371 states and 598 transitions. [2019-09-09 05:49:14,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:14,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-09 05:49:14,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:14,064 INFO L225 Difference]: With dead ends: 371 [2019-09-09 05:49:14,064 INFO L226 Difference]: Without dead ends: 371 [2019-09-09 05:49:14,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-09 05:49:14,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-09-09 05:49:14,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-09-09 05:49:14,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-09-09 05:49:14,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 585 transitions. [2019-09-09 05:49:14,075 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 585 transitions. Word has length 103 [2019-09-09 05:49:14,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:14,075 INFO L475 AbstractCegarLoop]: Abstraction has 363 states and 585 transitions. [2019-09-09 05:49:14,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:49:14,076 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 585 transitions. [2019-09-09 05:49:14,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:49:14,077 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:14,078 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:14,078 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:14,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:14,078 INFO L82 PathProgramCache]: Analyzing trace with hash -141729733, now seen corresponding path program 1 times [2019-09-09 05:49:14,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:14,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:14,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:14,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:14,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:14,158 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:49:14,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:14,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:49:14,159 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:14,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:49:14,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:49:14,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:14,161 INFO L87 Difference]: Start difference. First operand 363 states and 585 transitions. Second operand 5 states. [2019-09-09 05:49:14,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:14,386 INFO L93 Difference]: Finished difference Result 371 states and 593 transitions. [2019-09-09 05:49:14,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:14,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-09 05:49:14,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:14,389 INFO L225 Difference]: With dead ends: 371 [2019-09-09 05:49:14,390 INFO L226 Difference]: Without dead ends: 371 [2019-09-09 05:49:14,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-09 05:49:14,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-09-09 05:49:14,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-09-09 05:49:14,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-09-09 05:49:14,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 580 transitions. [2019-09-09 05:49:14,399 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 580 transitions. Word has length 104 [2019-09-09 05:49:14,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:14,400 INFO L475 AbstractCegarLoop]: Abstraction has 363 states and 580 transitions. [2019-09-09 05:49:14,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:49:14,400 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 580 transitions. [2019-09-09 05:49:14,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-09 05:49:14,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:14,402 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:14,403 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:14,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:14,403 INFO L82 PathProgramCache]: Analyzing trace with hash -564771468, now seen corresponding path program 1 times [2019-09-09 05:49:14,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:14,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:14,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:14,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:14,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:14,487 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-09 05:49:14,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:14,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:49:14,488 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:14,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:49:14,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:49:14,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:14,490 INFO L87 Difference]: Start difference. First operand 363 states and 580 transitions. Second operand 5 states. [2019-09-09 05:49:14,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:14,759 INFO L93 Difference]: Finished difference Result 399 states and 635 transitions. [2019-09-09 05:49:14,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:14,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-09-09 05:49:14,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:14,762 INFO L225 Difference]: With dead ends: 399 [2019-09-09 05:49:14,762 INFO L226 Difference]: Without dead ends: 399 [2019-09-09 05:49:14,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-09 05:49:14,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-09-09 05:49:14,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 397. [2019-09-09 05:49:14,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-09 05:49:14,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 633 transitions. [2019-09-09 05:49:14,775 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 633 transitions. Word has length 111 [2019-09-09 05:49:14,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:14,775 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 633 transitions. [2019-09-09 05:49:14,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:49:14,776 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 633 transitions. [2019-09-09 05:49:14,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-09 05:49:14,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:14,779 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:14,779 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:14,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:14,784 INFO L82 PathProgramCache]: Analyzing trace with hash -285750569, now seen corresponding path program 1 times [2019-09-09 05:49:14,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:14,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:14,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:14,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:14,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:14,883 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-09 05:49:14,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:14,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:49:14,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:14,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:49:14,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:49:14,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:14,886 INFO L87 Difference]: Start difference. First operand 397 states and 633 transitions. Second operand 5 states. [2019-09-09 05:49:15,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:15,085 INFO L93 Difference]: Finished difference Result 399 states and 632 transitions. [2019-09-09 05:49:15,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:15,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-09-09 05:49:15,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:15,088 INFO L225 Difference]: With dead ends: 399 [2019-09-09 05:49:15,088 INFO L226 Difference]: Without dead ends: 399 [2019-09-09 05:49:15,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-09 05:49:15,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-09-09 05:49:15,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 397. [2019-09-09 05:49:15,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-09-09 05:49:15,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 630 transitions. [2019-09-09 05:49:15,101 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 630 transitions. Word has length 112 [2019-09-09 05:49:15,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:15,102 INFO L475 AbstractCegarLoop]: Abstraction has 397 states and 630 transitions. [2019-09-09 05:49:15,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:49:15,102 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 630 transitions. [2019-09-09 05:49:15,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-09 05:49:15,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:15,104 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:15,104 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:15,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:15,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1187170139, now seen corresponding path program 1 times [2019-09-09 05:49:15,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:15,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:15,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:15,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:15,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:15,176 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:49:15,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:15,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:49:15,177 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:15,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:49:15,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:49:15,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:15,178 INFO L87 Difference]: Start difference. First operand 397 states and 630 transitions. Second operand 5 states. [2019-09-09 05:49:15,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:15,414 INFO L93 Difference]: Finished difference Result 444 states and 703 transitions. [2019-09-09 05:49:15,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:15,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-09-09 05:49:15,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:15,417 INFO L225 Difference]: With dead ends: 444 [2019-09-09 05:49:15,418 INFO L226 Difference]: Without dead ends: 444 [2019-09-09 05:49:15,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-09 05:49:15,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-09-09 05:49:15,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 439. [2019-09-09 05:49:15,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-09-09 05:49:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 695 transitions. [2019-09-09 05:49:15,444 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 695 transitions. Word has length 117 [2019-09-09 05:49:15,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:15,445 INFO L475 AbstractCegarLoop]: Abstraction has 439 states and 695 transitions. [2019-09-09 05:49:15,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:49:15,445 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 695 transitions. [2019-09-09 05:49:15,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-09 05:49:15,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:15,447 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:15,447 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:15,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:15,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1861118978, now seen corresponding path program 1 times [2019-09-09 05:49:15,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:15,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:15,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:15,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:15,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:15,500 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-09 05:49:15,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:15,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:49:15,501 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:15,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:49:15,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:49:15,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:15,502 INFO L87 Difference]: Start difference. First operand 439 states and 695 transitions. Second operand 5 states. [2019-09-09 05:49:15,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:15,718 INFO L93 Difference]: Finished difference Result 448 states and 709 transitions. [2019-09-09 05:49:15,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:15,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2019-09-09 05:49:15,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:15,721 INFO L225 Difference]: With dead ends: 448 [2019-09-09 05:49:15,721 INFO L226 Difference]: Without dead ends: 446 [2019-09-09 05:49:15,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-09 05:49:15,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-09-09 05:49:15,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 441. [2019-09-09 05:49:15,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-09-09 05:49:15,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 698 transitions. [2019-09-09 05:49:15,732 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 698 transitions. Word has length 118 [2019-09-09 05:49:15,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:15,732 INFO L475 AbstractCegarLoop]: Abstraction has 441 states and 698 transitions. [2019-09-09 05:49:15,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:49:15,733 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 698 transitions. [2019-09-09 05:49:15,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-09 05:49:15,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:15,735 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:15,735 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:15,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:15,735 INFO L82 PathProgramCache]: Analyzing trace with hash 385795336, now seen corresponding path program 1 times [2019-09-09 05:49:15,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:15,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:15,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:15,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:15,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-09 05:49:15,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:15,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:49:15,786 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:15,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:49:15,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:49:15,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:15,787 INFO L87 Difference]: Start difference. First operand 441 states and 698 transitions. Second operand 5 states. [2019-09-09 05:49:15,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:15,989 INFO L93 Difference]: Finished difference Result 479 states and 754 transitions. [2019-09-09 05:49:15,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:15,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2019-09-09 05:49:15,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:15,992 INFO L225 Difference]: With dead ends: 479 [2019-09-09 05:49:15,992 INFO L226 Difference]: Without dead ends: 479 [2019-09-09 05:49:15,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-09 05:49:15,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-09-09 05:49:16,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 466. [2019-09-09 05:49:16,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-09 05:49:16,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 733 transitions. [2019-09-09 05:49:16,004 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 733 transitions. Word has length 129 [2019-09-09 05:49:16,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:16,004 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 733 transitions. [2019-09-09 05:49:16,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:49:16,004 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 733 transitions. [2019-09-09 05:49:16,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-09 05:49:16,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:16,007 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:16,007 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:16,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:16,007 INFO L82 PathProgramCache]: Analyzing trace with hash -177817520, now seen corresponding path program 1 times [2019-09-09 05:49:16,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:16,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:16,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:16,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:16,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:16,058 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-09 05:49:16,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:16,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:49:16,058 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:16,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:49:16,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:49:16,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:16,060 INFO L87 Difference]: Start difference. First operand 466 states and 733 transitions. Second operand 5 states. [2019-09-09 05:49:16,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:16,245 INFO L93 Difference]: Finished difference Result 479 states and 746 transitions. [2019-09-09 05:49:16,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:16,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-09-09 05:49:16,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:16,248 INFO L225 Difference]: With dead ends: 479 [2019-09-09 05:49:16,249 INFO L226 Difference]: Without dead ends: 479 [2019-09-09 05:49:16,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-09 05:49:16,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-09-09 05:49:16,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 466. [2019-09-09 05:49:16,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-09 05:49:16,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 725 transitions. [2019-09-09 05:49:16,260 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 725 transitions. Word has length 130 [2019-09-09 05:49:16,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:16,260 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 725 transitions. [2019-09-09 05:49:16,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:49:16,261 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 725 transitions. [2019-09-09 05:49:16,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-09 05:49:16,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:16,263 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:16,263 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:16,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:16,264 INFO L82 PathProgramCache]: Analyzing trace with hash 755280415, now seen corresponding path program 1 times [2019-09-09 05:49:16,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:16,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:16,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:16,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:16,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:16,341 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-09 05:49:16,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:16,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:49:16,341 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:16,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:49:16,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:49:16,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:16,344 INFO L87 Difference]: Start difference. First operand 466 states and 725 transitions. Second operand 5 states. [2019-09-09 05:49:16,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:16,575 INFO L93 Difference]: Finished difference Result 470 states and 725 transitions. [2019-09-09 05:49:16,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:16,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2019-09-09 05:49:16,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:16,578 INFO L225 Difference]: With dead ends: 470 [2019-09-09 05:49:16,578 INFO L226 Difference]: Without dead ends: 470 [2019-09-09 05:49:16,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-09 05:49:16,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-09 05:49:16,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 466. [2019-09-09 05:49:16,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-09 05:49:16,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 720 transitions. [2019-09-09 05:49:16,589 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 720 transitions. Word has length 142 [2019-09-09 05:49:16,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:16,589 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 720 transitions. [2019-09-09 05:49:16,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:49:16,590 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 720 transitions. [2019-09-09 05:49:16,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-09 05:49:16,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:16,592 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:16,592 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:16,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:16,593 INFO L82 PathProgramCache]: Analyzing trace with hash -816490564, now seen corresponding path program 1 times [2019-09-09 05:49:16,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:16,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:16,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:16,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:16,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:16,645 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-09 05:49:16,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:16,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:49:16,646 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:16,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:49:16,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:49:16,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:16,647 INFO L87 Difference]: Start difference. First operand 466 states and 720 transitions. Second operand 5 states. [2019-09-09 05:49:16,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:16,854 INFO L93 Difference]: Finished difference Result 470 states and 720 transitions. [2019-09-09 05:49:16,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:16,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-09-09 05:49:16,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:16,858 INFO L225 Difference]: With dead ends: 470 [2019-09-09 05:49:16,858 INFO L226 Difference]: Without dead ends: 470 [2019-09-09 05:49:16,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-09 05:49:16,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-09 05:49:16,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 466. [2019-09-09 05:49:16,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-09 05:49:16,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 715 transitions. [2019-09-09 05:49:16,870 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 715 transitions. Word has length 143 [2019-09-09 05:49:16,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:16,870 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 715 transitions. [2019-09-09 05:49:16,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:49:16,870 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 715 transitions. [2019-09-09 05:49:16,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-09 05:49:16,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:16,873 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:16,873 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:16,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:16,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1136592958, now seen corresponding path program 1 times [2019-09-09 05:49:16,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:16,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:16,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:16,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:16,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:16,946 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-09-09 05:49:16,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:16,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:49:16,946 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:16,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:49:16,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:49:16,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:16,948 INFO L87 Difference]: Start difference. First operand 466 states and 715 transitions. Second operand 5 states. [2019-09-09 05:49:17,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:17,151 INFO L93 Difference]: Finished difference Result 494 states and 751 transitions. [2019-09-09 05:49:17,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:17,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-09 05:49:17,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:17,154 INFO L225 Difference]: With dead ends: 494 [2019-09-09 05:49:17,155 INFO L226 Difference]: Without dead ends: 494 [2019-09-09 05:49:17,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-09 05:49:17,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-09-09 05:49:17,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 490. [2019-09-09 05:49:17,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-09 05:49:17,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 746 transitions. [2019-09-09 05:49:17,169 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 746 transitions. Word has length 150 [2019-09-09 05:49:17,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:17,170 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 746 transitions. [2019-09-09 05:49:17,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:49:17,170 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 746 transitions. [2019-09-09 05:49:17,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-09 05:49:17,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:17,173 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:17,174 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:17,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:17,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1424495078, now seen corresponding path program 1 times [2019-09-09 05:49:17,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:17,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:17,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:17,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:17,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:17,239 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-09-09 05:49:17,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:17,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:49:17,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:17,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:49:17,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:49:17,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:17,241 INFO L87 Difference]: Start difference. First operand 490 states and 746 transitions. Second operand 5 states. [2019-09-09 05:49:17,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:17,446 INFO L93 Difference]: Finished difference Result 494 states and 742 transitions. [2019-09-09 05:49:17,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:17,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-09-09 05:49:17,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:17,453 INFO L225 Difference]: With dead ends: 494 [2019-09-09 05:49:17,453 INFO L226 Difference]: Without dead ends: 494 [2019-09-09 05:49:17,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-09 05:49:17,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-09-09 05:49:17,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 490. [2019-09-09 05:49:17,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-09-09 05:49:17,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 737 transitions. [2019-09-09 05:49:17,463 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 737 transitions. Word has length 151 [2019-09-09 05:49:17,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:17,463 INFO L475 AbstractCegarLoop]: Abstraction has 490 states and 737 transitions. [2019-09-09 05:49:17,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:49:17,464 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 737 transitions. [2019-09-09 05:49:17,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-09 05:49:17,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:17,466 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:17,466 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:17,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:17,467 INFO L82 PathProgramCache]: Analyzing trace with hash 311984194, now seen corresponding path program 1 times [2019-09-09 05:49:17,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:17,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:17,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:17,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:17,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:17,530 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-09 05:49:17,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:17,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:49:17,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:17,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:49:17,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:49:17,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:17,532 INFO L87 Difference]: Start difference. First operand 490 states and 737 transitions. Second operand 5 states. [2019-09-09 05:49:17,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:17,726 INFO L93 Difference]: Finished difference Result 537 states and 801 transitions. [2019-09-09 05:49:17,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:17,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-09-09 05:49:17,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:17,730 INFO L225 Difference]: With dead ends: 537 [2019-09-09 05:49:17,730 INFO L226 Difference]: Without dead ends: 537 [2019-09-09 05:49:17,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-09 05:49:17,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-09-09 05:49:17,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 531. [2019-09-09 05:49:17,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-09-09 05:49:17,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 792 transitions. [2019-09-09 05:49:17,741 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 792 transitions. Word has length 157 [2019-09-09 05:49:17,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:17,741 INFO L475 AbstractCegarLoop]: Abstraction has 531 states and 792 transitions. [2019-09-09 05:49:17,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:49:17,741 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 792 transitions. [2019-09-09 05:49:17,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-09 05:49:17,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:17,743 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:17,743 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:17,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:17,744 INFO L82 PathProgramCache]: Analyzing trace with hash -611548539, now seen corresponding path program 1 times [2019-09-09 05:49:17,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:17,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:17,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:17,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:17,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:17,805 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-09 05:49:17,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:17,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:49:17,806 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:17,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:49:17,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:49:17,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:17,807 INFO L87 Difference]: Start difference. First operand 531 states and 792 transitions. Second operand 5 states. [2019-09-09 05:49:18,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:18,017 INFO L93 Difference]: Finished difference Result 537 states and 799 transitions. [2019-09-09 05:49:18,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:18,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-09-09 05:49:18,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:18,020 INFO L225 Difference]: With dead ends: 537 [2019-09-09 05:49:18,020 INFO L226 Difference]: Without dead ends: 518 [2019-09-09 05:49:18,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-09 05:49:18,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-09-09 05:49:18,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 512. [2019-09-09 05:49:18,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-09-09 05:49:18,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 762 transitions. [2019-09-09 05:49:18,030 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 762 transitions. Word has length 158 [2019-09-09 05:49:18,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:18,031 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 762 transitions. [2019-09-09 05:49:18,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:49:18,031 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 762 transitions. [2019-09-09 05:49:18,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-09 05:49:18,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:18,033 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:18,033 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:18,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:18,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1831676618, now seen corresponding path program 1 times [2019-09-09 05:49:18,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:18,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:18,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:18,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:18,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:18,099 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-09-09 05:49:18,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:18,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:49:18,100 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:18,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:49:18,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:49:18,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:18,101 INFO L87 Difference]: Start difference. First operand 512 states and 762 transitions. Second operand 5 states. [2019-09-09 05:49:18,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:18,291 INFO L93 Difference]: Finished difference Result 537 states and 792 transitions. [2019-09-09 05:49:18,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:18,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2019-09-09 05:49:18,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:18,294 INFO L225 Difference]: With dead ends: 537 [2019-09-09 05:49:18,294 INFO L226 Difference]: Without dead ends: 537 [2019-09-09 05:49:18,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-09 05:49:18,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-09-09 05:49:18,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 533. [2019-09-09 05:49:18,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-09-09 05:49:18,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 786 transitions. [2019-09-09 05:49:18,305 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 786 transitions. Word has length 171 [2019-09-09 05:49:18,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:18,306 INFO L475 AbstractCegarLoop]: Abstraction has 533 states and 786 transitions. [2019-09-09 05:49:18,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:49:18,306 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 786 transitions. [2019-09-09 05:49:18,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-09 05:49:18,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:18,308 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:18,308 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:18,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:18,309 INFO L82 PathProgramCache]: Analyzing trace with hash -813103810, now seen corresponding path program 1 times [2019-09-09 05:49:18,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:18,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:18,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:18,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:18,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:18,394 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-09-09 05:49:18,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:18,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:49:18,395 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:18,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:49:18,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:49:18,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:18,397 INFO L87 Difference]: Start difference. First operand 533 states and 786 transitions. Second operand 5 states. [2019-09-09 05:49:18,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:18,608 INFO L93 Difference]: Finished difference Result 537 states and 781 transitions. [2019-09-09 05:49:18,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:18,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2019-09-09 05:49:18,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:18,612 INFO L225 Difference]: With dead ends: 537 [2019-09-09 05:49:18,612 INFO L226 Difference]: Without dead ends: 535 [2019-09-09 05:49:18,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-09 05:49:18,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-09 05:49:18,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 531. [2019-09-09 05:49:18,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-09-09 05:49:18,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 772 transitions. [2019-09-09 05:49:18,623 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 772 transitions. Word has length 172 [2019-09-09 05:49:18,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:18,623 INFO L475 AbstractCegarLoop]: Abstraction has 531 states and 772 transitions. [2019-09-09 05:49:18,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:49:18,623 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 772 transitions. [2019-09-09 05:49:18,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-09 05:49:18,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:18,625 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:18,626 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:18,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:18,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1628821973, now seen corresponding path program 1 times [2019-09-09 05:49:18,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:18,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:18,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:18,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:18,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:18,695 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-09-09 05:49:18,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:18,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:49:18,696 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 188 with the following transitions: [2019-09-09 05:49:18,699 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [115], [117], [122], [125], [127], [132], [135], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [190], [281], [284], [292], [294], [297], [305], [310], [312], [314], [317], [326], [328], [331], [337], [367], [372], [382], [386], [397], [399], [409], [411], [416], [438], [440], [474], [479], [484], [487], [619], [621], [633], [636], [637], [638], [640] [2019-09-09 05:49:18,764 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:49:18,764 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:49:19,100 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:49:20,421 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:49:20,424 INFO L272 AbstractInterpreter]: Visited 80 different actions 1678 times. Merged at 69 different actions 1442 times. Widened at 17 different actions 223 times. Performed 3735 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3735 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 136 fixpoints after 19 different actions. Largest state had 95 variables. [2019-09-09 05:49:20,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:20,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:49:20,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:20,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:49:20,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:20,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:49:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:20,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-09 05:49:20,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:49:20,615 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-09-09 05:49:20,615 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:49:20,668 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-09-09 05:49:20,679 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:49:20,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-09-09 05:49:20,680 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:20,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:20,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:20,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:49:20,681 INFO L87 Difference]: Start difference. First operand 531 states and 772 transitions. Second operand 3 states. [2019-09-09 05:49:20,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:20,747 INFO L93 Difference]: Finished difference Result 1047 states and 1518 transitions. [2019-09-09 05:49:20,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:20,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-09-09 05:49:20,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:20,753 INFO L225 Difference]: With dead ends: 1047 [2019-09-09 05:49:20,753 INFO L226 Difference]: Without dead ends: 1047 [2019-09-09 05:49:20,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:49:20,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2019-09-09 05:49:20,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1047. [2019-09-09 05:49:20,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2019-09-09 05:49:20,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1518 transitions. [2019-09-09 05:49:20,776 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1518 transitions. Word has length 187 [2019-09-09 05:49:20,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:20,776 INFO L475 AbstractCegarLoop]: Abstraction has 1047 states and 1518 transitions. [2019-09-09 05:49:20,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:20,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1518 transitions. [2019-09-09 05:49:20,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-09 05:49:20,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:20,780 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:20,780 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:20,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:20,781 INFO L82 PathProgramCache]: Analyzing trace with hash -845275759, now seen corresponding path program 1 times [2019-09-09 05:49:20,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:20,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:20,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:20,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:20,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:20,928 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-09 05:49:20,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:20,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:20,929 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:20,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:20,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:20,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:20,932 INFO L87 Difference]: Start difference. First operand 1047 states and 1518 transitions. Second operand 3 states. [2019-09-09 05:49:21,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:21,009 INFO L93 Difference]: Finished difference Result 1557 states and 2254 transitions. [2019-09-09 05:49:21,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:21,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-09-09 05:49:21,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:21,018 INFO L225 Difference]: With dead ends: 1557 [2019-09-09 05:49:21,018 INFO L226 Difference]: Without dead ends: 1557 [2019-09-09 05:49:21,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-09 05:49:21,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2019-09-09 05:49:21,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1557. [2019-09-09 05:49:21,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1557 states. [2019-09-09 05:49:21,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2254 transitions. [2019-09-09 05:49:21,063 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2254 transitions. Word has length 194 [2019-09-09 05:49:21,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:21,064 INFO L475 AbstractCegarLoop]: Abstraction has 1557 states and 2254 transitions. [2019-09-09 05:49:21,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:21,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2254 transitions. [2019-09-09 05:49:21,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-09 05:49:21,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:21,071 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:21,071 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:21,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:21,072 INFO L82 PathProgramCache]: Analyzing trace with hash -977462684, now seen corresponding path program 1 times [2019-09-09 05:49:21,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:21,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:21,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:21,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:21,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:21,150 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-09 05:49:21,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:21,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:21,151 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:21,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:21,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:21,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:21,152 INFO L87 Difference]: Start difference. First operand 1557 states and 2254 transitions. Second operand 3 states. [2019-09-09 05:49:21,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:21,233 INFO L93 Difference]: Finished difference Result 2068 states and 2991 transitions. [2019-09-09 05:49:21,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:21,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-09-09 05:49:21,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:21,244 INFO L225 Difference]: With dead ends: 2068 [2019-09-09 05:49:21,245 INFO L226 Difference]: Without dead ends: 2068 [2019-09-09 05:49:21,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-09 05:49:21,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2019-09-09 05:49:21,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 2068. [2019-09-09 05:49:21,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2068 states. [2019-09-09 05:49:21,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 2068 states and 2991 transitions. [2019-09-09 05:49:21,293 INFO L78 Accepts]: Start accepts. Automaton has 2068 states and 2991 transitions. Word has length 195 [2019-09-09 05:49:21,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:21,294 INFO L475 AbstractCegarLoop]: Abstraction has 2068 states and 2991 transitions. [2019-09-09 05:49:21,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:21,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2991 transitions. [2019-09-09 05:49:21,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-09-09 05:49:21,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:21,300 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:21,300 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:21,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:21,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1729777908, now seen corresponding path program 1 times [2019-09-09 05:49:21,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:21,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:21,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:21,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:21,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:21,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 719 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-09-09 05:49:21,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:21,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:21,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:21,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:21,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:21,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:21,448 INFO L87 Difference]: Start difference. First operand 2068 states and 2991 transitions. Second operand 3 states. [2019-09-09 05:49:21,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:21,492 INFO L93 Difference]: Finished difference Result 3643 states and 5252 transitions. [2019-09-09 05:49:21,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:21,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 344 [2019-09-09 05:49:21,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:21,509 INFO L225 Difference]: With dead ends: 3643 [2019-09-09 05:49:21,509 INFO L226 Difference]: Without dead ends: 3643 [2019-09-09 05:49:21,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-09 05:49:21,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2019-09-09 05:49:21,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3641. [2019-09-09 05:49:21,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3641 states. [2019-09-09 05:49:21,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 5251 transitions. [2019-09-09 05:49:21,636 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 5251 transitions. Word has length 344 [2019-09-09 05:49:21,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:21,636 INFO L475 AbstractCegarLoop]: Abstraction has 3641 states and 5251 transitions. [2019-09-09 05:49:21,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:21,636 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 5251 transitions. [2019-09-09 05:49:21,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-09-09 05:49:21,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:21,646 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:21,646 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:21,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:21,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1198848905, now seen corresponding path program 1 times [2019-09-09 05:49:21,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:21,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:21,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:21,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:21,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:21,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 851 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2019-09-09 05:49:21,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:21,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:21,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:21,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:21,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:21,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:21,773 INFO L87 Difference]: Start difference. First operand 3641 states and 5251 transitions. Second operand 3 states. [2019-09-09 05:49:21,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:21,910 INFO L93 Difference]: Finished difference Result 3801 states and 5443 transitions. [2019-09-09 05:49:21,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:21,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 381 [2019-09-09 05:49:21,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:21,923 INFO L225 Difference]: With dead ends: 3801 [2019-09-09 05:49:21,923 INFO L226 Difference]: Without dead ends: 2504 [2019-09-09 05:49:21,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-09 05:49:21,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2019-09-09 05:49:21,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2504. [2019-09-09 05:49:21,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2019-09-09 05:49:21,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3558 transitions. [2019-09-09 05:49:21,968 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3558 transitions. Word has length 381 [2019-09-09 05:49:21,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:21,968 INFO L475 AbstractCegarLoop]: Abstraction has 2504 states and 3558 transitions. [2019-09-09 05:49:21,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:21,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3558 transitions. [2019-09-09 05:49:21,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-09-09 05:49:21,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:21,976 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:21,976 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:21,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:21,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1350004073, now seen corresponding path program 1 times [2019-09-09 05:49:21,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:21,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:21,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:21,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:21,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:22,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-09-09 05:49:22,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:22,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:49:22,203 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 448 with the following transitions: [2019-09-09 05:49:22,203 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [115], [117], [122], [125], [127], [132], [135], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [190], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [305], [310], [312], [314], [317], [326], [328], [331], [337], [367], [372], [382], [386], [397], [399], [409], [411], [416], [438], [440], [474], [477], [479], [484], [487], [495], [500], [502], [504], [509], [512], [514], [517], [530], [535], [537], [540], [542], [545], [558], [561], [563], [565], [619], [621], [633], [636], [637], [638], [640] [2019-09-09 05:49:22,214 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:49:22,214 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:49:22,309 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:49:23,477 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:49:23,477 INFO L272 AbstractInterpreter]: Visited 105 different actions 2170 times. Merged at 91 different actions 1789 times. Widened at 19 different actions 280 times. Performed 5058 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5058 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 249 fixpoints after 24 different actions. Largest state had 97 variables. [2019-09-09 05:49:23,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:23,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:49:23,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:23,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:49:23,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:23,489 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:49:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:23,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:49:23,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:49:23,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 850 proven. 0 refuted. 0 times theorem prover too weak. 1154 trivial. 0 not checked. [2019-09-09 05:49:23,769 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:49:23,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 850 proven. 0 refuted. 0 times theorem prover too weak. 1154 trivial. 0 not checked. [2019-09-09 05:49:23,975 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:49:23,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-09-09 05:49:23,976 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:23,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:23,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:23,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:23,977 INFO L87 Difference]: Start difference. First operand 2504 states and 3558 transitions. Second operand 3 states. [2019-09-09 05:49:23,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:23,995 INFO L93 Difference]: Finished difference Result 2075 states and 2951 transitions. [2019-09-09 05:49:23,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:23,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 447 [2019-09-09 05:49:23,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:24,008 INFO L225 Difference]: With dead ends: 2075 [2019-09-09 05:49:24,008 INFO L226 Difference]: Without dead ends: 2075 [2019-09-09 05:49:24,010 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 897 GetRequests, 894 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-09-09 05:49:24,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2019-09-09 05:49:24,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 2017. [2019-09-09 05:49:24,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2017 states. [2019-09-09 05:49:24,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 2866 transitions. [2019-09-09 05:49:24,042 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 2866 transitions. Word has length 447 [2019-09-09 05:49:24,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:24,043 INFO L475 AbstractCegarLoop]: Abstraction has 2017 states and 2866 transitions. [2019-09-09 05:49:24,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:24,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2866 transitions. [2019-09-09 05:49:24,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-09-09 05:49:24,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:24,050 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:24,050 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:24,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:24,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1991023065, now seen corresponding path program 1 times [2019-09-09 05:49:24,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:24,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:24,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:24,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:24,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:24,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-09-09 05:49:24,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:24,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:49:24,244 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 448 with the following transitions: [2019-09-09 05:49:24,244 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [115], [117], [122], [125], [127], [132], [135], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [190], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [305], [310], [312], [314], [317], [326], [328], [331], [337], [367], [372], [382], [386], [397], [399], [409], [411], [416], [438], [440], [474], [477], [479], [484], [487], [495], [500], [502], [504], [509], [512], [514], [517], [530], [535], [537], [540], [542], [545], [558], [563], [565], [619], [621], [633], [636], [637], [638], [640] [2019-09-09 05:49:24,250 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:49:24,250 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:49:24,320 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:49:25,761 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:49:25,761 INFO L272 AbstractInterpreter]: Visited 104 different actions 2387 times. Merged at 91 different actions 1979 times. Widened at 19 different actions 313 times. Performed 5498 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5498 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 274 fixpoints after 27 different actions. Largest state had 97 variables. [2019-09-09 05:49:25,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:25,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:49:25,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:25,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:49:25,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:25,779 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:49:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:25,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:49:25,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:49:26,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 582 proven. 0 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2019-09-09 05:49:26,078 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:49:26,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 582 proven. 0 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2019-09-09 05:49:26,191 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:49:26,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-09-09 05:49:26,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:26,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:26,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:26,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:26,192 INFO L87 Difference]: Start difference. First operand 2017 states and 2866 transitions. Second operand 3 states. [2019-09-09 05:49:26,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:26,268 INFO L93 Difference]: Finished difference Result 2486 states and 3534 transitions. [2019-09-09 05:49:26,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:26,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 447 [2019-09-09 05:49:26,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:26,280 INFO L225 Difference]: With dead ends: 2486 [2019-09-09 05:49:26,280 INFO L226 Difference]: Without dead ends: 2486 [2019-09-09 05:49:26,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 897 GetRequests, 894 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-09-09 05:49:26,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2019-09-09 05:49:26,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2486. [2019-09-09 05:49:26,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2486 states. [2019-09-09 05:49:26,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 3534 transitions. [2019-09-09 05:49:26,317 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 3534 transitions. Word has length 447 [2019-09-09 05:49:26,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:26,318 INFO L475 AbstractCegarLoop]: Abstraction has 2486 states and 3534 transitions. [2019-09-09 05:49:26,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:26,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 3534 transitions. [2019-09-09 05:49:26,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2019-09-09 05:49:26,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:26,325 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:26,326 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:26,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:26,326 INFO L82 PathProgramCache]: Analyzing trace with hash -213147291, now seen corresponding path program 1 times [2019-09-09 05:49:26,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:26,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:26,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:26,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-09-09 05:49:26,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:26,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:49:26,504 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 449 with the following transitions: [2019-09-09 05:49:26,505 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [115], [117], [122], [125], [127], [132], [135], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [190], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [305], [310], [312], [314], [317], [326], [328], [331], [337], [367], [372], [382], [386], [397], [399], [409], [411], [416], [438], [440], [474], [477], [479], [484], [487], [495], [500], [502], [504], [509], [512], [514], [517], [530], [535], [537], [540], [542], [547], [550], [558], [563], [565], [619], [621], [633], [636], [637], [638], [640] [2019-09-09 05:49:26,522 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:49:26,523 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:49:26,600 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:49:27,959 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:49:27,960 INFO L272 AbstractInterpreter]: Visited 105 different actions 2373 times. Merged at 91 different actions 1968 times. Widened at 19 different actions 305 times. Performed 5426 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5426 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 267 fixpoints after 29 different actions. Largest state had 97 variables. [2019-09-09 05:49:27,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:27,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:49:27,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:27,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:49:27,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:27,978 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:49:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:28,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:49:28,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:49:28,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 865 proven. 0 refuted. 0 times theorem prover too weak. 1139 trivial. 0 not checked. [2019-09-09 05:49:28,327 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:49:28,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 865 proven. 0 refuted. 0 times theorem prover too weak. 1139 trivial. 0 not checked. [2019-09-09 05:49:28,454 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:49:28,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-09-09 05:49:28,454 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:28,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:28,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:28,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:28,455 INFO L87 Difference]: Start difference. First operand 2486 states and 3534 transitions. Second operand 3 states. [2019-09-09 05:49:28,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:28,515 INFO L93 Difference]: Finished difference Result 2995 states and 4254 transitions. [2019-09-09 05:49:28,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:28,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 448 [2019-09-09 05:49:28,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:28,524 INFO L225 Difference]: With dead ends: 2995 [2019-09-09 05:49:28,524 INFO L226 Difference]: Without dead ends: 2995 [2019-09-09 05:49:28,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 899 GetRequests, 896 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-09-09 05:49:28,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2019-09-09 05:49:28,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2995. [2019-09-09 05:49:28,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2995 states. [2019-09-09 05:49:28,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2995 states to 2995 states and 4254 transitions. [2019-09-09 05:49:28,569 INFO L78 Accepts]: Start accepts. Automaton has 2995 states and 4254 transitions. Word has length 448 [2019-09-09 05:49:28,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:28,570 INFO L475 AbstractCegarLoop]: Abstraction has 2995 states and 4254 transitions. [2019-09-09 05:49:28,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:28,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2995 states and 4254 transitions. [2019-09-09 05:49:28,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2019-09-09 05:49:28,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:28,579 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:28,579 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:28,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:28,580 INFO L82 PathProgramCache]: Analyzing trace with hash -915884239, now seen corresponding path program 1 times [2019-09-09 05:49:28,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:28,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:28,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:28,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:28,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:28,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-09-09 05:49:28,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:28,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:49:28,738 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 450 with the following transitions: [2019-09-09 05:49:28,738 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [115], [117], [122], [125], [127], [132], [135], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [190], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [305], [310], [312], [314], [317], [326], [328], [331], [337], [367], [372], [382], [386], [397], [399], [409], [411], [416], [438], [440], [474], [477], [479], [484], [487], [495], [500], [502], [504], [509], [512], [514], [519], [522], [530], [535], [537], [540], [542], [547], [550], [558], [563], [565], [619], [621], [633], [636], [637], [638], [640] [2019-09-09 05:49:28,740 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:49:28,740 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:49:28,797 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:49:29,833 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:49:29,834 INFO L272 AbstractInterpreter]: Visited 106 different actions 2292 times. Merged at 92 different actions 1902 times. Widened at 19 different actions 295 times. Performed 5226 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5226 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 254 fixpoints after 22 different actions. Largest state had 97 variables. [2019-09-09 05:49:29,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:29,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:49:29,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:29,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:49:29,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:29,847 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:49:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:29,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:49:29,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:49:30,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1051 proven. 0 refuted. 0 times theorem prover too weak. 953 trivial. 0 not checked. [2019-09-09 05:49:30,074 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:49:30,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1051 proven. 0 refuted. 0 times theorem prover too weak. 953 trivial. 0 not checked. [2019-09-09 05:49:30,269 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:49:30,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-09-09 05:49:30,270 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:30,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:30,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:30,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:49:30,271 INFO L87 Difference]: Start difference. First operand 2995 states and 4254 transitions. Second operand 3 states. [2019-09-09 05:49:30,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:30,332 INFO L93 Difference]: Finished difference Result 3463 states and 4921 transitions. [2019-09-09 05:49:30,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:30,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 449 [2019-09-09 05:49:30,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:30,346 INFO L225 Difference]: With dead ends: 3463 [2019-09-09 05:49:30,347 INFO L226 Difference]: Without dead ends: 3463 [2019-09-09 05:49:30,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 901 GetRequests, 898 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-09-09 05:49:30,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3463 states. [2019-09-09 05:49:30,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3463 to 3463. [2019-09-09 05:49:30,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3463 states. [2019-09-09 05:49:30,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3463 states to 3463 states and 4921 transitions. [2019-09-09 05:49:30,398 INFO L78 Accepts]: Start accepts. Automaton has 3463 states and 4921 transitions. Word has length 449 [2019-09-09 05:49:30,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:30,399 INFO L475 AbstractCegarLoop]: Abstraction has 3463 states and 4921 transitions. [2019-09-09 05:49:30,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:30,399 INFO L276 IsEmpty]: Start isEmpty. Operand 3463 states and 4921 transitions. [2019-09-09 05:49:30,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2019-09-09 05:49:30,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:30,410 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 9, 9, 9, 9, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:30,410 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:30,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:30,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1109132628, now seen corresponding path program 1 times [2019-09-09 05:49:30,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:30,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:30,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:30,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:30,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:30,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-09-09 05:49:30,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:30,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:49:30,667 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 601 with the following transitions: [2019-09-09 05:49:30,668 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [115], [117], [122], [125], [127], [132], [135], [137], [142], [147], [152], [155], [157], [162], [167], [172], [177], [182], [187], [190], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [305], [310], [312], [314], [317], [326], [328], [331], [337], [367], [372], [382], [386], [397], [399], [409], [411], [416], [438], [440], [474], [477], [479], [482], [484], [487], [495], [500], [502], [504], [509], [512], [514], [517], [519], [522], [530], [535], [537], [540], [542], [545], [547], [550], [558], [563], [565], [619], [621], [633], [636], [637], [638], [640] [2019-09-09 05:49:30,672 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:49:30,672 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:49:30,713 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:49:31,893 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:49:31,894 INFO L272 AbstractInterpreter]: Visited 109 different actions 2424 times. Merged at 96 different actions 1957 times. Widened at 19 different actions 304 times. Performed 5622 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5622 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 327 fixpoints after 27 different actions. Largest state had 97 variables. [2019-09-09 05:49:31,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:31,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:49:31,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:31,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:49:31,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:31,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:49:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:32,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:49:32,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:49:32,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-09-09 05:49:32,176 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:49:32,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-09-09 05:49:32,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:49:32,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-09 05:49:32,395 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:49:32,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:49:32,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:49:32,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:49:32,396 INFO L87 Difference]: Start difference. First operand 3463 states and 4921 transitions. Second operand 4 states. [2019-09-09 05:49:32,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:32,644 INFO L93 Difference]: Finished difference Result 3458 states and 4704 transitions. [2019-09-09 05:49:32,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:49:32,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 600 [2019-09-09 05:49:32,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:32,652 INFO L225 Difference]: With dead ends: 3458 [2019-09-09 05:49:32,652 INFO L226 Difference]: Without dead ends: 3381 [2019-09-09 05:49:32,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1205 GetRequests, 1200 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:49:32,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3381 states. [2019-09-09 05:49:32,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3381 to 3104. [2019-09-09 05:49:32,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2019-09-09 05:49:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 4254 transitions. [2019-09-09 05:49:32,688 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 4254 transitions. Word has length 600 [2019-09-09 05:49:32,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:32,689 INFO L475 AbstractCegarLoop]: Abstraction has 3104 states and 4254 transitions. [2019-09-09 05:49:32,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:49:32,689 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 4254 transitions. [2019-09-09 05:49:32,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1021 [2019-09-09 05:49:32,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:32,703 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 29, 29, 28, 28, 27, 27, 26, 26, 26, 26, 22, 18, 18, 14, 14, 10, 10, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:32,704 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:32,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:32,704 INFO L82 PathProgramCache]: Analyzing trace with hash 859855159, now seen corresponding path program 1 times [2019-09-09 05:49:32,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:32,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:32,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:32,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:32,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:33,217 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2019-09-09 05:49:33,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:33,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:49:33,218 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 1021 with the following transitions: [2019-09-09 05:49:33,218 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [36], [45], [47], [52], [57], [62], [67], [72], [77], [82], [87], [90], [92], [97], [102], [105], [107], [112], [115], [117], [122], [125], [127], [132], [135], [137], [142], [147], [152], [155], [157], [160], [162], [167], [170], [172], [177], [180], [182], [187], [190], [192], [197], [200], [202], [207], [210], [281], [284], [292], [294], [297], [305], [310], [312], [314], [317], [326], [328], [331], [337], [367], [372], [382], [386], [397], [399], [409], [411], [416], [438], [440], [442], [447], [452], [457], [460], [465], [467], [472], [474], [477], [479], [482], [484], [487], [489], [495], [500], [502], [504], [509], [512], [514], [517], [519], [522], [530], [535], [537], [540], [542], [545], [547], [550], [558], [563], [565], [619], [621], [633], [636], [637], [638], [640] [2019-09-09 05:49:33,219 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:49:33,220 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:49:33,262 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:49:34,301 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:49:34,301 INFO L272 AbstractInterpreter]: Visited 121 different actions 2818 times. Merged at 105 different actions 2224 times. Widened at 22 different actions 362 times. Performed 6833 root evaluator evaluations with a maximum evaluation depth of 6. Performed 6833 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 420 fixpoints after 29 different actions. Largest state had 101 variables. [2019-09-09 05:49:34,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:34,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:49:34,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:49:34,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:49:34,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:34,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:49:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:34,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 1517 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:49:34,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:49:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2019-09-09 05:49:35,000 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:49:35,417 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2019-09-09 05:49:35,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:49:35,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-09 05:49:35,422 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:49:35,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:49:35,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:49:35,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:49:35,423 INFO L87 Difference]: Start difference. First operand 3104 states and 4254 transitions. Second operand 4 states. [2019-09-09 05:49:35,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:35,643 INFO L93 Difference]: Finished difference Result 4128 states and 5642 transitions. [2019-09-09 05:49:35,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:49:35,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1020 [2019-09-09 05:49:35,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:35,652 INFO L225 Difference]: With dead ends: 4128 [2019-09-09 05:49:35,652 INFO L226 Difference]: Without dead ends: 3944 [2019-09-09 05:49:35,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2045 GetRequests, 2040 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-09 05:49:35,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3944 states. [2019-09-09 05:49:35,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3944 to 3104. [2019-09-09 05:49:35,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2019-09-09 05:49:35,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 4254 transitions. [2019-09-09 05:49:35,691 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 4254 transitions. Word has length 1020 [2019-09-09 05:49:35,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:35,692 INFO L475 AbstractCegarLoop]: Abstraction has 3104 states and 4254 transitions. [2019-09-09 05:49:35,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:49:35,692 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 4254 transitions. [2019-09-09 05:49:35,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1271 [2019-09-09 05:49:35,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:35,713 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 43, 43, 40, 40, 40, 36, 36, 32, 32, 28, 28, 24, 24, 24, 24, 20, 16, 16, 12, 12, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:35,713 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:35,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:35,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1521228414, now seen corresponding path program 1 times [2019-09-09 05:49:35,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:35,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:35,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:35,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:35,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:36,498 INFO L134 CoverageAnalysis]: Checked inductivity of 19529 backedges. 8440 proven. 0 refuted. 0 times theorem prover too weak. 11089 trivial. 0 not checked. [2019-09-09 05:49:36,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:36,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:36,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:36,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:36,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:36,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:36,501 INFO L87 Difference]: Start difference. First operand 3104 states and 4254 transitions. Second operand 3 states. [2019-09-09 05:49:36,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:36,636 INFO L93 Difference]: Finished difference Result 3254 states and 4421 transitions. [2019-09-09 05:49:36,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:36,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1270 [2019-09-09 05:49:36,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:36,643 INFO L225 Difference]: With dead ends: 3254 [2019-09-09 05:49:36,643 INFO L226 Difference]: Without dead ends: 3230 [2019-09-09 05:49:36,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-09 05:49:36,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2019-09-09 05:49:36,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 3160. [2019-09-09 05:49:36,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3160 states. [2019-09-09 05:49:36,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3160 states to 3160 states and 4313 transitions. [2019-09-09 05:49:36,680 INFO L78 Accepts]: Start accepts. Automaton has 3160 states and 4313 transitions. Word has length 1270 [2019-09-09 05:49:36,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:36,681 INFO L475 AbstractCegarLoop]: Abstraction has 3160 states and 4313 transitions. [2019-09-09 05:49:36,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:36,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3160 states and 4313 transitions. [2019-09-09 05:49:36,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1301 [2019-09-09 05:49:36,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:36,700 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 45, 45, 44, 44, 44, 44, 44, 44, 40, 40, 40, 36, 36, 32, 32, 28, 28, 24, 24, 24, 24, 20, 16, 16, 12, 12, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:36,701 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:36,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:36,701 INFO L82 PathProgramCache]: Analyzing trace with hash 492000992, now seen corresponding path program 1 times [2019-09-09 05:49:36,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:36,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:36,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:36,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:36,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:37,649 INFO L134 CoverageAnalysis]: Checked inductivity of 20156 backedges. 8432 proven. 0 refuted. 0 times theorem prover too weak. 11724 trivial. 0 not checked. [2019-09-09 05:49:37,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:37,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:37,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:37,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:37,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:37,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:37,652 INFO L87 Difference]: Start difference. First operand 3160 states and 4313 transitions. Second operand 3 states. [2019-09-09 05:49:37,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:37,777 INFO L93 Difference]: Finished difference Result 1026 states and 1337 transitions. [2019-09-09 05:49:37,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:37,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1300 [2019-09-09 05:49:37,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:37,778 INFO L225 Difference]: With dead ends: 1026 [2019-09-09 05:49:37,778 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:49:37,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-09 05:49:37,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:49:37,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:49:37,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:49:37,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:49:37,779 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1300 [2019-09-09 05:49:37,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:37,780 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:49:37,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:37,780 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:49:37,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:49:37,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:49:37 BoogieIcfgContainer [2019-09-09 05:49:37,786 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:49:37,789 INFO L168 Benchmark]: Toolchain (without parser) took 29614.62 ms. Allocated memory was 133.2 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 87.5 MB in the beginning and 1.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 167.9 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:37,790 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 133.2 MB. Free memory was 106.3 MB in the beginning and 106.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:49:37,791 INFO L168 Benchmark]: CACSL2BoogieTranslator took 522.36 ms. Allocated memory was 133.2 MB in the beginning and 201.3 MB in the end (delta: 68.2 MB). Free memory was 87.3 MB in the beginning and 175.0 MB in the end (delta: -87.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:37,791 INFO L168 Benchmark]: Boogie Preprocessor took 56.93 ms. Allocated memory is still 201.3 MB. Free memory was 175.0 MB in the beginning and 171.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:37,792 INFO L168 Benchmark]: RCFGBuilder took 855.99 ms. Allocated memory is still 201.3 MB. Free memory was 171.9 MB in the beginning and 121.1 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:37,793 INFO L168 Benchmark]: TraceAbstraction took 28174.76 ms. Allocated memory was 201.3 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 121.1 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 133.4 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:37,796 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 133.2 MB. Free memory was 106.3 MB in the beginning and 106.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 522.36 ms. Allocated memory was 133.2 MB in the beginning and 201.3 MB in the end (delta: 68.2 MB). Free memory was 87.3 MB in the beginning and 175.0 MB in the end (delta: -87.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.93 ms. Allocated memory is still 201.3 MB. Free memory was 175.0 MB in the beginning and 171.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 855.99 ms. Allocated memory is still 201.3 MB. Free memory was 171.9 MB in the beginning and 121.1 MB in the end (delta: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28174.76 ms. Allocated memory was 201.3 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 121.1 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 133.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 631]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 1 error locations. SAFE Result, 28.1s OverallTime, 39 OverallIterations, 46 TraceHistogramMax, 7.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7680 SDtfs, 12425 SDslu, 6773 SDs, 0 SdLazy, 5109 SolverSat, 1380 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7395 GetRequests, 7259 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3641occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 9.3s AbstIntTime, 7 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 39 MinimizatonAttempts, 1367 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 13857 NumberOfCodeBlocks, 13857 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 17402 ConstructedInterpolants, 0 QuantifiedInterpolants, 12996139 SizeOfPredicates, 5 NumberOfNonLiveVariables, 5884 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 53 InterpolantComputations, 42 PerfectInterpolantSequences, 116684/116970 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...