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/bitvector/s3_srvr_1.BV.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:44:24,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:44:24,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:44:24,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:44:24,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:44:24,540 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:44:24,541 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:44:24,543 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:44:24,545 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:44:24,546 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:44:24,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:44:24,548 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:44:24,548 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:44:24,549 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:44:24,550 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:44:24,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:44:24,553 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:44:24,554 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:44:24,555 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:44:24,557 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:44:24,559 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:44:24,560 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:44:24,561 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:44:24,562 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:44:24,564 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:44:24,565 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:44:24,565 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:44:24,566 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:44:24,566 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:44:24,567 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:44:24,567 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:44:24,568 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:44:24,569 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:44:24,570 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:44:24,571 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:44:24,571 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:44:24,572 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:44:24,572 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:44:24,572 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:44:24,573 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:44:24,574 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:44:24,575 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:44:24,596 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:44:24,596 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:44:24,596 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:44:24,596 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:44:24,597 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:44:24,597 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:44:24,598 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:44:24,598 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:44:24,598 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:44:24,598 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:44:24,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:44:24,599 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:44:24,599 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:44:24,600 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:44:24,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:44:24,600 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:44:24,600 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:44:24,600 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:44:24,601 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:44:24,601 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:44:24,601 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:44:24,601 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:44:24,601 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:44:24,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:44:24,602 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:44:24,602 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:44:24,602 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:44:24,603 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:44:24,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:44:24,603 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:44:24,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:44:24,644 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:44:24,648 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:44:24,649 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:44:24,650 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:44:24,651 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/s3_srvr_1.BV.c.cil.c [2019-09-09 05:44:24,720 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b10d83e2b/52bfb0ff896b44558c8d5871323dd8bf/FLAG38eb1a152 [2019-09-09 05:44:25,197 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:44:25,198 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_srvr_1.BV.c.cil.c [2019-09-09 05:44:25,214 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b10d83e2b/52bfb0ff896b44558c8d5871323dd8bf/FLAG38eb1a152 [2019-09-09 05:44:25,517 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b10d83e2b/52bfb0ff896b44558c8d5871323dd8bf [2019-09-09 05:44:25,525 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:44:25,527 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:44:25,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:44:25,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:44:25,532 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:44:25,533 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:44:25" (1/1) ... [2019-09-09 05:44:25,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aa16274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:25, skipping insertion in model container [2019-09-09 05:44:25,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:44:25" (1/1) ... [2019-09-09 05:44:25,544 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:44:25,593 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:44:25,855 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:44:25,862 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:44:26,012 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:44:26,027 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:44:26,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:26 WrapperNode [2019-09-09 05:44:26,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:44:26,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:44:26,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:44:26,029 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:44:26,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:26" (1/1) ... [2019-09-09 05:44:26,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:26" (1/1) ... [2019-09-09 05:44:26,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:26" (1/1) ... [2019-09-09 05:44:26,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:26" (1/1) ... [2019-09-09 05:44:26,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:26" (1/1) ... [2019-09-09 05:44:26,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:26" (1/1) ... [2019-09-09 05:44:26,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:26" (1/1) ... [2019-09-09 05:44:26,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:44:26,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:44:26,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:44:26,091 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:44:26,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:26" (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:44:26,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:44:26,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:44:26,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-09 05:44:26,160 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:44:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:44:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-09 05:44:26,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-09 05:44:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:44:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-09 05:44:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:44:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:44:26,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:44:26,428 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-09 05:44:27,001 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-09-09 05:44:27,002 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-09-09 05:44:27,004 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:44:27,004 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:44:27,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:44:27 BoogieIcfgContainer [2019-09-09 05:44:27,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:44:27,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:44:27,007 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:44:27,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:44:27,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:44:25" (1/3) ... [2019-09-09 05:44:27,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b19fe42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:44:27, skipping insertion in model container [2019-09-09 05:44:27,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:26" (2/3) ... [2019-09-09 05:44:27,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b19fe42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:44:27, skipping insertion in model container [2019-09-09 05:44:27,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:44:27" (3/3) ... [2019-09-09 05:44:27,014 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.BV.c.cil.c [2019-09-09 05:44:27,023 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:44:27,030 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:44:27,046 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:44:27,075 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:44:27,075 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:44:27,076 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:44:27,076 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:44:27,076 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:44:27,076 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:44:27,076 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:44:27,077 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:44:27,098 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-09-09 05:44:27,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-09 05:44:27,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:27,113 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, 1] [2019-09-09 05:44:27,116 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:27,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:27,120 INFO L82 PathProgramCache]: Analyzing trace with hash -948982516, now seen corresponding path program 1 times [2019-09-09 05:44:27,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:27,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:27,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:27,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:27,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:27,438 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:44:27,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:27,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:27,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:27,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:27,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:27,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:27,471 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 5 states. [2019-09-09 05:44:27,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:27,922 INFO L93 Difference]: Finished difference Result 202 states and 339 transitions. [2019-09-09 05:44:27,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:27,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-09-09 05:44:27,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:27,939 INFO L225 Difference]: With dead ends: 202 [2019-09-09 05:44:27,940 INFO L226 Difference]: Without dead ends: 179 [2019-09-09 05:44:27,942 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:44:27,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-09 05:44:28,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 173. [2019-09-09 05:44:28,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-09 05:44:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 279 transitions. [2019-09-09 05:44:28,022 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 279 transitions. Word has length 49 [2019-09-09 05:44:28,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:28,023 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 279 transitions. [2019-09-09 05:44:28,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:28,023 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 279 transitions. [2019-09-09 05:44:28,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-09 05:44:28,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:28,027 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, 1, 1] [2019-09-09 05:44:28,027 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:28,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:28,028 INFO L82 PathProgramCache]: Analyzing trace with hash 639336974, now seen corresponding path program 1 times [2019-09-09 05:44:28,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:28,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:28,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:28,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:28,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:28,119 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:44:28,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:28,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:28,120 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:28,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:28,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:28,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:28,123 INFO L87 Difference]: Start difference. First operand 173 states and 279 transitions. Second operand 5 states. [2019-09-09 05:44:28,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:28,449 INFO L93 Difference]: Finished difference Result 222 states and 366 transitions. [2019-09-09 05:44:28,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:28,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-09-09 05:44:28,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:28,453 INFO L225 Difference]: With dead ends: 222 [2019-09-09 05:44:28,454 INFO L226 Difference]: Without dead ends: 220 [2019-09-09 05:44:28,458 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:44:28,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-09-09 05:44:28,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 214. [2019-09-09 05:44:28,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-09-09 05:44:28,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 356 transitions. [2019-09-09 05:44:28,485 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 356 transitions. Word has length 50 [2019-09-09 05:44:28,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:28,489 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 356 transitions. [2019-09-09 05:44:28,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:28,489 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 356 transitions. [2019-09-09 05:44:28,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-09 05:44:28,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:28,497 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, 1, 1, 1] [2019-09-09 05:44:28,500 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:28,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:28,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1713661290, now seen corresponding path program 1 times [2019-09-09 05:44:28,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:28,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:28,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:28,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:28,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:28,613 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:44:28,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:28,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:28,614 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:28,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:28,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:28,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:28,616 INFO L87 Difference]: Start difference. First operand 214 states and 356 transitions. Second operand 5 states. [2019-09-09 05:44:28,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:28,899 INFO L93 Difference]: Finished difference Result 245 states and 412 transitions. [2019-09-09 05:44:28,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:28,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-09 05:44:28,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:28,902 INFO L225 Difference]: With dead ends: 245 [2019-09-09 05:44:28,902 INFO L226 Difference]: Without dead ends: 245 [2019-09-09 05:44:28,902 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:44:28,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-09-09 05:44:28,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2019-09-09 05:44:28,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-09-09 05:44:28,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 412 transitions. [2019-09-09 05:44:28,915 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 412 transitions. Word has length 78 [2019-09-09 05:44:28,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:28,916 INFO L475 AbstractCegarLoop]: Abstraction has 245 states and 412 transitions. [2019-09-09 05:44:28,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:28,916 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 412 transitions. [2019-09-09 05:44:28,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-09 05:44:28,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:28,919 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, 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:44:28,919 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:28,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:28,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1660004957, now seen corresponding path program 1 times [2019-09-09 05:44:28,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:28,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:28,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:28,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:28,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:29,034 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:44:29,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:29,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:29,035 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:29,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:29,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:29,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:29,038 INFO L87 Difference]: Start difference. First operand 245 states and 412 transitions. Second operand 5 states. [2019-09-09 05:44:29,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:29,310 INFO L93 Difference]: Finished difference Result 291 states and 492 transitions. [2019-09-09 05:44:29,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:29,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-09 05:44:29,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:29,313 INFO L225 Difference]: With dead ends: 291 [2019-09-09 05:44:29,313 INFO L226 Difference]: Without dead ends: 291 [2019-09-09 05:44:29,314 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:44:29,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-09-09 05:44:29,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 287. [2019-09-09 05:44:29,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-09-09 05:44:29,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 487 transitions. [2019-09-09 05:44:29,327 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 487 transitions. Word has length 89 [2019-09-09 05:44:29,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:29,328 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 487 transitions. [2019-09-09 05:44:29,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:29,328 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 487 transitions. [2019-09-09 05:44:29,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-09 05:44:29,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:29,330 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, 1, 1, 1] [2019-09-09 05:44:29,330 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:29,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:29,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1058858944, now seen corresponding path program 1 times [2019-09-09 05:44:29,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:29,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:29,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:29,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:29,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:29,433 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:44:29,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:29,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:29,434 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:29,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:29,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:29,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:29,435 INFO L87 Difference]: Start difference. First operand 287 states and 487 transitions. Second operand 5 states. [2019-09-09 05:44:29,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:29,616 INFO L93 Difference]: Finished difference Result 304 states and 511 transitions. [2019-09-09 05:44:29,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:29,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-09 05:44:29,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:29,619 INFO L225 Difference]: With dead ends: 304 [2019-09-09 05:44:29,619 INFO L226 Difference]: Without dead ends: 304 [2019-09-09 05:44:29,620 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:44:29,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-09 05:44:29,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 302. [2019-09-09 05:44:29,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-09-09 05:44:29,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 509 transitions. [2019-09-09 05:44:29,630 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 509 transitions. Word has length 90 [2019-09-09 05:44:29,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:29,630 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 509 transitions. [2019-09-09 05:44:29,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:29,630 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 509 transitions. [2019-09-09 05:44:29,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-09 05:44:29,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:29,632 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, 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:44:29,633 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:29,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:29,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1040164165, now seen corresponding path program 1 times [2019-09-09 05:44:29,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:29,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:29,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:29,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:29,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:29,708 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:44:29,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:29,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:29,709 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:29,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:29,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:29,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:29,712 INFO L87 Difference]: Start difference. First operand 302 states and 509 transitions. Second operand 5 states. [2019-09-09 05:44:29,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:29,948 INFO L93 Difference]: Finished difference Result 306 states and 512 transitions. [2019-09-09 05:44:29,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:29,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-09 05:44:29,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:29,954 INFO L225 Difference]: With dead ends: 306 [2019-09-09 05:44:29,955 INFO L226 Difference]: Without dead ends: 304 [2019-09-09 05:44:29,956 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:44:29,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-09-09 05:44:29,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 300. [2019-09-09 05:44:29,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-09-09 05:44:29,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 504 transitions. [2019-09-09 05:44:29,967 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 504 transitions. Word has length 90 [2019-09-09 05:44:29,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:29,967 INFO L475 AbstractCegarLoop]: Abstraction has 300 states and 504 transitions. [2019-09-09 05:44:29,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:29,968 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 504 transitions. [2019-09-09 05:44:29,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-09 05:44:29,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:29,969 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, 1, 1, 1] [2019-09-09 05:44:29,970 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:29,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:29,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1692234905, now seen corresponding path program 1 times [2019-09-09 05:44:29,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:29,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:29,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:29,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:29,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:30,076 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:44:30,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:30,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:30,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:30,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:30,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:30,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:30,078 INFO L87 Difference]: Start difference. First operand 300 states and 504 transitions. Second operand 5 states. [2019-09-09 05:44:30,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:30,299 INFO L93 Difference]: Finished difference Result 302 states and 502 transitions. [2019-09-09 05:44:30,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:30,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-09 05:44:30,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:30,303 INFO L225 Difference]: With dead ends: 302 [2019-09-09 05:44:30,303 INFO L226 Difference]: Without dead ends: 302 [2019-09-09 05:44:30,304 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:44:30,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-09-09 05:44:30,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2019-09-09 05:44:30,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-09-09 05:44:30,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 500 transitions. [2019-09-09 05:44:30,312 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 500 transitions. Word has length 91 [2019-09-09 05:44:30,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:30,313 INFO L475 AbstractCegarLoop]: Abstraction has 300 states and 500 transitions. [2019-09-09 05:44:30,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:30,313 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 500 transitions. [2019-09-09 05:44:30,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-09 05:44:30,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:30,315 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, 1, 1, 1] [2019-09-09 05:44:30,315 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:30,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:30,315 INFO L82 PathProgramCache]: Analyzing trace with hash 198952289, now seen corresponding path program 1 times [2019-09-09 05:44:30,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:30,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:30,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:30,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:30,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:30,379 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:44:30,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:30,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:30,380 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:30,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:30,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:30,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:30,382 INFO L87 Difference]: Start difference. First operand 300 states and 500 transitions. Second operand 5 states. [2019-09-09 05:44:30,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:30,544 INFO L93 Difference]: Finished difference Result 308 states and 505 transitions. [2019-09-09 05:44:30,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:30,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-09 05:44:30,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:30,547 INFO L225 Difference]: With dead ends: 308 [2019-09-09 05:44:30,547 INFO L226 Difference]: Without dead ends: 308 [2019-09-09 05:44:30,547 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:44:30,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-09 05:44:30,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2019-09-09 05:44:30,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-09-09 05:44:30,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 505 transitions. [2019-09-09 05:44:30,555 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 505 transitions. Word has length 103 [2019-09-09 05:44:30,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:30,556 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 505 transitions. [2019-09-09 05:44:30,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:30,556 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 505 transitions. [2019-09-09 05:44:30,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-09 05:44:30,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:30,558 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, 1, 1, 1] [2019-09-09 05:44:30,558 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:30,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:30,558 INFO L82 PathProgramCache]: Analyzing trace with hash -169263683, now seen corresponding path program 1 times [2019-09-09 05:44:30,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:30,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:30,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:30,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:30,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:30,631 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:44:30,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:30,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:30,631 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:30,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:30,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:30,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:30,632 INFO L87 Difference]: Start difference. First operand 308 states and 505 transitions. Second operand 5 states. [2019-09-09 05:44:30,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:30,843 INFO L93 Difference]: Finished difference Result 339 states and 554 transitions. [2019-09-09 05:44:30,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:30,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-09 05:44:30,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:30,846 INFO L225 Difference]: With dead ends: 339 [2019-09-09 05:44:30,847 INFO L226 Difference]: Without dead ends: 339 [2019-09-09 05:44:30,848 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:44:30,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-09-09 05:44:30,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2019-09-09 05:44:30,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-09-09 05:44:30,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 552 transitions. [2019-09-09 05:44:30,857 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 552 transitions. Word has length 104 [2019-09-09 05:44:30,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:30,859 INFO L475 AbstractCegarLoop]: Abstraction has 337 states and 552 transitions. [2019-09-09 05:44:30,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:30,859 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 552 transitions. [2019-09-09 05:44:30,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 05:44:30,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:30,861 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, 1, 1] [2019-09-09 05:44:30,862 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:30,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:30,862 INFO L82 PathProgramCache]: Analyzing trace with hash -234646114, now seen corresponding path program 1 times [2019-09-09 05:44:30,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:30,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:30,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:30,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:30,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:30,964 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:44:30,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:30,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:30,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:30,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:30,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:30,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:30,968 INFO L87 Difference]: Start difference. First operand 337 states and 552 transitions. Second operand 5 states. [2019-09-09 05:44:31,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:31,174 INFO L93 Difference]: Finished difference Result 371 states and 606 transitions. [2019-09-09 05:44:31,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:31,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-09 05:44:31,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:31,179 INFO L225 Difference]: With dead ends: 371 [2019-09-09 05:44:31,180 INFO L226 Difference]: Without dead ends: 371 [2019-09-09 05:44:31,180 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:44:31,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-09-09 05:44:31,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 364. [2019-09-09 05:44:31,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-09 05:44:31,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 594 transitions. [2019-09-09 05:44:31,190 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 594 transitions. Word has length 105 [2019-09-09 05:44:31,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:31,191 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 594 transitions. [2019-09-09 05:44:31,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:31,191 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 594 transitions. [2019-09-09 05:44:31,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-09 05:44:31,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:31,193 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, 1, 1, 1] [2019-09-09 05:44:31,193 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:31,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:31,193 INFO L82 PathProgramCache]: Analyzing trace with hash -331146, now seen corresponding path program 1 times [2019-09-09 05:44:31,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:31,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:31,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:31,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:31,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:31,293 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:44:31,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:31,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:31,294 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:31,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:31,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:31,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:31,295 INFO L87 Difference]: Start difference. First operand 364 states and 594 transitions. Second operand 5 states. [2019-09-09 05:44:31,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:31,506 INFO L93 Difference]: Finished difference Result 366 states and 592 transitions. [2019-09-09 05:44:31,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:31,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-09 05:44:31,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:31,509 INFO L225 Difference]: With dead ends: 366 [2019-09-09 05:44:31,510 INFO L226 Difference]: Without dead ends: 366 [2019-09-09 05:44:31,510 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:44:31,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-09-09 05:44:31,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 364. [2019-09-09 05:44:31,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-09 05:44:31,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 590 transitions. [2019-09-09 05:44:31,521 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 590 transitions. Word has length 105 [2019-09-09 05:44:31,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:31,522 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 590 transitions. [2019-09-09 05:44:31,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:31,522 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 590 transitions. [2019-09-09 05:44:31,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-09 05:44:31,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:31,524 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, 1, 1] [2019-09-09 05:44:31,525 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:31,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:31,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1028122779, now seen corresponding path program 1 times [2019-09-09 05:44:31,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:31,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:31,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:31,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:31,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:31,589 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:44:31,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:31,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:31,590 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:31,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:31,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:31,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:31,591 INFO L87 Difference]: Start difference. First operand 364 states and 590 transitions. Second operand 5 states. [2019-09-09 05:44:31,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:31,845 INFO L93 Difference]: Finished difference Result 371 states and 597 transitions. [2019-09-09 05:44:31,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:31,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-09 05:44:31,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:31,849 INFO L225 Difference]: With dead ends: 371 [2019-09-09 05:44:31,849 INFO L226 Difference]: Without dead ends: 371 [2019-09-09 05:44:31,850 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:44:31,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-09-09 05:44:31,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 364. [2019-09-09 05:44:31,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-09-09 05:44:31,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 585 transitions. [2019-09-09 05:44:31,864 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 585 transitions. Word has length 106 [2019-09-09 05:44:31,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:31,864 INFO L475 AbstractCegarLoop]: Abstraction has 364 states and 585 transitions. [2019-09-09 05:44:31,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:31,865 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 585 transitions. [2019-09-09 05:44:31,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-09 05:44:31,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:31,868 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:31,868 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:31,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:31,869 INFO L82 PathProgramCache]: Analyzing trace with hash 230308236, now seen corresponding path program 1 times [2019-09-09 05:44:31,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:31,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:31,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:31,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:31,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:31,939 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-09 05:44:31,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:31,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:31,940 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:31,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:31,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:31,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:31,942 INFO L87 Difference]: Start difference. First operand 364 states and 585 transitions. Second operand 5 states. [2019-09-09 05:44:32,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:32,202 INFO L93 Difference]: Finished difference Result 389 states and 620 transitions. [2019-09-09 05:44:32,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:32,203 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-09 05:44:32,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:32,206 INFO L225 Difference]: With dead ends: 389 [2019-09-09 05:44:32,206 INFO L226 Difference]: Without dead ends: 389 [2019-09-09 05:44:32,207 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:44:32,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-09-09 05:44:32,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 385. [2019-09-09 05:44:32,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-09-09 05:44:32,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 614 transitions. [2019-09-09 05:44:32,222 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 614 transitions. Word has length 110 [2019-09-09 05:44:32,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:32,222 INFO L475 AbstractCegarLoop]: Abstraction has 385 states and 614 transitions. [2019-09-09 05:44:32,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:32,223 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 614 transitions. [2019-09-09 05:44:32,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-09 05:44:32,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:32,226 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:32,226 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:32,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:32,227 INFO L82 PathProgramCache]: Analyzing trace with hash 463847941, now seen corresponding path program 1 times [2019-09-09 05:44:32,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:32,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:32,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:32,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:32,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:32,313 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-09 05:44:32,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:32,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:32,314 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:32,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:32,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:32,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:32,316 INFO L87 Difference]: Start difference. First operand 385 states and 614 transitions. Second operand 5 states. [2019-09-09 05:44:32,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:32,550 INFO L93 Difference]: Finished difference Result 389 states and 614 transitions. [2019-09-09 05:44:32,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:32,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-09-09 05:44:32,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:32,553 INFO L225 Difference]: With dead ends: 389 [2019-09-09 05:44:32,554 INFO L226 Difference]: Without dead ends: 389 [2019-09-09 05:44:32,554 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:44:32,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-09-09 05:44:32,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 385. [2019-09-09 05:44:32,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-09-09 05:44:32,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 608 transitions. [2019-09-09 05:44:32,565 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 608 transitions. Word has length 111 [2019-09-09 05:44:32,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:32,565 INFO L475 AbstractCegarLoop]: Abstraction has 385 states and 608 transitions. [2019-09-09 05:44:32,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:32,566 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 608 transitions. [2019-09-09 05:44:32,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-09 05:44:32,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:32,568 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:32,568 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:32,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:32,569 INFO L82 PathProgramCache]: Analyzing trace with hash 320501393, now seen corresponding path program 1 times [2019-09-09 05:44:32,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:32,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:32,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:32,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:32,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:32,649 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-09 05:44:32,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:32,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:44:32,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:32,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:44:32,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:44:32,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:44:32,651 INFO L87 Difference]: Start difference. First operand 385 states and 608 transitions. Second operand 3 states. [2019-09-09 05:44:32,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:32,689 INFO L93 Difference]: Finished difference Result 755 states and 1196 transitions. [2019-09-09 05:44:32,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:44:32,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-09-09 05:44:32,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:32,694 INFO L225 Difference]: With dead ends: 755 [2019-09-09 05:44:32,694 INFO L226 Difference]: Without dead ends: 755 [2019-09-09 05:44:32,696 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:44:32,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-09-09 05:44:32,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2019-09-09 05:44:32,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-09-09 05:44:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1196 transitions. [2019-09-09 05:44:32,715 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1196 transitions. Word has length 126 [2019-09-09 05:44:32,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:32,716 INFO L475 AbstractCegarLoop]: Abstraction has 755 states and 1196 transitions. [2019-09-09 05:44:32,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:44:32,716 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1196 transitions. [2019-09-09 05:44:32,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-09 05:44:32,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:32,719 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, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:32,719 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:32,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:32,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1956483377, now seen corresponding path program 1 times [2019-09-09 05:44:32,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:32,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:32,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:32,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:32,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:32,775 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-09 05:44:32,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:32,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:32,778 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:32,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:32,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:32,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:32,779 INFO L87 Difference]: Start difference. First operand 755 states and 1196 transitions. Second operand 5 states. [2019-09-09 05:44:32,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:32,999 INFO L93 Difference]: Finished difference Result 839 states and 1326 transitions. [2019-09-09 05:44:32,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:32,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2019-09-09 05:44:33,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:33,004 INFO L225 Difference]: With dead ends: 839 [2019-09-09 05:44:33,004 INFO L226 Difference]: Without dead ends: 839 [2019-09-09 05:44:33,005 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:44:33,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-09-09 05:44:33,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 831. [2019-09-09 05:44:33,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-09-09 05:44:33,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1314 transitions. [2019-09-09 05:44:33,024 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1314 transitions. Word has length 127 [2019-09-09 05:44:33,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:33,025 INFO L475 AbstractCegarLoop]: Abstraction has 831 states and 1314 transitions. [2019-09-09 05:44:33,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:33,025 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1314 transitions. [2019-09-09 05:44:33,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-09 05:44:33,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:33,028 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, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:33,028 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:33,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:33,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1860303249, now seen corresponding path program 1 times [2019-09-09 05:44:33,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:33,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:33,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:33,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:33,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:33,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:33,086 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-09 05:44:33,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:33,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:33,086 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:33,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:33,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:33,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:33,087 INFO L87 Difference]: Start difference. First operand 831 states and 1314 transitions. Second operand 5 states. [2019-09-09 05:44:33,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:33,315 INFO L93 Difference]: Finished difference Result 839 states and 1320 transitions. [2019-09-09 05:44:33,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:33,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2019-09-09 05:44:33,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:33,320 INFO L225 Difference]: With dead ends: 839 [2019-09-09 05:44:33,320 INFO L226 Difference]: Without dead ends: 835 [2019-09-09 05:44:33,321 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:44:33,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2019-09-09 05:44:33,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 827. [2019-09-09 05:44:33,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2019-09-09 05:44:33,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1302 transitions. [2019-09-09 05:44:33,345 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1302 transitions. Word has length 128 [2019-09-09 05:44:33,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:33,346 INFO L475 AbstractCegarLoop]: Abstraction has 827 states and 1302 transitions. [2019-09-09 05:44:33,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:33,346 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1302 transitions. [2019-09-09 05:44:33,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-09 05:44:33,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:33,351 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, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:33,351 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:33,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:33,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1660162814, now seen corresponding path program 1 times [2019-09-09 05:44:33,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:33,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:33,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:33,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:33,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:33,437 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-09 05:44:33,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:33,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:33,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:33,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:33,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:33,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:33,439 INFO L87 Difference]: Start difference. First operand 827 states and 1302 transitions. Second operand 5 states. [2019-09-09 05:44:33,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:33,690 INFO L93 Difference]: Finished difference Result 903 states and 1414 transitions. [2019-09-09 05:44:33,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:33,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2019-09-09 05:44:33,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:33,696 INFO L225 Difference]: With dead ends: 903 [2019-09-09 05:44:33,696 INFO L226 Difference]: Without dead ends: 903 [2019-09-09 05:44:33,696 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:44:33,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-09-09 05:44:33,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 899. [2019-09-09 05:44:33,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2019-09-09 05:44:33,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1410 transitions. [2019-09-09 05:44:33,718 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1410 transitions. Word has length 160 [2019-09-09 05:44:33,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:33,718 INFO L475 AbstractCegarLoop]: Abstraction has 899 states and 1410 transitions. [2019-09-09 05:44:33,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:33,718 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1410 transitions. [2019-09-09 05:44:33,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-09 05:44:33,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:33,723 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, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:33,724 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:33,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:33,724 INFO L82 PathProgramCache]: Analyzing trace with hash 2130714588, now seen corresponding path program 1 times [2019-09-09 05:44:33,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:33,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:33,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:33,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:33,726 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:33,793 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-09 05:44:33,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:33,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:33,794 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:33,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:33,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:33,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:33,796 INFO L87 Difference]: Start difference. First operand 899 states and 1410 transitions. Second operand 5 states. [2019-09-09 05:44:34,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:34,002 INFO L93 Difference]: Finished difference Result 903 states and 1406 transitions. [2019-09-09 05:44:34,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:34,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-09-09 05:44:34,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:34,007 INFO L225 Difference]: With dead ends: 903 [2019-09-09 05:44:34,007 INFO L226 Difference]: Without dead ends: 899 [2019-09-09 05:44:34,008 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:44:34,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-09-09 05:44:34,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 895. [2019-09-09 05:44:34,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-09-09 05:44:34,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1396 transitions. [2019-09-09 05:44:34,030 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1396 transitions. Word has length 161 [2019-09-09 05:44:34,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:34,030 INFO L475 AbstractCegarLoop]: Abstraction has 895 states and 1396 transitions. [2019-09-09 05:44:34,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:34,030 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1396 transitions. [2019-09-09 05:44:34,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-09 05:44:34,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:34,034 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:34,034 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:34,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:34,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1010138548, now seen corresponding path program 1 times [2019-09-09 05:44:34,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:34,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:34,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:34,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:34,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:34,105 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-09-09 05:44:34,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:34,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:34,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:34,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:34,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:34,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:34,107 INFO L87 Difference]: Start difference. First operand 895 states and 1396 transitions. Second operand 5 states. [2019-09-09 05:44:34,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:34,321 INFO L93 Difference]: Finished difference Result 967 states and 1498 transitions. [2019-09-09 05:44:34,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:34,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2019-09-09 05:44:34,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:34,326 INFO L225 Difference]: With dead ends: 967 [2019-09-09 05:44:34,326 INFO L226 Difference]: Without dead ends: 967 [2019-09-09 05:44:34,327 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:44:34,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2019-09-09 05:44:34,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 963. [2019-09-09 05:44:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-09-09 05:44:34,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1494 transitions. [2019-09-09 05:44:34,349 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1494 transitions. Word has length 191 [2019-09-09 05:44:34,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:34,350 INFO L475 AbstractCegarLoop]: Abstraction has 963 states and 1494 transitions. [2019-09-09 05:44:34,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:34,350 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1494 transitions. [2019-09-09 05:44:34,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-09 05:44:34,371 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:34,371 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:34,371 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:34,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:34,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1298396746, now seen corresponding path program 1 times [2019-09-09 05:44:34,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:34,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:34,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:34,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:34,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:34,436 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-09-09 05:44:34,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:34,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:34,437 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:34,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:34,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:34,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:34,439 INFO L87 Difference]: Start difference. First operand 963 states and 1494 transitions. Second operand 5 states. [2019-09-09 05:44:34,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:34,639 INFO L93 Difference]: Finished difference Result 967 states and 1488 transitions. [2019-09-09 05:44:34,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:34,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 192 [2019-09-09 05:44:34,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:34,645 INFO L225 Difference]: With dead ends: 967 [2019-09-09 05:44:34,645 INFO L226 Difference]: Without dead ends: 963 [2019-09-09 05:44:34,645 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:44:34,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-09-09 05:44:34,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 959. [2019-09-09 05:44:34,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2019-09-09 05:44:34,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1478 transitions. [2019-09-09 05:44:34,664 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1478 transitions. Word has length 192 [2019-09-09 05:44:34,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:34,665 INFO L475 AbstractCegarLoop]: Abstraction has 959 states and 1478 transitions. [2019-09-09 05:44:34,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:34,665 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1478 transitions. [2019-09-09 05:44:34,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-09 05:44:34,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:34,669 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:34,669 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:34,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:34,670 INFO L82 PathProgramCache]: Analyzing trace with hash 951429877, now seen corresponding path program 1 times [2019-09-09 05:44:34,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:34,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:34,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:34,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:34,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:34,766 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-09-09 05:44:34,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:34,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:34,767 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:34,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:34,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:34,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:34,769 INFO L87 Difference]: Start difference. First operand 959 states and 1478 transitions. Second operand 5 states. [2019-09-09 05:44:34,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:34,956 INFO L93 Difference]: Finished difference Result 1033 states and 1582 transitions. [2019-09-09 05:44:34,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:34,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 209 [2019-09-09 05:44:34,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:34,962 INFO L225 Difference]: With dead ends: 1033 [2019-09-09 05:44:34,962 INFO L226 Difference]: Without dead ends: 1033 [2019-09-09 05:44:34,962 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:44:34,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2019-09-09 05:44:34,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1009. [2019-09-09 05:44:34,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-09-09 05:44:34,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1542 transitions. [2019-09-09 05:44:34,981 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1542 transitions. Word has length 209 [2019-09-09 05:44:34,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:34,981 INFO L475 AbstractCegarLoop]: Abstraction has 1009 states and 1542 transitions. [2019-09-09 05:44:34,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:34,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1542 transitions. [2019-09-09 05:44:34,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-09 05:44:34,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:34,985 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:34,985 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:34,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:34,986 INFO L82 PathProgramCache]: Analyzing trace with hash -265008868, now seen corresponding path program 1 times [2019-09-09 05:44:34,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:34,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:34,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:34,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:34,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:35,078 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-09-09 05:44:35,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:35,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:35,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:35,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:35,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:35,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:35,080 INFO L87 Difference]: Start difference. First operand 1009 states and 1542 transitions. Second operand 5 states. [2019-09-09 05:44:35,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:35,270 INFO L93 Difference]: Finished difference Result 1033 states and 1564 transitions. [2019-09-09 05:44:35,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:35,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-09 05:44:35,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:35,277 INFO L225 Difference]: With dead ends: 1033 [2019-09-09 05:44:35,277 INFO L226 Difference]: Without dead ends: 1033 [2019-09-09 05:44:35,278 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:44:35,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2019-09-09 05:44:35,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1009. [2019-09-09 05:44:35,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-09-09 05:44:35,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1524 transitions. [2019-09-09 05:44:35,297 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1524 transitions. Word has length 210 [2019-09-09 05:44:35,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:35,297 INFO L475 AbstractCegarLoop]: Abstraction has 1009 states and 1524 transitions. [2019-09-09 05:44:35,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:35,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1524 transitions. [2019-09-09 05:44:35,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-09 05:44:35,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:35,302 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:35,302 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:35,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:35,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1913113250, now seen corresponding path program 1 times [2019-09-09 05:44:35,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:35,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:35,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:35,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:35,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:35,371 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-09-09 05:44:35,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:35,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:35,371 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:35,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:35,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:35,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:35,373 INFO L87 Difference]: Start difference. First operand 1009 states and 1524 transitions. Second operand 5 states. [2019-09-09 05:44:35,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:35,571 INFO L93 Difference]: Finished difference Result 1017 states and 1522 transitions. [2019-09-09 05:44:35,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:35,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 222 [2019-09-09 05:44:35,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:35,576 INFO L225 Difference]: With dead ends: 1017 [2019-09-09 05:44:35,576 INFO L226 Difference]: Without dead ends: 1017 [2019-09-09 05:44:35,577 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:44:35,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2019-09-09 05:44:35,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1009. [2019-09-09 05:44:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-09-09 05:44:35,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1512 transitions. [2019-09-09 05:44:35,597 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1512 transitions. Word has length 222 [2019-09-09 05:44:35,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:35,597 INFO L475 AbstractCegarLoop]: Abstraction has 1009 states and 1512 transitions. [2019-09-09 05:44:35,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:35,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1512 transitions. [2019-09-09 05:44:35,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-09 05:44:35,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:35,601 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:35,602 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:35,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:35,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1682245756, now seen corresponding path program 1 times [2019-09-09 05:44:35,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:35,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:35,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:35,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:35,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:35,669 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-09-09 05:44:35,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:35,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:35,670 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:35,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:35,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:35,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:35,671 INFO L87 Difference]: Start difference. First operand 1009 states and 1512 transitions. Second operand 5 states. [2019-09-09 05:44:35,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:35,887 INFO L93 Difference]: Finished difference Result 1017 states and 1510 transitions. [2019-09-09 05:44:35,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:35,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2019-09-09 05:44:35,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:35,892 INFO L225 Difference]: With dead ends: 1017 [2019-09-09 05:44:35,892 INFO L226 Difference]: Without dead ends: 999 [2019-09-09 05:44:35,892 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:44:35,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2019-09-09 05:44:35,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 991. [2019-09-09 05:44:35,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-09-09 05:44:35,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1474 transitions. [2019-09-09 05:44:35,909 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1474 transitions. Word has length 223 [2019-09-09 05:44:35,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:35,909 INFO L475 AbstractCegarLoop]: Abstraction has 991 states and 1474 transitions. [2019-09-09 05:44:35,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:35,910 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1474 transitions. [2019-09-09 05:44:35,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-09 05:44:35,913 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:35,914 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:35,914 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:35,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:35,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1887918499, now seen corresponding path program 1 times [2019-09-09 05:44:35,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:35,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:35,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:35,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:35,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:35,993 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-09-09 05:44:35,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:35,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:35,993 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:35,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:35,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:35,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:35,995 INFO L87 Difference]: Start difference. First operand 991 states and 1474 transitions. Second operand 5 states. [2019-09-09 05:44:36,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:36,161 INFO L93 Difference]: Finished difference Result 1043 states and 1536 transitions. [2019-09-09 05:44:36,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:36,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 229 [2019-09-09 05:44:36,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:36,166 INFO L225 Difference]: With dead ends: 1043 [2019-09-09 05:44:36,166 INFO L226 Difference]: Without dead ends: 1043 [2019-09-09 05:44:36,166 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:44:36,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-09-09 05:44:36,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1037. [2019-09-09 05:44:36,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2019-09-09 05:44:36,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1528 transitions. [2019-09-09 05:44:36,190 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1528 transitions. Word has length 229 [2019-09-09 05:44:36,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:36,190 INFO L475 AbstractCegarLoop]: Abstraction has 1037 states and 1528 transitions. [2019-09-09 05:44:36,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:36,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1528 transitions. [2019-09-09 05:44:36,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-09 05:44:36,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:36,194 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:36,194 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:36,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:36,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1997667754, now seen corresponding path program 1 times [2019-09-09 05:44:36,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:36,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:36,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:36,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:36,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:36,274 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-09-09 05:44:36,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:36,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:44:36,275 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:36,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:44:36,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:44:36,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:36,276 INFO L87 Difference]: Start difference. First operand 1037 states and 1528 transitions. Second operand 5 states. [2019-09-09 05:44:36,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:36,447 INFO L93 Difference]: Finished difference Result 1043 states and 1516 transitions. [2019-09-09 05:44:36,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:44:36,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 230 [2019-09-09 05:44:36,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:36,452 INFO L225 Difference]: With dead ends: 1043 [2019-09-09 05:44:36,452 INFO L226 Difference]: Without dead ends: 1035 [2019-09-09 05:44:36,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:44:36,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2019-09-09 05:44:36,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1029. [2019-09-09 05:44:36,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1029 states. [2019-09-09 05:44:36,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1496 transitions. [2019-09-09 05:44:36,471 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1496 transitions. Word has length 230 [2019-09-09 05:44:36,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:36,471 INFO L475 AbstractCegarLoop]: Abstraction has 1029 states and 1496 transitions. [2019-09-09 05:44:36,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:44:36,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1496 transitions. [2019-09-09 05:44:36,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-09 05:44:36,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:36,477 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:36,477 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:36,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:36,478 INFO L82 PathProgramCache]: Analyzing trace with hash -78304049, now seen corresponding path program 1 times [2019-09-09 05:44:36,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:36,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:36,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:36,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:36,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:36,678 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 466 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-09-09 05:44:36,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:44:36,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:44:36,680 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 267 with the following transitions: [2019-09-09 05:44:36,683 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [116], [118], [123], [126], [128], [133], [136], [138], [143], [148], [153], [156], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [278], [281], [289], [291], [294], [302], [307], [309], [313], [322], [324], [327], [333], [362], [367], [377], [381], [392], [403], [405], [410], [423], [433], [435], [469], [472], [480], [485], [487], [489], [494], [499], [505], [510], [512], [515], [588], [590], [603], [608], [609], [610], [612] [2019-09-09 05:44:36,774 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:44:36,775 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:44:37,254 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:44:37,813 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 05:44:37,817 INFO L272 AbstractInterpreter]: Visited 89 different actions 428 times. Merged at 66 different actions 298 times. Widened at 7 different actions 13 times. Performed 973 root evaluator evaluations with a maximum evaluation depth of 5. Performed 973 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 22 fixpoints after 8 different actions. Largest state had 86 variables. [2019-09-09 05:44:37,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:37,824 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 05:44:38,726 INFO L227 lantSequenceWeakener]: Weakened 8 states. On average, predicates are now at 90.18% of their original sizes. [2019-09-09 05:44:38,726 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 05:44:43,511 INFO L420 sIntCurrentIteration]: We unified 265 AI predicates to 265 [2019-09-09 05:44:43,511 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 05:44:43,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:44:43,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [49] imperfect sequences [4] total 51 [2019-09-09 05:44:43,513 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:43,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-09 05:44:43,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-09 05:44:43,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=1789, Unknown=0, NotChecked=0, Total=2352 [2019-09-09 05:44:43,516 INFO L87 Difference]: Start difference. First operand 1029 states and 1496 transitions. Second operand 49 states. [2019-09-09 05:45:25,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:25,798 INFO L93 Difference]: Finished difference Result 2572 states and 3676 transitions. [2019-09-09 05:45:25,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-09 05:45:25,798 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 266 [2019-09-09 05:45:25,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:25,811 INFO L225 Difference]: With dead ends: 2572 [2019-09-09 05:45:25,811 INFO L226 Difference]: Without dead ends: 2572 [2019-09-09 05:45:25,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 204 SyntacticMatches, 14 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2354 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=1708, Invalid=3992, Unknown=0, NotChecked=0, Total=5700 [2019-09-09 05:45:25,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2019-09-09 05:45:25,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 1910. [2019-09-09 05:45:25,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2019-09-09 05:45:25,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2753 transitions. [2019-09-09 05:45:25,856 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2753 transitions. Word has length 266 [2019-09-09 05:45:25,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:25,857 INFO L475 AbstractCegarLoop]: Abstraction has 1910 states and 2753 transitions. [2019-09-09 05:45:25,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-09 05:45:25,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2753 transitions. [2019-09-09 05:45:25,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-09 05:45:25,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:25,863 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:25,863 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:25,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:25,864 INFO L82 PathProgramCache]: Analyzing trace with hash 951090743, now seen corresponding path program 1 times [2019-09-09 05:45:25,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:25,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:25,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:25,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:25,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:26,013 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-09 05:45:26,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:26,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:45:26,014 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:26,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:26,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:26,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:26,017 INFO L87 Difference]: Start difference. First operand 1910 states and 2753 transitions. Second operand 3 states. [2019-09-09 05:45:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:26,050 INFO L93 Difference]: Finished difference Result 3376 states and 4869 transitions. [2019-09-09 05:45:26,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:26,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 276 [2019-09-09 05:45:26,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:26,069 INFO L225 Difference]: With dead ends: 3376 [2019-09-09 05:45:26,070 INFO L226 Difference]: Without dead ends: 3376 [2019-09-09 05:45:26,072 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:45:26,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3376 states. [2019-09-09 05:45:26,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3376 to 3374. [2019-09-09 05:45:26,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3374 states. [2019-09-09 05:45:26,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3374 states to 3374 states and 4868 transitions. [2019-09-09 05:45:26,151 INFO L78 Accepts]: Start accepts. Automaton has 3374 states and 4868 transitions. Word has length 276 [2019-09-09 05:45:26,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:26,152 INFO L475 AbstractCegarLoop]: Abstraction has 3374 states and 4868 transitions. [2019-09-09 05:45:26,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:26,152 INFO L276 IsEmpty]: Start isEmpty. Operand 3374 states and 4868 transitions. [2019-09-09 05:45:26,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-09 05:45:26,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:26,166 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:26,166 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:26,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:26,167 INFO L82 PathProgramCache]: Analyzing trace with hash 315092223, now seen corresponding path program 1 times [2019-09-09 05:45:26,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:26,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:26,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:26,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:26,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:26,274 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-09-09 05:45:26,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:26,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:45:26,274 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:26,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:26,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:26,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:26,276 INFO L87 Difference]: Start difference. First operand 3374 states and 4868 transitions. Second operand 3 states. [2019-09-09 05:45:26,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:26,450 INFO L93 Difference]: Finished difference Result 3497 states and 5013 transitions. [2019-09-09 05:45:26,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:26,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-09-09 05:45:26,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:26,463 INFO L225 Difference]: With dead ends: 3497 [2019-09-09 05:45:26,464 INFO L226 Difference]: Without dead ends: 2304 [2019-09-09 05:45:26,464 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:45:26,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2019-09-09 05:45:26,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 2284. [2019-09-09 05:45:26,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2284 states. [2019-09-09 05:45:26,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2284 states to 2284 states and 3252 transitions. [2019-09-09 05:45:26,505 INFO L78 Accepts]: Start accepts. Automaton has 2284 states and 3252 transitions. Word has length 313 [2019-09-09 05:45:26,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:26,505 INFO L475 AbstractCegarLoop]: Abstraction has 2284 states and 3252 transitions. [2019-09-09 05:45:26,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:26,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2284 states and 3252 transitions. [2019-09-09 05:45:26,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2019-09-09 05:45:26,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:26,511 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:45:26,512 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:26,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:26,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1807528757, now seen corresponding path program 1 times [2019-09-09 05:45:26,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:26,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:26,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:26,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:26,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:26,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-09-09 05:45:26,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:26,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:26,633 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 379 with the following transitions: [2019-09-09 05:45:26,634 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [116], [118], [123], [126], [128], [133], [136], [138], [143], [148], [153], [156], [158], [163], [168], [173], [178], [183], [188], [191], [193], [198], [201], [203], [208], [211], [278], [281], [289], [291], [294], [302], [307], [309], [313], [322], [324], [327], [333], [362], [367], [377], [381], [392], [403], [405], [410], [423], [433], [435], [469], [472], [480], [485], [487], [489], [494], [497], [499], [505], [510], [512], [515], [517], [522], [527], [532], [534], [588], [590], [603], [608], [609], [610], [612] [2019-09-09 05:45:26,641 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:26,641 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:26,692 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:27,441 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:27,441 INFO L272 AbstractInterpreter]: Visited 99 different actions 1878 times. Merged at 79 different actions 1554 times. Widened at 18 different actions 231 times. Performed 4480 root evaluator evaluations with a maximum evaluation depth of 5. Performed 4480 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 201 fixpoints after 25 different actions. Largest state had 86 variables. [2019-09-09 05:45:27,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:27,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:27,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:27,443 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:45:27,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:27,454 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:45:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:27,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:45:27,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:27,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-09-09 05:45:27,771 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:27,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 906 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-09-09 05:45:27,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:45:27,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-09 05:45:27,859 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:45:27,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:45:27,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:45:27,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:45:27,860 INFO L87 Difference]: Start difference. First operand 2284 states and 3252 transitions. Second operand 4 states. [2019-09-09 05:45:28,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:28,156 INFO L93 Difference]: Finished difference Result 3073 states and 4202 transitions. [2019-09-09 05:45:28,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:45:28,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 378 [2019-09-09 05:45:28,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:28,166 INFO L225 Difference]: With dead ends: 3073 [2019-09-09 05:45:28,167 INFO L226 Difference]: Without dead ends: 3021 [2019-09-09 05:45:28,167 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 761 GetRequests, 756 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:45:28,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2019-09-09 05:45:28,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 2206. [2019-09-09 05:45:28,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2206 states. [2019-09-09 05:45:28,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 3048 transitions. [2019-09-09 05:45:28,204 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 3048 transitions. Word has length 378 [2019-09-09 05:45:28,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:28,205 INFO L475 AbstractCegarLoop]: Abstraction has 2206 states and 3048 transitions. [2019-09-09 05:45:28,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:45:28,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 3048 transitions. [2019-09-09 05:45:28,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2019-09-09 05:45:28,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:28,212 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:45:28,212 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:28,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:28,213 INFO L82 PathProgramCache]: Analyzing trace with hash 577734987, now seen corresponding path program 1 times [2019-09-09 05:45:28,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:28,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:28,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:28,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:28,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:28,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-09-09 05:45:28,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:28,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:45:28,566 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 607 with the following transitions: [2019-09-09 05:45:28,566 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [20], [31], [37], [46], [48], [53], [58], [63], [68], [73], [78], [83], [88], [91], [93], [98], [103], [106], [108], [113], [116], [118], [123], [126], [128], [133], [136], [138], [143], [148], [153], [156], [158], [161], [163], [168], [171], [173], [178], [181], [183], [188], [191], [193], [198], [201], [203], [208], [211], [278], [281], [289], [291], [294], [302], [307], [309], [313], [322], [324], [327], [333], [362], [367], [377], [381], [392], [403], [405], [410], [423], [433], [435], [437], [442], [447], [452], [455], [460], [462], [467], [469], [472], [474], [480], [485], [487], [489], [494], [497], [499], [505], [510], [512], [515], [517], [522], [527], [532], [534], [588], [590], [603], [608], [609], [610], [612] [2019-09-09 05:45:28,570 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:45:28,570 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:45:28,634 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:45:30,020 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:45:30,021 INFO L272 AbstractInterpreter]: Visited 111 different actions 2377 times. Merged at 92 different actions 1922 times. Widened at 22 different actions 309 times. Performed 5903 root evaluator evaluations with a maximum evaluation depth of 5. Performed 5903 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 308 fixpoints after 31 different actions. Largest state had 90 variables. [2019-09-09 05:45:30,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:30,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:45:30,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:45:30,022 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:45:30,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:30,037 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:45:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:30,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:45:30,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:45:30,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-09-09 05:45:30,314 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:45:30,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4011 backedges. 2317 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-09-09 05:45:30,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 05:45:30,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-09 05:45:30,562 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 05:45:30,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:45:30,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:45:30,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:45:30,563 INFO L87 Difference]: Start difference. First operand 2206 states and 3048 transitions. Second operand 4 states. [2019-09-09 05:45:30,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:30,828 INFO L93 Difference]: Finished difference Result 3117 states and 4282 transitions. [2019-09-09 05:45:30,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:45:30,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 606 [2019-09-09 05:45:30,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:30,836 INFO L225 Difference]: With dead ends: 3117 [2019-09-09 05:45:30,836 INFO L226 Difference]: Without dead ends: 2976 [2019-09-09 05:45:30,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1217 GetRequests, 1212 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:45:30,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2019-09-09 05:45:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 2206. [2019-09-09 05:45:30,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2206 states. [2019-09-09 05:45:30,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 3048 transitions. [2019-09-09 05:45:30,872 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 3048 transitions. Word has length 606 [2019-09-09 05:45:30,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:30,873 INFO L475 AbstractCegarLoop]: Abstraction has 2206 states and 3048 transitions. [2019-09-09 05:45:30,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:45:30,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 3048 transitions. [2019-09-09 05:45:30,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2019-09-09 05:45:30,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:30,881 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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:45:30,881 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:30,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:30,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1643232172, now seen corresponding path program 1 times [2019-09-09 05:45:30,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:30,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:30,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:30,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:30,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:31,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5248 backedges. 2921 proven. 0 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2019-09-09 05:45:31,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:31,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:45:31,296 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:31,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:31,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:31,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:31,298 INFO L87 Difference]: Start difference. First operand 2206 states and 3048 transitions. Second operand 3 states. [2019-09-09 05:45:31,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:31,483 INFO L93 Difference]: Finished difference Result 2242 states and 3072 transitions. [2019-09-09 05:45:31,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:31,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 673 [2019-09-09 05:45:31,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:31,488 INFO L225 Difference]: With dead ends: 2242 [2019-09-09 05:45:31,489 INFO L226 Difference]: Without dead ends: 2242 [2019-09-09 05:45:31,490 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:45:31,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2019-09-09 05:45:31,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2206. [2019-09-09 05:45:31,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2206 states. [2019-09-09 05:45:31,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 3028 transitions. [2019-09-09 05:45:31,526 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 3028 transitions. Word has length 673 [2019-09-09 05:45:31,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:31,527 INFO L475 AbstractCegarLoop]: Abstraction has 2206 states and 3028 transitions. [2019-09-09 05:45:31,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:31,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 3028 transitions. [2019-09-09 05:45:31,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2019-09-09 05:45:31,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:31,538 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:31,538 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:31,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:31,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1191306506, now seen corresponding path program 1 times [2019-09-09 05:45:31,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:31,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:31,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:31,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:31,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:31,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5384 backedges. 2914 proven. 0 refuted. 0 times theorem prover too weak. 2470 trivial. 0 not checked. [2019-09-09 05:45:31,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:31,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:45:31,905 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:31,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:31,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:31,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:31,906 INFO L87 Difference]: Start difference. First operand 2206 states and 3028 transitions. Second operand 3 states. [2019-09-09 05:45:32,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:32,043 INFO L93 Difference]: Finished difference Result 2248 states and 3038 transitions. [2019-09-09 05:45:32,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:32,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 687 [2019-09-09 05:45:32,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:32,049 INFO L225 Difference]: With dead ends: 2248 [2019-09-09 05:45:32,049 INFO L226 Difference]: Without dead ends: 2248 [2019-09-09 05:45:32,049 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:45:32,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2019-09-09 05:45:32,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 2193. [2019-09-09 05:45:32,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2193 states. [2019-09-09 05:45:32,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 2969 transitions. [2019-09-09 05:45:32,077 INFO L78 Accepts]: Start accepts. Automaton has 2193 states and 2969 transitions. Word has length 687 [2019-09-09 05:45:32,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:32,078 INFO L475 AbstractCegarLoop]: Abstraction has 2193 states and 2969 transitions. [2019-09-09 05:45:32,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:32,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 2969 transitions. [2019-09-09 05:45:32,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 717 [2019-09-09 05:45:32,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:32,087 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 22, 22, 22, 20, 20, 18, 18, 16, 16, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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:45:32,087 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:32,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:32,088 INFO L82 PathProgramCache]: Analyzing trace with hash 775421205, now seen corresponding path program 1 times [2019-09-09 05:45:32,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:32,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:32,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:32,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:32,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:32,398 INFO L134 CoverageAnalysis]: Checked inductivity of 5825 backedges. 3230 proven. 0 refuted. 0 times theorem prover too weak. 2595 trivial. 0 not checked. [2019-09-09 05:45:32,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:32,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:45:32,398 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:32,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:32,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:32,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:32,400 INFO L87 Difference]: Start difference. First operand 2193 states and 2969 transitions. Second operand 3 states. [2019-09-09 05:45:32,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:32,535 INFO L93 Difference]: Finished difference Result 2271 states and 3054 transitions. [2019-09-09 05:45:32,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:32,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 716 [2019-09-09 05:45:32,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:32,541 INFO L225 Difference]: With dead ends: 2271 [2019-09-09 05:45:32,541 INFO L226 Difference]: Without dead ends: 2253 [2019-09-09 05:45:32,542 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:45:32,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2019-09-09 05:45:32,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 2235. [2019-09-09 05:45:32,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2235 states. [2019-09-09 05:45:32,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 3014 transitions. [2019-09-09 05:45:32,567 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 3014 transitions. Word has length 716 [2019-09-09 05:45:32,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:32,568 INFO L475 AbstractCegarLoop]: Abstraction has 2235 states and 3014 transitions. [2019-09-09 05:45:32,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:32,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 3014 transitions. [2019-09-09 05:45:32,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2019-09-09 05:45:32,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:45:32,577 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 20, 20, 18, 18, 16, 16, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:32,577 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:45:32,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:45:32,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1839697068, now seen corresponding path program 1 times [2019-09-09 05:45:32,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:45:32,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:32,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:45:32,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:45:32,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:45:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:45:32,875 INFO L134 CoverageAnalysis]: Checked inductivity of 5991 backedges. 3253 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2019-09-09 05:45:32,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:45:32,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:45:32,876 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:45:32,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:45:32,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:45:32,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:45:32,879 INFO L87 Difference]: Start difference. First operand 2235 states and 3014 transitions. Second operand 3 states. [2019-09-09 05:45:33,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:45:33,010 INFO L93 Difference]: Finished difference Result 853 states and 1101 transitions. [2019-09-09 05:45:33,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:45:33,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 731 [2019-09-09 05:45:33,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:45:33,011 INFO L225 Difference]: With dead ends: 853 [2019-09-09 05:45:33,011 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:45:33,012 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:45:33,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:45:33,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:45:33,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:45:33,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:45:33,013 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 731 [2019-09-09 05:45:33,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:45:33,013 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:45:33,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:45:33,013 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:45:33,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:45:33,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:45:33 BoogieIcfgContainer [2019-09-09 05:45:33,018 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:45:33,021 INFO L168 Benchmark]: Toolchain (without parser) took 67493.34 ms. Allocated memory was 135.3 MB in the beginning and 942.1 MB in the end (delta: 806.9 MB). Free memory was 91.0 MB in the beginning and 761.7 MB in the end (delta: -670.7 MB). Peak memory consumption was 136.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:45:33,022 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 135.3 MB. Free memory was 109.8 MB in the beginning and 109.6 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:45:33,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 500.03 ms. Allocated memory was 135.3 MB in the beginning and 202.4 MB in the end (delta: 67.1 MB). Free memory was 90.8 MB in the beginning and 175.9 MB in the end (delta: -85.1 MB). Peak memory consumption was 28.8 MB. Max. memory is 7.1 GB. [2019-09-09 05:45:33,023 INFO L168 Benchmark]: Boogie Preprocessor took 62.08 ms. Allocated memory is still 202.4 MB. Free memory was 175.9 MB in the beginning and 172.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:45:33,024 INFO L168 Benchmark]: RCFGBuilder took 914.82 ms. Allocated memory is still 202.4 MB. Free memory was 172.9 MB in the beginning and 124.9 MB in the end (delta: 47.9 MB). Peak memory consumption was 47.9 MB. Max. memory is 7.1 GB. [2019-09-09 05:45:33,024 INFO L168 Benchmark]: TraceAbstraction took 66011.95 ms. Allocated memory was 202.4 MB in the beginning and 942.1 MB in the end (delta: 739.8 MB). Free memory was 124.3 MB in the beginning and 761.7 MB in the end (delta: -637.4 MB). Peak memory consumption was 102.4 MB. Max. memory is 7.1 GB. [2019-09-09 05:45:33,028 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.24 ms. Allocated memory is still 135.3 MB. Free memory was 109.8 MB in the beginning and 109.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 500.03 ms. Allocated memory was 135.3 MB in the beginning and 202.4 MB in the end (delta: 67.1 MB). Free memory was 90.8 MB in the beginning and 175.9 MB in the end (delta: -85.1 MB). Peak memory consumption was 28.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.08 ms. Allocated memory is still 202.4 MB. Free memory was 175.9 MB in the beginning and 172.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 914.82 ms. Allocated memory is still 202.4 MB. Free memory was 172.9 MB in the beginning and 124.9 MB in the end (delta: 47.9 MB). Peak memory consumption was 47.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 66011.95 ms. Allocated memory was 202.4 MB in the beginning and 942.1 MB in the end (delta: 739.8 MB). Free memory was 124.3 MB in the beginning and 761.7 MB in the end (delta: -637.4 MB). Peak memory consumption was 102.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 670]: 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, 148 locations, 1 error locations. SAFE Result, 65.9s OverallTime, 36 OverallIterations, 25 TraceHistogramMax, 49.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5639 SDtfs, 14619 SDslu, 7120 SDs, 0 SdLazy, 10917 SolverSat, 2246 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2447 GetRequests, 2238 SyntacticMatches, 14 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2356 ImplicationChecksByTransitivity, 9.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3374occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.4s AbstIntTime, 3 AbstIntIterations, 1 AbstIntStrong, 0.785864272116712 AbsIntWeakeningRatio, 0.4075471698113208 AbsIntAvgWeakeningVarsNumRemoved, 15.562264150943395 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 36 MinimizatonAttempts, 2536 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 9319 NumberOfCodeBlocks, 9319 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 10263 ConstructedInterpolants, 0 QuantifiedInterpolants, 5203675 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1590 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 40 InterpolantComputations, 33 PerfectInterpolantSequences, 45164/45346 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...