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/locks/test_locks_12.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:49:31,203 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:49:31,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:49:31,216 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:49:31,217 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:49:31,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:49:31,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:49:31,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:49:31,223 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:49:31,224 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:49:31,225 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:49:31,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:49:31,228 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:49:31,229 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:49:31,231 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:49:31,232 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:49:31,233 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:49:31,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:49:31,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:49:31,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:49:31,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:49:31,258 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:49:31,261 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:49:31,262 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:49:31,264 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:49:31,264 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:49:31,264 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:49:31,266 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:49:31,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:49:31,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:49:31,270 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:49:31,271 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:49:31,272 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:49:31,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:49:31,274 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:49:31,275 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:49:31,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:49:31,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:49:31,276 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:49:31,278 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:49:31,279 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:49:31,280 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 05:49:31,298 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:49:31,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:49:31,298 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:49:31,299 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:49:31,299 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:49:31,300 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:49:31,300 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:49:31,300 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:49:31,300 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:49:31,300 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:49:31,301 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:49:31,301 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:49:31,302 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:49:31,302 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:49:31,302 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:49:31,302 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:49:31,302 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:49:31,303 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:49:31,303 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:49:31,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:49:31,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:49:31,304 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:49:31,304 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:49:31,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:49:31,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:49:31,304 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:49:31,305 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:49:31,305 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:49:31,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:49:31,305 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:49:31,334 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:49:31,348 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:49:31,356 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:49:31,360 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:49:31,360 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:49:31,361 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_12.c [2019-09-09 05:49:31,440 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/759d6f4e7/6e622aeaf3bf4236a9fabf7c1b8b6801/FLAG87ebd0467 [2019-09-09 05:49:31,938 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:49:31,939 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c [2019-09-09 05:49:31,946 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/759d6f4e7/6e622aeaf3bf4236a9fabf7c1b8b6801/FLAG87ebd0467 [2019-09-09 05:49:32,297 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/759d6f4e7/6e622aeaf3bf4236a9fabf7c1b8b6801 [2019-09-09 05:49:32,307 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:49:32,308 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:49:32,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:49:32,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:49:32,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:49:32,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:49:32" (1/1) ... [2019-09-09 05:49:32,318 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d65f0ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:32, skipping insertion in model container [2019-09-09 05:49:32,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:49:32" (1/1) ... [2019-09-09 05:49:32,328 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:49:32,360 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:49:32,589 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:49:32,594 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:49:32,711 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:49:32,725 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:49:32,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:32 WrapperNode [2019-09-09 05:49:32,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:49:32,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:49:32,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:49:32,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:49:32,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:32" (1/1) ... [2019-09-09 05:49:32,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:32" (1/1) ... [2019-09-09 05:49:32,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:32" (1/1) ... [2019-09-09 05:49:32,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:32" (1/1) ... [2019-09-09 05:49:32,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:32" (1/1) ... [2019-09-09 05:49:32,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:32" (1/1) ... [2019-09-09 05:49:32,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:32" (1/1) ... [2019-09-09 05:49:32,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:49:32,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:49:32,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:49:32,765 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:49:32,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:49:32,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:49:32,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:49:32,818 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:49:32,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:49:32,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:49:32,818 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:49:32,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:49:32,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:49:33,196 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:49:33,196 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:49:33,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:49:33 BoogieIcfgContainer [2019-09-09 05:49:33,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:49:33,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:49:33,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:49:33,203 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:49:33,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:49:32" (1/3) ... [2019-09-09 05:49:33,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7942ad01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:49:33, skipping insertion in model container [2019-09-09 05:49:33,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:32" (2/3) ... [2019-09-09 05:49:33,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7942ad01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:49:33, skipping insertion in model container [2019-09-09 05:49:33,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:49:33" (3/3) ... [2019-09-09 05:49:33,207 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2019-09-09 05:49:33,217 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:49:33,230 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:49:33,245 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:49:33,273 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:49:33,273 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:49:33,274 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:49:33,274 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:49:33,274 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:49:33,274 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:49:33,274 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:49:33,274 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:49:33,289 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-09-09 05:49:33,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-09 05:49:33,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:33,300 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] [2019-09-09 05:49:33,302 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:33,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:33,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1339057171, now seen corresponding path program 1 times [2019-09-09 05:49:33,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:33,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:33,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:33,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:33,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:33,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:33,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:33,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:33,529 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:33,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:33,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:33,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:33,556 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2019-09-09 05:49:33,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:33,654 INFO L93 Difference]: Finished difference Result 92 states and 161 transitions. [2019-09-09 05:49:33,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:33,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-09 05:49:33,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:33,668 INFO L225 Difference]: With dead ends: 92 [2019-09-09 05:49:33,669 INFO L226 Difference]: Without dead ends: 84 [2019-09-09 05:49:33,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:33,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-09 05:49:33,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2019-09-09 05:49:33,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-09 05:49:33,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 105 transitions. [2019-09-09 05:49:33,715 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 105 transitions. Word has length 22 [2019-09-09 05:49:33,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:33,715 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 105 transitions. [2019-09-09 05:49:33,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:33,716 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 105 transitions. [2019-09-09 05:49:33,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-09 05:49:33,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:33,717 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] [2019-09-09 05:49:33,718 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:33,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:33,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1676046447, now seen corresponding path program 1 times [2019-09-09 05:49:33,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:33,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:33,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:33,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:33,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:33,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:33,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:33,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:33,797 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:33,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:33,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:33,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:33,801 INFO L87 Difference]: Start difference. First operand 58 states and 105 transitions. Second operand 3 states. [2019-09-09 05:49:33,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:33,845 INFO L93 Difference]: Finished difference Result 84 states and 150 transitions. [2019-09-09 05:49:33,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:33,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-09 05:49:33,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:33,847 INFO L225 Difference]: With dead ends: 84 [2019-09-09 05:49:33,848 INFO L226 Difference]: Without dead ends: 84 [2019-09-09 05:49:33,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:33,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-09 05:49:33,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-09-09 05:49:33,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-09 05:49:33,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 149 transitions. [2019-09-09 05:49:33,860 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 149 transitions. Word has length 22 [2019-09-09 05:49:33,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:33,860 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 149 transitions. [2019-09-09 05:49:33,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:33,861 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 149 transitions. [2019-09-09 05:49:33,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-09 05:49:33,862 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:33,862 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] [2019-09-09 05:49:33,863 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:33,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:33,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1439113391, now seen corresponding path program 1 times [2019-09-09 05:49:33,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:33,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:33,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:33,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:33,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:33,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:33,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:33,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:33,919 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:33,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:33,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:33,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:33,920 INFO L87 Difference]: Start difference. First operand 82 states and 149 transitions. Second operand 3 states. [2019-09-09 05:49:33,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:33,957 INFO L93 Difference]: Finished difference Result 87 states and 152 transitions. [2019-09-09 05:49:33,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:33,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-09 05:49:33,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:33,959 INFO L225 Difference]: With dead ends: 87 [2019-09-09 05:49:33,959 INFO L226 Difference]: Without dead ends: 87 [2019-09-09 05:49:33,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:33,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-09 05:49:33,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-09-09 05:49:33,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-09 05:49:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 151 transitions. [2019-09-09 05:49:33,973 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 151 transitions. Word has length 23 [2019-09-09 05:49:33,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:33,974 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 151 transitions. [2019-09-09 05:49:33,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:33,974 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2019-09-09 05:49:33,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-09 05:49:33,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:33,975 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] [2019-09-09 05:49:33,976 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:33,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:33,976 INFO L82 PathProgramCache]: Analyzing trace with hash 418045037, now seen corresponding path program 1 times [2019-09-09 05:49:33,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:33,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:33,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:33,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:33,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:34,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:34,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:34,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:34,045 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:34,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:34,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:34,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:34,047 INFO L87 Difference]: Start difference. First operand 85 states and 151 transitions. Second operand 3 states. [2019-09-09 05:49:34,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:34,075 INFO L93 Difference]: Finished difference Result 158 states and 285 transitions. [2019-09-09 05:49:34,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:34,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-09 05:49:34,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:34,079 INFO L225 Difference]: With dead ends: 158 [2019-09-09 05:49:34,083 INFO L226 Difference]: Without dead ends: 158 [2019-09-09 05:49:34,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:34,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-09 05:49:34,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2019-09-09 05:49:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-09 05:49:34,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 200 transitions. [2019-09-09 05:49:34,099 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 200 transitions. Word has length 23 [2019-09-09 05:49:34,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:34,101 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 200 transitions. [2019-09-09 05:49:34,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:34,101 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 200 transitions. [2019-09-09 05:49:34,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-09 05:49:34,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:34,104 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] [2019-09-09 05:49:34,104 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:34,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:34,106 INFO L82 PathProgramCache]: Analyzing trace with hash -861818641, now seen corresponding path program 1 times [2019-09-09 05:49:34,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:34,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:34,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:34,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:34,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:34,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:34,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:34,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:34,166 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:34,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:34,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:34,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:34,168 INFO L87 Difference]: Start difference. First operand 112 states and 200 transitions. Second operand 3 states. [2019-09-09 05:49:34,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:34,199 INFO L93 Difference]: Finished difference Result 160 states and 283 transitions. [2019-09-09 05:49:34,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:34,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-09 05:49:34,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:34,202 INFO L225 Difference]: With dead ends: 160 [2019-09-09 05:49:34,202 INFO L226 Difference]: Without dead ends: 160 [2019-09-09 05:49:34,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:34,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-09-09 05:49:34,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2019-09-09 05:49:34,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-09 05:49:34,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 282 transitions. [2019-09-09 05:49:34,216 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 282 transitions. Word has length 23 [2019-09-09 05:49:34,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:34,216 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 282 transitions. [2019-09-09 05:49:34,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:34,217 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 282 transitions. [2019-09-09 05:49:34,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-09 05:49:34,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:34,218 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] [2019-09-09 05:49:34,219 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:34,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:34,219 INFO L82 PathProgramCache]: Analyzing trace with hash 74707332, now seen corresponding path program 1 times [2019-09-09 05:49:34,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:34,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:34,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:34,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:34,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:34,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:34,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:34,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:34,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:34,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:34,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:34,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:34,261 INFO L87 Difference]: Start difference. First operand 158 states and 282 transitions. Second operand 3 states. [2019-09-09 05:49:34,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:34,277 INFO L93 Difference]: Finished difference Result 162 states and 283 transitions. [2019-09-09 05:49:34,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:34,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-09 05:49:34,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:34,279 INFO L225 Difference]: With dead ends: 162 [2019-09-09 05:49:34,279 INFO L226 Difference]: Without dead ends: 162 [2019-09-09 05:49:34,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:34,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-09 05:49:34,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2019-09-09 05:49:34,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-09 05:49:34,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 282 transitions. [2019-09-09 05:49:34,290 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 282 transitions. Word has length 24 [2019-09-09 05:49:34,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:34,290 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 282 transitions. [2019-09-09 05:49:34,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:34,291 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 282 transitions. [2019-09-09 05:49:34,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-09 05:49:34,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:34,292 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] [2019-09-09 05:49:34,293 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:34,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:34,293 INFO L82 PathProgramCache]: Analyzing trace with hash -946361022, now seen corresponding path program 1 times [2019-09-09 05:49:34,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:34,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:34,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:34,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:34,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:34,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:34,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:34,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:34,329 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:34,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:34,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:34,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:34,331 INFO L87 Difference]: Start difference. First operand 160 states and 282 transitions. Second operand 3 states. [2019-09-09 05:49:34,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:34,350 INFO L93 Difference]: Finished difference Result 298 states and 531 transitions. [2019-09-09 05:49:34,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:34,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-09 05:49:34,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:34,353 INFO L225 Difference]: With dead ends: 298 [2019-09-09 05:49:34,353 INFO L226 Difference]: Without dead ends: 298 [2019-09-09 05:49:34,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:34,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-09-09 05:49:34,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 216. [2019-09-09 05:49:34,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-09-09 05:49:34,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2019-09-09 05:49:34,379 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 24 [2019-09-09 05:49:34,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:34,380 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2019-09-09 05:49:34,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:34,380 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2019-09-09 05:49:34,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-09 05:49:34,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:34,392 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] [2019-09-09 05:49:34,392 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:34,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:34,393 INFO L82 PathProgramCache]: Analyzing trace with hash 2068742596, now seen corresponding path program 1 times [2019-09-09 05:49:34,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:34,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:34,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:34,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:34,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:34,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:34,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:34,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:34,455 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:34,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:34,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:34,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:34,456 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 3 states. [2019-09-09 05:49:34,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:34,475 INFO L93 Difference]: Finished difference Result 306 states and 531 transitions. [2019-09-09 05:49:34,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:34,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-09 05:49:34,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:34,478 INFO L225 Difference]: With dead ends: 306 [2019-09-09 05:49:34,478 INFO L226 Difference]: Without dead ends: 306 [2019-09-09 05:49:34,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:34,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-09 05:49:34,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-09-09 05:49:34,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-09 05:49:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 530 transitions. [2019-09-09 05:49:34,488 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 530 transitions. Word has length 24 [2019-09-09 05:49:34,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:34,488 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 530 transitions. [2019-09-09 05:49:34,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:34,489 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 530 transitions. [2019-09-09 05:49:34,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-09 05:49:34,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:34,490 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] [2019-09-09 05:49:34,491 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:34,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:34,491 INFO L82 PathProgramCache]: Analyzing trace with hash 727792804, now seen corresponding path program 1 times [2019-09-09 05:49:34,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:34,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:34,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:34,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:34,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:34,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:34,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:34,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:34,529 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:34,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:34,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:34,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:34,530 INFO L87 Difference]: Start difference. First operand 304 states and 530 transitions. Second operand 3 states. [2019-09-09 05:49:34,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:34,545 INFO L93 Difference]: Finished difference Result 310 states and 531 transitions. [2019-09-09 05:49:34,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:34,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-09 05:49:34,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:34,548 INFO L225 Difference]: With dead ends: 310 [2019-09-09 05:49:34,548 INFO L226 Difference]: Without dead ends: 310 [2019-09-09 05:49:34,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:34,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-09 05:49:34,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2019-09-09 05:49:34,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-09-09 05:49:34,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 530 transitions. [2019-09-09 05:49:34,558 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 530 transitions. Word has length 25 [2019-09-09 05:49:34,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:34,559 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 530 transitions. [2019-09-09 05:49:34,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:34,559 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 530 transitions. [2019-09-09 05:49:34,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-09 05:49:34,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:34,560 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] [2019-09-09 05:49:34,560 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:34,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:34,561 INFO L82 PathProgramCache]: Analyzing trace with hash -293275550, now seen corresponding path program 1 times [2019-09-09 05:49:34,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:34,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:34,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:34,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:34,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:34,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:34,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:34,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:34,587 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:34,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:34,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:34,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:34,588 INFO L87 Difference]: Start difference. First operand 308 states and 530 transitions. Second operand 3 states. [2019-09-09 05:49:34,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:34,607 INFO L93 Difference]: Finished difference Result 570 states and 991 transitions. [2019-09-09 05:49:34,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:34,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-09 05:49:34,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:34,611 INFO L225 Difference]: With dead ends: 570 [2019-09-09 05:49:34,611 INFO L226 Difference]: Without dead ends: 570 [2019-09-09 05:49:34,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:34,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-09-09 05:49:34,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 424. [2019-09-09 05:49:34,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-09-09 05:49:34,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 718 transitions. [2019-09-09 05:49:34,626 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 718 transitions. Word has length 25 [2019-09-09 05:49:34,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:34,626 INFO L475 AbstractCegarLoop]: Abstraction has 424 states and 718 transitions. [2019-09-09 05:49:34,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:34,626 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 718 transitions. [2019-09-09 05:49:34,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-09 05:49:34,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:34,628 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] [2019-09-09 05:49:34,628 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:34,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:34,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1573139228, now seen corresponding path program 1 times [2019-09-09 05:49:34,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:34,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:34,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:34,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:34,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:34,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:34,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:34,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:34,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:34,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:34,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:34,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:34,655 INFO L87 Difference]: Start difference. First operand 424 states and 718 transitions. Second operand 3 states. [2019-09-09 05:49:34,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:34,682 INFO L93 Difference]: Finished difference Result 594 states and 999 transitions. [2019-09-09 05:49:34,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:34,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-09 05:49:34,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:34,687 INFO L225 Difference]: With dead ends: 594 [2019-09-09 05:49:34,687 INFO L226 Difference]: Without dead ends: 594 [2019-09-09 05:49:34,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:34,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-09-09 05:49:34,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 592. [2019-09-09 05:49:34,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-09-09 05:49:34,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 998 transitions. [2019-09-09 05:49:34,708 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 998 transitions. Word has length 25 [2019-09-09 05:49:34,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:34,708 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 998 transitions. [2019-09-09 05:49:34,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:34,708 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 998 transitions. [2019-09-09 05:49:34,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-09 05:49:34,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:34,713 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] [2019-09-09 05:49:34,713 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:34,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:34,713 INFO L82 PathProgramCache]: Analyzing trace with hash -501393703, now seen corresponding path program 1 times [2019-09-09 05:49:34,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:34,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:34,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:34,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:34,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:34,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:34,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:34,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:34,749 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:34,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:34,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:34,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:34,750 INFO L87 Difference]: Start difference. First operand 592 states and 998 transitions. Second operand 3 states. [2019-09-09 05:49:34,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:34,767 INFO L93 Difference]: Finished difference Result 602 states and 999 transitions. [2019-09-09 05:49:34,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:34,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-09 05:49:34,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:34,772 INFO L225 Difference]: With dead ends: 602 [2019-09-09 05:49:34,772 INFO L226 Difference]: Without dead ends: 602 [2019-09-09 05:49:34,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:34,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-09-09 05:49:34,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2019-09-09 05:49:34,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-09-09 05:49:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 998 transitions. [2019-09-09 05:49:34,788 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 998 transitions. Word has length 26 [2019-09-09 05:49:34,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:34,788 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 998 transitions. [2019-09-09 05:49:34,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:34,788 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 998 transitions. [2019-09-09 05:49:34,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-09 05:49:34,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:34,789 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] [2019-09-09 05:49:34,790 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:34,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:34,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1522462057, now seen corresponding path program 1 times [2019-09-09 05:49:34,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:34,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:34,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:34,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:34,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:34,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:34,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:34,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:34,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:34,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:34,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:34,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:34,819 INFO L87 Difference]: Start difference. First operand 600 states and 998 transitions. Second operand 3 states. [2019-09-09 05:49:34,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:34,841 INFO L93 Difference]: Finished difference Result 1098 states and 1847 transitions. [2019-09-09 05:49:34,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:34,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-09 05:49:34,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:34,847 INFO L225 Difference]: With dead ends: 1098 [2019-09-09 05:49:34,848 INFO L226 Difference]: Without dead ends: 1098 [2019-09-09 05:49:34,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:34,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2019-09-09 05:49:34,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 840. [2019-09-09 05:49:34,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-09-09 05:49:34,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1366 transitions. [2019-09-09 05:49:34,869 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1366 transitions. Word has length 26 [2019-09-09 05:49:34,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:34,870 INFO L475 AbstractCegarLoop]: Abstraction has 840 states and 1366 transitions. [2019-09-09 05:49:34,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:34,870 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1366 transitions. [2019-09-09 05:49:34,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-09 05:49:34,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:34,872 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] [2019-09-09 05:49:34,872 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:34,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:34,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1492641561, now seen corresponding path program 1 times [2019-09-09 05:49:34,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:34,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:34,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:34,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:34,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:34,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:34,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:34,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:34,897 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:34,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:34,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:34,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:34,898 INFO L87 Difference]: Start difference. First operand 840 states and 1366 transitions. Second operand 3 states. [2019-09-09 05:49:34,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:34,918 INFO L93 Difference]: Finished difference Result 1162 states and 1879 transitions. [2019-09-09 05:49:34,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:34,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-09 05:49:34,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:34,925 INFO L225 Difference]: With dead ends: 1162 [2019-09-09 05:49:34,926 INFO L226 Difference]: Without dead ends: 1162 [2019-09-09 05:49:34,927 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:34,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-09-09 05:49:34,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1160. [2019-09-09 05:49:34,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2019-09-09 05:49:34,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1878 transitions. [2019-09-09 05:49:34,959 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1878 transitions. Word has length 26 [2019-09-09 05:49:34,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:34,960 INFO L475 AbstractCegarLoop]: Abstraction has 1160 states and 1878 transitions. [2019-09-09 05:49:34,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:34,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1878 transitions. [2019-09-09 05:49:34,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-09 05:49:34,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:34,962 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] [2019-09-09 05:49:34,962 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:34,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:34,963 INFO L82 PathProgramCache]: Analyzing trace with hash 48530585, now seen corresponding path program 1 times [2019-09-09 05:49:34,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:34,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:34,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:34,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:34,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:34,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:34,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:34,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:34,993 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:34,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:34,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:34,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:34,995 INFO L87 Difference]: Start difference. First operand 1160 states and 1878 transitions. Second operand 3 states. [2019-09-09 05:49:35,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:35,019 INFO L93 Difference]: Finished difference Result 1178 states and 1879 transitions. [2019-09-09 05:49:35,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:35,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-09 05:49:35,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:35,025 INFO L225 Difference]: With dead ends: 1178 [2019-09-09 05:49:35,025 INFO L226 Difference]: Without dead ends: 1178 [2019-09-09 05:49:35,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:35,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2019-09-09 05:49:35,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1176. [2019-09-09 05:49:35,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2019-09-09 05:49:35,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1878 transitions. [2019-09-09 05:49:35,056 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1878 transitions. Word has length 27 [2019-09-09 05:49:35,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:35,056 INFO L475 AbstractCegarLoop]: Abstraction has 1176 states and 1878 transitions. [2019-09-09 05:49:35,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:35,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1878 transitions. [2019-09-09 05:49:35,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-09 05:49:35,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:35,058 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] [2019-09-09 05:49:35,059 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:35,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:35,059 INFO L82 PathProgramCache]: Analyzing trace with hash -972537769, now seen corresponding path program 1 times [2019-09-09 05:49:35,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:35,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:35,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:35,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:35,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:35,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:35,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:35,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:35,084 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:35,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:35,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:35,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:35,085 INFO L87 Difference]: Start difference. First operand 1176 states and 1878 transitions. Second operand 3 states. [2019-09-09 05:49:35,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:35,112 INFO L93 Difference]: Finished difference Result 2122 states and 3431 transitions. [2019-09-09 05:49:35,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:35,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-09 05:49:35,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:35,123 INFO L225 Difference]: With dead ends: 2122 [2019-09-09 05:49:35,123 INFO L226 Difference]: Without dead ends: 2122 [2019-09-09 05:49:35,124 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:35,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2019-09-09 05:49:35,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1672. [2019-09-09 05:49:35,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-09-09 05:49:35,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2598 transitions. [2019-09-09 05:49:35,187 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2598 transitions. Word has length 27 [2019-09-09 05:49:35,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:35,188 INFO L475 AbstractCegarLoop]: Abstraction has 1672 states and 2598 transitions. [2019-09-09 05:49:35,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:35,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2598 transitions. [2019-09-09 05:49:35,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-09 05:49:35,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:35,191 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] [2019-09-09 05:49:35,191 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:35,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:35,192 INFO L82 PathProgramCache]: Analyzing trace with hash 2042565849, now seen corresponding path program 1 times [2019-09-09 05:49:35,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:35,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:35,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:35,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:35,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:35,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:35,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:35,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:35,218 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:35,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:35,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:35,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:35,220 INFO L87 Difference]: Start difference. First operand 1672 states and 2598 transitions. Second operand 3 states. [2019-09-09 05:49:35,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:35,246 INFO L93 Difference]: Finished difference Result 2282 states and 3527 transitions. [2019-09-09 05:49:35,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:35,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-09 05:49:35,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:35,258 INFO L225 Difference]: With dead ends: 2282 [2019-09-09 05:49:35,258 INFO L226 Difference]: Without dead ends: 2282 [2019-09-09 05:49:35,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:35,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2019-09-09 05:49:35,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2280. [2019-09-09 05:49:35,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2019-09-09 05:49:35,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3526 transitions. [2019-09-09 05:49:35,308 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3526 transitions. Word has length 27 [2019-09-09 05:49:35,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:35,309 INFO L475 AbstractCegarLoop]: Abstraction has 2280 states and 3526 transitions. [2019-09-09 05:49:35,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:35,309 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3526 transitions. [2019-09-09 05:49:35,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-09 05:49:35,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:35,312 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] [2019-09-09 05:49:35,313 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:35,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:35,313 INFO L82 PathProgramCache]: Analyzing trace with hash -83685330, now seen corresponding path program 1 times [2019-09-09 05:49:35,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:35,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:35,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:35,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:35,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:35,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:35,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:35,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:35,334 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:35,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:35,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:35,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:35,335 INFO L87 Difference]: Start difference. First operand 2280 states and 3526 transitions. Second operand 3 states. [2019-09-09 05:49:35,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:35,365 INFO L93 Difference]: Finished difference Result 2314 states and 3527 transitions. [2019-09-09 05:49:35,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:35,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-09 05:49:35,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:35,378 INFO L225 Difference]: With dead ends: 2314 [2019-09-09 05:49:35,378 INFO L226 Difference]: Without dead ends: 2314 [2019-09-09 05:49:35,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:35,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2019-09-09 05:49:35,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2312. [2019-09-09 05:49:35,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-09-09 05:49:35,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 3526 transitions. [2019-09-09 05:49:35,427 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 3526 transitions. Word has length 28 [2019-09-09 05:49:35,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:35,428 INFO L475 AbstractCegarLoop]: Abstraction has 2312 states and 3526 transitions. [2019-09-09 05:49:35,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:35,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 3526 transitions. [2019-09-09 05:49:35,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-09 05:49:35,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:35,431 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] [2019-09-09 05:49:35,431 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:35,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:35,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1104753684, now seen corresponding path program 1 times [2019-09-09 05:49:35,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:35,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:35,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:35,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:35,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:35,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:35,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:35,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:35,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:35,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:35,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:35,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:35,461 INFO L87 Difference]: Start difference. First operand 2312 states and 3526 transitions. Second operand 3 states. [2019-09-09 05:49:35,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:35,523 INFO L93 Difference]: Finished difference Result 4106 states and 6343 transitions. [2019-09-09 05:49:35,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:35,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-09 05:49:35,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:35,546 INFO L225 Difference]: With dead ends: 4106 [2019-09-09 05:49:35,546 INFO L226 Difference]: Without dead ends: 4106 [2019-09-09 05:49:35,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:35,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2019-09-09 05:49:35,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 3336. [2019-09-09 05:49:35,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2019-09-09 05:49:35,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4934 transitions. [2019-09-09 05:49:35,667 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4934 transitions. Word has length 28 [2019-09-09 05:49:35,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:35,667 INFO L475 AbstractCegarLoop]: Abstraction has 3336 states and 4934 transitions. [2019-09-09 05:49:35,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:35,668 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4934 transitions. [2019-09-09 05:49:35,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-09 05:49:35,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:35,676 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] [2019-09-09 05:49:35,677 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:35,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:35,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1910349934, now seen corresponding path program 1 times [2019-09-09 05:49:35,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:35,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:35,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:35,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:35,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:35,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:35,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:35,706 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:35,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:35,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:35,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:35,708 INFO L87 Difference]: Start difference. First operand 3336 states and 4934 transitions. Second operand 3 states. [2019-09-09 05:49:35,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:35,762 INFO L93 Difference]: Finished difference Result 4490 states and 6599 transitions. [2019-09-09 05:49:35,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:35,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-09 05:49:35,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:35,791 INFO L225 Difference]: With dead ends: 4490 [2019-09-09 05:49:35,792 INFO L226 Difference]: Without dead ends: 4490 [2019-09-09 05:49:35,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:35,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2019-09-09 05:49:35,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 4488. [2019-09-09 05:49:35,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4488 states. [2019-09-09 05:49:35,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4488 states to 4488 states and 6598 transitions. [2019-09-09 05:49:35,974 INFO L78 Accepts]: Start accepts. Automaton has 4488 states and 6598 transitions. Word has length 28 [2019-09-09 05:49:35,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:35,974 INFO L475 AbstractCegarLoop]: Abstraction has 4488 states and 6598 transitions. [2019-09-09 05:49:35,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:35,974 INFO L276 IsEmpty]: Start isEmpty. Operand 4488 states and 6598 transitions. [2019-09-09 05:49:35,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-09 05:49:35,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:35,980 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] [2019-09-09 05:49:35,980 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:35,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:35,981 INFO L82 PathProgramCache]: Analyzing trace with hash 112588942, now seen corresponding path program 1 times [2019-09-09 05:49:35,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:35,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:35,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:35,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:35,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:36,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:36,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:36,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:36,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:36,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:36,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:36,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:36,006 INFO L87 Difference]: Start difference. First operand 4488 states and 6598 transitions. Second operand 3 states. [2019-09-09 05:49:36,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:36,049 INFO L93 Difference]: Finished difference Result 4554 states and 6599 transitions. [2019-09-09 05:49:36,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:36,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-09 05:49:36,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:36,094 INFO L225 Difference]: With dead ends: 4554 [2019-09-09 05:49:36,094 INFO L226 Difference]: Without dead ends: 4554 [2019-09-09 05:49:36,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:36,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4554 states. [2019-09-09 05:49:36,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4554 to 4552. [2019-09-09 05:49:36,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4552 states. [2019-09-09 05:49:36,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 6598 transitions. [2019-09-09 05:49:36,198 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 6598 transitions. Word has length 29 [2019-09-09 05:49:36,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:36,199 INFO L475 AbstractCegarLoop]: Abstraction has 4552 states and 6598 transitions. [2019-09-09 05:49:36,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:36,199 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 6598 transitions. [2019-09-09 05:49:36,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-09 05:49:36,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:36,206 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] [2019-09-09 05:49:36,206 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:36,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:36,207 INFO L82 PathProgramCache]: Analyzing trace with hash -908479412, now seen corresponding path program 1 times [2019-09-09 05:49:36,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:36,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:36,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:36,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:36,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:36,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:36,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:36,233 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:36,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:36,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:36,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:36,234 INFO L87 Difference]: Start difference. First operand 4552 states and 6598 transitions. Second operand 3 states. [2019-09-09 05:49:36,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:36,283 INFO L93 Difference]: Finished difference Result 8842 states and 12423 transitions. [2019-09-09 05:49:36,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:36,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-09 05:49:36,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:36,314 INFO L225 Difference]: With dead ends: 8842 [2019-09-09 05:49:36,315 INFO L226 Difference]: Without dead ends: 8842 [2019-09-09 05:49:36,315 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:36,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8842 states. [2019-09-09 05:49:36,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8842 to 8840. [2019-09-09 05:49:36,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2019-09-09 05:49:36,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12422 transitions. [2019-09-09 05:49:36,511 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12422 transitions. Word has length 29 [2019-09-09 05:49:36,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:36,512 INFO L475 AbstractCegarLoop]: Abstraction has 8840 states and 12422 transitions. [2019-09-09 05:49:36,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:36,512 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12422 transitions. [2019-09-09 05:49:36,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-09 05:49:36,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:36,522 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] [2019-09-09 05:49:36,523 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:36,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:36,523 INFO L82 PathProgramCache]: Analyzing trace with hash 371384266, now seen corresponding path program 1 times [2019-09-09 05:49:36,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:36,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:36,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:36,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:36,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:36,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:36,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:36,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:36,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:36,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:36,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:36,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:36,556 INFO L87 Difference]: Start difference. First operand 8840 states and 12422 transitions. Second operand 3 states. [2019-09-09 05:49:36,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:36,667 INFO L93 Difference]: Finished difference Result 10122 states and 14599 transitions. [2019-09-09 05:49:36,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:36,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-09 05:49:36,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:36,692 INFO L225 Difference]: With dead ends: 10122 [2019-09-09 05:49:36,692 INFO L226 Difference]: Without dead ends: 10122 [2019-09-09 05:49:36,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:36,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10122 states. [2019-09-09 05:49:36,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10122 to 8840. [2019-09-09 05:49:36,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2019-09-09 05:49:36,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12294 transitions. [2019-09-09 05:49:36,870 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12294 transitions. Word has length 29 [2019-09-09 05:49:36,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:36,871 INFO L475 AbstractCegarLoop]: Abstraction has 8840 states and 12294 transitions. [2019-09-09 05:49:36,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:36,871 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12294 transitions. [2019-09-09 05:49:36,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-09 05:49:36,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:36,884 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] [2019-09-09 05:49:36,884 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:36,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:36,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1902124419, now seen corresponding path program 1 times [2019-09-09 05:49:36,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:36,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:36,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:36,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:36,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:36,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:36,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:36,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:36,913 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:36,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:36,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:36,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:36,914 INFO L87 Difference]: Start difference. First operand 8840 states and 12294 transitions. Second operand 3 states. [2019-09-09 05:49:36,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:36,989 INFO L93 Difference]: Finished difference Result 15242 states and 21383 transitions. [2019-09-09 05:49:36,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:36,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-09 05:49:36,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:37,026 INFO L225 Difference]: With dead ends: 15242 [2019-09-09 05:49:37,027 INFO L226 Difference]: Without dead ends: 15242 [2019-09-09 05:49:37,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:37,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15242 states. [2019-09-09 05:49:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15242 to 13192. [2019-09-09 05:49:37,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13192 states. [2019-09-09 05:49:37,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13192 states to 13192 states and 17798 transitions. [2019-09-09 05:49:37,328 INFO L78 Accepts]: Start accepts. Automaton has 13192 states and 17798 transitions. Word has length 30 [2019-09-09 05:49:37,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:37,329 INFO L475 AbstractCegarLoop]: Abstraction has 13192 states and 17798 transitions. [2019-09-09 05:49:37,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:37,329 INFO L276 IsEmpty]: Start isEmpty. Operand 13192 states and 17798 transitions. [2019-09-09 05:49:37,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-09 05:49:37,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:37,491 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] [2019-09-09 05:49:37,491 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:37,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:37,491 INFO L82 PathProgramCache]: Analyzing trace with hash 622260741, now seen corresponding path program 1 times [2019-09-09 05:49:37,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:37,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:37,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:37,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:37,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:37,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:37,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:37,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:37,510 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:37,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:37,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:37,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:37,511 INFO L87 Difference]: Start difference. First operand 13192 states and 17798 transitions. Second operand 3 states. [2019-09-09 05:49:37,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:37,580 INFO L93 Difference]: Finished difference Result 17290 states and 23047 transitions. [2019-09-09 05:49:37,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:37,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-09 05:49:37,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:37,627 INFO L225 Difference]: With dead ends: 17290 [2019-09-09 05:49:37,627 INFO L226 Difference]: Without dead ends: 17290 [2019-09-09 05:49:37,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:37,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17290 states. [2019-09-09 05:49:37,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17290 to 17288. [2019-09-09 05:49:37,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17288 states. [2019-09-09 05:49:37,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17288 states to 17288 states and 23046 transitions. [2019-09-09 05:49:37,905 INFO L78 Accepts]: Start accepts. Automaton has 17288 states and 23046 transitions. Word has length 30 [2019-09-09 05:49:37,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:37,905 INFO L475 AbstractCegarLoop]: Abstraction has 17288 states and 23046 transitions. [2019-09-09 05:49:37,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:37,905 INFO L276 IsEmpty]: Start isEmpty. Operand 17288 states and 23046 transitions. [2019-09-09 05:49:37,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-09 05:49:37,927 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:37,927 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] [2019-09-09 05:49:37,927 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:37,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:37,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1163469695, now seen corresponding path program 1 times [2019-09-09 05:49:37,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:37,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:37,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:37,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:37,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:37,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:37,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:37,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:37,949 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:37,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:37,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:37,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:37,950 INFO L87 Difference]: Start difference. First operand 17288 states and 23046 transitions. Second operand 3 states. [2019-09-09 05:49:38,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:38,009 INFO L93 Difference]: Finished difference Result 17674 states and 23303 transitions. [2019-09-09 05:49:38,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:38,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-09 05:49:38,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:38,045 INFO L225 Difference]: With dead ends: 17674 [2019-09-09 05:49:38,045 INFO L226 Difference]: Without dead ends: 17674 [2019-09-09 05:49:38,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:38,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17674 states. [2019-09-09 05:49:38,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17674 to 17672. [2019-09-09 05:49:38,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17672 states. [2019-09-09 05:49:38,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17672 states to 17672 states and 23302 transitions. [2019-09-09 05:49:38,700 INFO L78 Accepts]: Start accepts. Automaton has 17672 states and 23302 transitions. Word has length 31 [2019-09-09 05:49:38,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:38,700 INFO L475 AbstractCegarLoop]: Abstraction has 17672 states and 23302 transitions. [2019-09-09 05:49:38,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:38,700 INFO L276 IsEmpty]: Start isEmpty. Operand 17672 states and 23302 transitions. [2019-09-09 05:49:38,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-09 05:49:38,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:38,721 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] [2019-09-09 05:49:38,722 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:38,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:38,722 INFO L82 PathProgramCache]: Analyzing trace with hash 2110429247, now seen corresponding path program 1 times [2019-09-09 05:49:38,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:38,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:38,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:38,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:38,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:38,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:38,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:38,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:38,741 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:38,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:38,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:38,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:38,742 INFO L87 Difference]: Start difference. First operand 17672 states and 23302 transitions. Second operand 3 states. [2019-09-09 05:49:38,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:38,823 INFO L93 Difference]: Finished difference Result 29706 states and 39175 transitions. [2019-09-09 05:49:38,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:38,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-09 05:49:38,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:38,878 INFO L225 Difference]: With dead ends: 29706 [2019-09-09 05:49:38,878 INFO L226 Difference]: Without dead ends: 29706 [2019-09-09 05:49:38,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:38,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29706 states. [2019-09-09 05:49:39,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29706 to 26632. [2019-09-09 05:49:39,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26632 states. [2019-09-09 05:49:39,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26632 states to 26632 states and 34054 transitions. [2019-09-09 05:49:39,391 INFO L78 Accepts]: Start accepts. Automaton has 26632 states and 34054 transitions. Word has length 31 [2019-09-09 05:49:39,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:39,391 INFO L475 AbstractCegarLoop]: Abstraction has 26632 states and 34054 transitions. [2019-09-09 05:49:39,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:39,391 INFO L276 IsEmpty]: Start isEmpty. Operand 26632 states and 34054 transitions. [2019-09-09 05:49:39,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-09 05:49:39,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:39,431 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] [2019-09-09 05:49:39,431 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:39,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:39,432 INFO L82 PathProgramCache]: Analyzing trace with hash 830565569, now seen corresponding path program 1 times [2019-09-09 05:49:39,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:39,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:39,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:39,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:39,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:39,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:39,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:39,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:39,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:39,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:39,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:39,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:39,453 INFO L87 Difference]: Start difference. First operand 26632 states and 34054 transitions. Second operand 3 states. [2019-09-09 05:49:39,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:39,587 INFO L93 Difference]: Finished difference Result 34314 states and 43015 transitions. [2019-09-09 05:49:39,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:39,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-09 05:49:39,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:39,651 INFO L225 Difference]: With dead ends: 34314 [2019-09-09 05:49:39,651 INFO L226 Difference]: Without dead ends: 34314 [2019-09-09 05:49:39,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:39,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34314 states. [2019-09-09 05:49:40,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34314 to 34312. [2019-09-09 05:49:40,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34312 states. [2019-09-09 05:49:40,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34312 states to 34312 states and 43014 transitions. [2019-09-09 05:49:40,292 INFO L78 Accepts]: Start accepts. Automaton has 34312 states and 43014 transitions. Word has length 31 [2019-09-09 05:49:40,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:40,292 INFO L475 AbstractCegarLoop]: Abstraction has 34312 states and 43014 transitions. [2019-09-09 05:49:40,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:40,292 INFO L276 IsEmpty]: Start isEmpty. Operand 34312 states and 43014 transitions. [2019-09-09 05:49:40,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-09 05:49:40,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:40,323 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] [2019-09-09 05:49:40,323 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:40,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:40,324 INFO L82 PathProgramCache]: Analyzing trace with hash 999013018, now seen corresponding path program 1 times [2019-09-09 05:49:40,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:40,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:40,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:40,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:40,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:40,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:40,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:40,343 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:40,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:40,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:40,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:40,344 INFO L87 Difference]: Start difference. First operand 34312 states and 43014 transitions. Second operand 3 states. [2019-09-09 05:49:40,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:40,431 INFO L93 Difference]: Finished difference Result 34826 states and 43015 transitions. [2019-09-09 05:49:40,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:40,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-09 05:49:40,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:40,475 INFO L225 Difference]: With dead ends: 34826 [2019-09-09 05:49:40,475 INFO L226 Difference]: Without dead ends: 34826 [2019-09-09 05:49:40,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:40,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34826 states. [2019-09-09 05:49:40,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34826 to 34824. [2019-09-09 05:49:40,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34824 states. [2019-09-09 05:49:40,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34824 states to 34824 states and 43014 transitions. [2019-09-09 05:49:40,860 INFO L78 Accepts]: Start accepts. Automaton has 34824 states and 43014 transitions. Word has length 32 [2019-09-09 05:49:40,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:40,860 INFO L475 AbstractCegarLoop]: Abstraction has 34824 states and 43014 transitions. [2019-09-09 05:49:40,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:40,861 INFO L276 IsEmpty]: Start isEmpty. Operand 34824 states and 43014 transitions. [2019-09-09 05:49:40,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-09 05:49:40,885 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:40,885 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] [2019-09-09 05:49:40,885 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:40,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:40,887 INFO L82 PathProgramCache]: Analyzing trace with hash -22055336, now seen corresponding path program 1 times [2019-09-09 05:49:40,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:40,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:40,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:40,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:40,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:40,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:40,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:40,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:40,906 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:40,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:40,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:40,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:40,907 INFO L87 Difference]: Start difference. First operand 34824 states and 43014 transitions. Second operand 3 states. [2019-09-09 05:49:41,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:41,636 INFO L93 Difference]: Finished difference Result 57354 states and 70151 transitions. [2019-09-09 05:49:41,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:41,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-09 05:49:41,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:41,704 INFO L225 Difference]: With dead ends: 57354 [2019-09-09 05:49:41,705 INFO L226 Difference]: Without dead ends: 57354 [2019-09-09 05:49:41,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:41,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57354 states. [2019-09-09 05:49:42,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57354 to 53256. [2019-09-09 05:49:42,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53256 states. [2019-09-09 05:49:42,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53256 states to 53256 states and 64006 transitions. [2019-09-09 05:49:42,471 INFO L78 Accepts]: Start accepts. Automaton has 53256 states and 64006 transitions. Word has length 32 [2019-09-09 05:49:42,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:42,472 INFO L475 AbstractCegarLoop]: Abstraction has 53256 states and 64006 transitions. [2019-09-09 05:49:42,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:42,472 INFO L276 IsEmpty]: Start isEmpty. Operand 53256 states and 64006 transitions. [2019-09-09 05:49:42,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-09 05:49:42,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:42,510 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] [2019-09-09 05:49:42,511 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:42,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:42,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1301919014, now seen corresponding path program 1 times [2019-09-09 05:49:42,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:42,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:42,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:42,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:42,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:42,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:42,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:42,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:42,528 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:42,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:42,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:42,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:42,529 INFO L87 Difference]: Start difference. First operand 53256 states and 64006 transitions. Second operand 3 states. [2019-09-09 05:49:42,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:42,683 INFO L93 Difference]: Finished difference Result 67594 states and 78855 transitions. [2019-09-09 05:49:42,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:42,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-09 05:49:42,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:42,739 INFO L225 Difference]: With dead ends: 67594 [2019-09-09 05:49:42,739 INFO L226 Difference]: Without dead ends: 67594 [2019-09-09 05:49:42,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:42,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67594 states. [2019-09-09 05:49:43,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67594 to 67592. [2019-09-09 05:49:43,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67592 states. [2019-09-09 05:49:44,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67592 states to 67592 states and 78854 transitions. [2019-09-09 05:49:44,871 INFO L78 Accepts]: Start accepts. Automaton has 67592 states and 78854 transitions. Word has length 32 [2019-09-09 05:49:44,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:44,871 INFO L475 AbstractCegarLoop]: Abstraction has 67592 states and 78854 transitions. [2019-09-09 05:49:44,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:44,871 INFO L276 IsEmpty]: Start isEmpty. Operand 67592 states and 78854 transitions. [2019-09-09 05:49:44,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-09 05:49:44,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:44,900 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] [2019-09-09 05:49:44,900 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:44,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:44,900 INFO L82 PathProgramCache]: Analyzing trace with hash -683499274, now seen corresponding path program 1 times [2019-09-09 05:49:44,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:44,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:44,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:44,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:44,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:44,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:44,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:44,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:44,920 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:44,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:44,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:44,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:44,921 INFO L87 Difference]: Start difference. First operand 67592 states and 78854 transitions. Second operand 3 states. [2019-09-09 05:49:45,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:45,085 INFO L93 Difference]: Finished difference Result 68618 states and 78855 transitions. [2019-09-09 05:49:45,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:45,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-09 05:49:45,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:45,150 INFO L225 Difference]: With dead ends: 68618 [2019-09-09 05:49:45,150 INFO L226 Difference]: Without dead ends: 68618 [2019-09-09 05:49:45,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:45,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68618 states. [2019-09-09 05:49:45,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68618 to 68616. [2019-09-09 05:49:45,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68616 states. [2019-09-09 05:49:46,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68616 states to 68616 states and 78854 transitions. [2019-09-09 05:49:46,055 INFO L78 Accepts]: Start accepts. Automaton has 68616 states and 78854 transitions. Word has length 33 [2019-09-09 05:49:46,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:46,056 INFO L475 AbstractCegarLoop]: Abstraction has 68616 states and 78854 transitions. [2019-09-09 05:49:46,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:46,056 INFO L276 IsEmpty]: Start isEmpty. Operand 68616 states and 78854 transitions. [2019-09-09 05:49:46,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-09 05:49:46,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:46,089 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] [2019-09-09 05:49:46,090 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:46,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:46,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1704567628, now seen corresponding path program 1 times [2019-09-09 05:49:46,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:46,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:46,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:46,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:46,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:46,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:46,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:46,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:46,108 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:46,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:46,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:46,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:46,109 INFO L87 Difference]: Start difference. First operand 68616 states and 78854 transitions. Second operand 3 states. [2019-09-09 05:49:46,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:46,321 INFO L93 Difference]: Finished difference Result 110600 states and 123910 transitions. [2019-09-09 05:49:46,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:46,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-09 05:49:46,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:46,422 INFO L225 Difference]: With dead ends: 110600 [2019-09-09 05:49:46,423 INFO L226 Difference]: Without dead ends: 110600 [2019-09-09 05:49:46,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:46,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110600 states. [2019-09-09 05:49:48,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110600 to 106504. [2019-09-09 05:49:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106504 states. [2019-09-09 05:49:48,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106504 states to 106504 states and 119814 transitions. [2019-09-09 05:49:48,866 INFO L78 Accepts]: Start accepts. Automaton has 106504 states and 119814 transitions. Word has length 33 [2019-09-09 05:49:48,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:48,867 INFO L475 AbstractCegarLoop]: Abstraction has 106504 states and 119814 transitions. [2019-09-09 05:49:48,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:48,867 INFO L276 IsEmpty]: Start isEmpty. Operand 106504 states and 119814 transitions. [2019-09-09 05:49:48,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-09 05:49:48,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:48,922 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] [2019-09-09 05:49:48,922 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:48,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:48,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1310535990, now seen corresponding path program 1 times [2019-09-09 05:49:48,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:48,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:48,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:48,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:48,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:48,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:48,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:48,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:48,938 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:48,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:48,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:48,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:48,939 INFO L87 Difference]: Start difference. First operand 106504 states and 119814 transitions. Second operand 3 states. [2019-09-09 05:49:49,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:49,250 INFO L93 Difference]: Finished difference Result 133126 states and 143365 transitions. [2019-09-09 05:49:49,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:49,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-09 05:49:49,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:49,252 INFO L225 Difference]: With dead ends: 133126 [2019-09-09 05:49:49,252 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:49:49,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:49,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:49:49,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:49:49,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:49:49,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:49:49,254 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-09-09 05:49:49,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:49,254 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:49:49,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:49,254 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:49:49,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:49:49,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:49:49 BoogieIcfgContainer [2019-09-09 05:49:49,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:49:49,266 INFO L168 Benchmark]: Toolchain (without parser) took 16954.01 ms. Allocated memory was 133.2 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 88.9 MB in the beginning and 823.3 MB in the end (delta: -734.5 MB). Peak memory consumption was 590.4 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:49,270 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 133.2 MB. Free memory was 107.6 MB in the beginning and 107.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:49:49,271 INFO L168 Benchmark]: CACSL2BoogieTranslator took 416.50 ms. Allocated memory was 133.2 MB in the beginning and 198.7 MB in the end (delta: 65.5 MB). Free memory was 88.7 MB in the beginning and 174.8 MB in the end (delta: -86.1 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:49,272 INFO L168 Benchmark]: Boogie Preprocessor took 37.70 ms. Allocated memory is still 198.7 MB. Free memory was 174.8 MB in the beginning and 173.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:49,272 INFO L168 Benchmark]: RCFGBuilder took 433.37 ms. Allocated memory is still 198.7 MB. Free memory was 173.0 MB in the beginning and 152.5 MB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:49,273 INFO L168 Benchmark]: TraceAbstraction took 16061.51 ms. Allocated memory was 198.7 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 151.9 MB in the beginning and 823.3 MB in the end (delta: -671.5 MB). Peak memory consumption was 587.9 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:49,281 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.21 ms. Allocated memory is still 133.2 MB. Free memory was 107.6 MB in the beginning and 107.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 416.50 ms. Allocated memory was 133.2 MB in the beginning and 198.7 MB in the end (delta: 65.5 MB). Free memory was 88.7 MB in the beginning and 174.8 MB in the end (delta: -86.1 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.70 ms. Allocated memory is still 198.7 MB. Free memory was 174.8 MB in the beginning and 173.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 433.37 ms. Allocated memory is still 198.7 MB. Free memory was 173.0 MB in the beginning and 152.5 MB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16061.51 ms. Allocated memory was 198.7 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 151.9 MB in the beginning and 823.3 MB in the end (delta: -671.5 MB). Peak memory consumption was 587.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 189]: 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 3 procedures, 50 locations, 1 error locations. SAFE Result, 15.9s OverallTime, 34 OverallIterations, 1 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3416 SDtfs, 1682 SDslu, 2343 SDs, 0 SdLazy, 181 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106504occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 10.2s AutomataMinimizationTime, 34 MinimizatonAttempts, 16420 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 938 NumberOfCodeBlocks, 938 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 904 ConstructedInterpolants, 0 QuantifiedInterpolants, 49976 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...