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_10.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:26:42,220 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:26:42,223 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:26:42,239 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:26:42,239 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:26:42,240 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:26:42,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:26:42,243 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:26:42,245 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:26:42,246 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:26:42,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:26:42,248 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:26:42,249 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:26:42,250 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:26:42,251 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:26:42,252 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:26:42,253 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:26:42,254 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:26:42,256 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:26:42,258 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:26:42,260 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:26:42,261 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:26:42,262 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:26:42,263 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:26:42,265 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:26:42,266 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:26:42,266 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:26:42,267 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:26:42,268 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:26:42,269 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:26:42,269 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:26:42,270 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:26:42,271 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:26:42,271 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:26:42,272 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:26:42,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:26:42,273 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:26:42,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:26:42,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:26:42,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:26:42,275 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:26:42,276 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-20 13:26:42,301 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:26:42,302 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:26:42,302 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:26:42,302 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:26:42,303 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:26:42,303 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:26:42,304 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:26:42,304 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:26:42,304 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:26:42,304 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:26:42,305 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:26:42,305 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:26:42,305 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:26:42,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:26:42,306 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:26:42,306 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:26:42,306 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:26:42,306 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:26:42,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:26:42,307 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:26:42,307 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:26:42,307 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:26:42,307 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:26:42,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:26:42,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:26:42,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:26:42,308 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:26:42,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:26:42,309 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:26:42,309 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:26:42,345 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:26:42,357 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:26:42,360 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:26:42,362 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:26:42,362 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:26:42,363 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10.c [2019-09-20 13:26:42,428 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ec32501a/e7b11d3fcb8d48fa84b4e0181b117889/FLAG773352f8f [2019-09-20 13:26:42,908 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:26:42,909 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c [2019-09-20 13:26:42,924 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ec32501a/e7b11d3fcb8d48fa84b4e0181b117889/FLAG773352f8f [2019-09-20 13:26:43,302 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ec32501a/e7b11d3fcb8d48fa84b4e0181b117889 [2019-09-20 13:26:43,311 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:26:43,312 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:26:43,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:43,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:26:43,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:26:43,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:43" (1/1) ... [2019-09-20 13:26:43,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ec8f0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:43, skipping insertion in model container [2019-09-20 13:26:43,322 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:26:43" (1/1) ... [2019-09-20 13:26:43,330 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:26:43,350 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:26:43,551 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:43,555 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:26:43,685 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:26:43,699 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:26:43,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:43 WrapperNode [2019-09-20 13:26:43,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:26:43,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:26:43,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:26:43,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:26:43,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:43" (1/1) ... [2019-09-20 13:26:43,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:43" (1/1) ... [2019-09-20 13:26:43,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:43" (1/1) ... [2019-09-20 13:26:43,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:43" (1/1) ... [2019-09-20 13:26:43,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:43" (1/1) ... [2019-09-20 13:26:43,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:43" (1/1) ... [2019-09-20 13:26:43,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:43" (1/1) ... [2019-09-20 13:26:43,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:26:43,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:26:43,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:26:43,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:26:43,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:43" (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-20 13:26:43,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:26:43,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:26:43,799 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:26:43,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:26:43,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:26:43,799 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:26:43,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:26:43,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:26:44,147 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:26:44,148 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:26:44,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:44 BoogieIcfgContainer [2019-09-20 13:26:44,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:26:44,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:26:44,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:26:44,167 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:26:44,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:26:43" (1/3) ... [2019-09-20 13:26:44,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131e47bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:44, skipping insertion in model container [2019-09-20 13:26:44,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:26:43" (2/3) ... [2019-09-20 13:26:44,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131e47bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:26:44, skipping insertion in model container [2019-09-20 13:26:44,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:26:44" (3/3) ... [2019-09-20 13:26:44,175 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2019-09-20 13:26:44,192 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:26:44,199 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:26:44,217 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:26:44,245 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:26:44,245 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:26:44,245 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:26:44,245 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:26:44,246 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:26:44,246 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:26:44,246 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:26:44,246 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:26:44,262 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-09-20 13:26:44,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:26:44,271 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,272 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:44,274 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:44,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:44,278 INFO L82 PathProgramCache]: Analyzing trace with hash -917347053, now seen corresponding path program 1 times [2019-09-20 13:26:44,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:44,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:44,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:44,470 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-20 13:26:44,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:44,473 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:44,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:44,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,491 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-09-20 13:26:44,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:44,547 INFO L93 Difference]: Finished difference Result 80 states and 137 transitions. [2019-09-20 13:26:44,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:44,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:26:44,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:44,560 INFO L225 Difference]: With dead ends: 80 [2019-09-20 13:26:44,560 INFO L226 Difference]: Without dead ends: 72 [2019-09-20 13:26:44,562 INFO L636 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-20 13:26:44,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-20 13:26:44,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-09-20 13:26:44,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-20 13:26:44,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 89 transitions. [2019-09-20 13:26:44,616 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 89 transitions. Word has length 20 [2019-09-20 13:26:44,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:44,617 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 89 transitions. [2019-09-20 13:26:44,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:44,617 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 89 transitions. [2019-09-20 13:26:44,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:26:44,619 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,619 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:44,619 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:44,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:44,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1504153067, now seen corresponding path program 1 times [2019-09-20 13:26:44,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:44,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:44,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:44,722 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-20 13:26:44,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:44,723 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:44,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:44,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,730 INFO L87 Difference]: Start difference. First operand 50 states and 89 transitions. Second operand 3 states. [2019-09-20 13:26:44,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:44,767 INFO L93 Difference]: Finished difference Result 72 states and 126 transitions. [2019-09-20 13:26:44,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:44,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-20 13:26:44,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:44,769 INFO L225 Difference]: With dead ends: 72 [2019-09-20 13:26:44,770 INFO L226 Difference]: Without dead ends: 72 [2019-09-20 13:26:44,771 INFO L636 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-20 13:26:44,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-20 13:26:44,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-09-20 13:26:44,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-20 13:26:44,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 125 transitions. [2019-09-20 13:26:44,783 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 125 transitions. Word has length 20 [2019-09-20 13:26:44,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:44,784 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 125 transitions. [2019-09-20 13:26:44,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:44,784 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 125 transitions. [2019-09-20 13:26:44,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:26:44,785 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,786 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:44,786 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:44,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:44,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1627225809, now seen corresponding path program 1 times [2019-09-20 13:26:44,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:44,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:44,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:44,836 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-20 13:26:44,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:44,838 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:44,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:44,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,841 INFO L87 Difference]: Start difference. First operand 70 states and 125 transitions. Second operand 3 states. [2019-09-20 13:26:44,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:44,871 INFO L93 Difference]: Finished difference Result 75 states and 128 transitions. [2019-09-20 13:26:44,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:44,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:26:44,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:44,876 INFO L225 Difference]: With dead ends: 75 [2019-09-20 13:26:44,877 INFO L226 Difference]: Without dead ends: 75 [2019-09-20 13:26:44,878 INFO L636 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-20 13:26:44,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-20 13:26:44,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-09-20 13:26:44,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-20 13:26:44,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 127 transitions. [2019-09-20 13:26:44,898 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 127 transitions. Word has length 21 [2019-09-20 13:26:44,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:44,899 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 127 transitions. [2019-09-20 13:26:44,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:44,899 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2019-09-20 13:26:44,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:26:44,903 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:44,903 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:44,904 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:44,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:44,904 INFO L82 PathProgramCache]: Analyzing trace with hash 616108559, now seen corresponding path program 1 times [2019-09-20 13:26:44,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:44,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:44,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:44,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:44,989 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-20 13:26:44,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:44,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:44,990 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:44,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:44,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:44,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:44,991 INFO L87 Difference]: Start difference. First operand 73 states and 127 transitions. Second operand 3 states. [2019-09-20 13:26:45,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,021 INFO L93 Difference]: Finished difference Result 134 states and 237 transitions. [2019-09-20 13:26:45,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:45,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:26:45,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,024 INFO L225 Difference]: With dead ends: 134 [2019-09-20 13:26:45,024 INFO L226 Difference]: Without dead ends: 134 [2019-09-20 13:26:45,024 INFO L636 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-20 13:26:45,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-20 13:26:45,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2019-09-20 13:26:45,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-20 13:26:45,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 168 transitions. [2019-09-20 13:26:45,035 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 168 transitions. Word has length 21 [2019-09-20 13:26:45,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,035 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 168 transitions. [2019-09-20 13:26:45,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:45,036 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 168 transitions. [2019-09-20 13:26:45,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:26:45,037 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:45,037 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:26:45,037 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,038 INFO L82 PathProgramCache]: Analyzing trace with hash 29302545, now seen corresponding path program 1 times [2019-09-20 13:26:45,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,086 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-20 13:26:45,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:45,087 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:45,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:45,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,088 INFO L87 Difference]: Start difference. First operand 96 states and 168 transitions. Second operand 3 states. [2019-09-20 13:26:45,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,117 INFO L93 Difference]: Finished difference Result 136 states and 235 transitions. [2019-09-20 13:26:45,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:45,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-20 13:26:45,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,120 INFO L225 Difference]: With dead ends: 136 [2019-09-20 13:26:45,120 INFO L226 Difference]: Without dead ends: 136 [2019-09-20 13:26:45,121 INFO L636 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-20 13:26:45,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-20 13:26:45,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2019-09-20 13:26:45,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-20 13:26:45,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 234 transitions. [2019-09-20 13:26:45,132 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 234 transitions. Word has length 21 [2019-09-20 13:26:45,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,133 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 234 transitions. [2019-09-20 13:26:45,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:45,133 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 234 transitions. [2019-09-20 13:26:45,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:26:45,134 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:45,135 INFO L407 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-20 13:26:45,135 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1919709866, now seen corresponding path program 1 times [2019-09-20 13:26:45,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,176 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-20 13:26:45,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:45,177 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:45,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:45,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,178 INFO L87 Difference]: Start difference. First operand 134 states and 234 transitions. Second operand 3 states. [2019-09-20 13:26:45,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,200 INFO L93 Difference]: Finished difference Result 138 states and 235 transitions. [2019-09-20 13:26:45,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:45,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:26:45,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,203 INFO L225 Difference]: With dead ends: 138 [2019-09-20 13:26:45,203 INFO L226 Difference]: Without dead ends: 138 [2019-09-20 13:26:45,203 INFO L636 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-20 13:26:45,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-20 13:26:45,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-09-20 13:26:45,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-20 13:26:45,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 234 transitions. [2019-09-20 13:26:45,213 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 234 transitions. Word has length 22 [2019-09-20 13:26:45,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,214 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 234 transitions. [2019-09-20 13:26:45,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:45,214 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 234 transitions. [2019-09-20 13:26:45,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:26:45,216 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:45,216 INFO L407 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-20 13:26:45,216 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,217 INFO L82 PathProgramCache]: Analyzing trace with hash 908592616, now seen corresponding path program 1 times [2019-09-20 13:26:45,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,279 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-20 13:26:45,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:45,280 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:45,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:45,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,282 INFO L87 Difference]: Start difference. First operand 136 states and 234 transitions. Second operand 3 states. [2019-09-20 13:26:45,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,315 INFO L93 Difference]: Finished difference Result 250 states and 435 transitions. [2019-09-20 13:26:45,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:45,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:26:45,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,318 INFO L225 Difference]: With dead ends: 250 [2019-09-20 13:26:45,318 INFO L226 Difference]: Without dead ends: 250 [2019-09-20 13:26:45,319 INFO L636 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-20 13:26:45,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-20 13:26:45,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 184. [2019-09-20 13:26:45,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-20 13:26:45,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 314 transitions. [2019-09-20 13:26:45,334 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 314 transitions. Word has length 22 [2019-09-20 13:26:45,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,338 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 314 transitions. [2019-09-20 13:26:45,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:45,338 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 314 transitions. [2019-09-20 13:26:45,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-20 13:26:45,340 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:45,340 INFO L407 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-20 13:26:45,340 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,341 INFO L82 PathProgramCache]: Analyzing trace with hash 321786602, now seen corresponding path program 1 times [2019-09-20 13:26:45,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,393 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-20 13:26:45,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:45,395 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:45,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:45,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,396 INFO L87 Difference]: Start difference. First operand 184 states and 314 transitions. Second operand 3 states. [2019-09-20 13:26:45,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,426 INFO L93 Difference]: Finished difference Result 258 states and 435 transitions. [2019-09-20 13:26:45,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:45,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-20 13:26:45,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,428 INFO L225 Difference]: With dead ends: 258 [2019-09-20 13:26:45,428 INFO L226 Difference]: Without dead ends: 258 [2019-09-20 13:26:45,429 INFO L636 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-20 13:26:45,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-20 13:26:45,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-09-20 13:26:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-20 13:26:45,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 434 transitions. [2019-09-20 13:26:45,439 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 434 transitions. Word has length 22 [2019-09-20 13:26:45,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,440 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 434 transitions. [2019-09-20 13:26:45,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:45,440 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 434 transitions. [2019-09-20 13:26:45,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:26:45,441 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:45,442 INFO L407 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-20 13:26:45,442 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1898185914, now seen corresponding path program 1 times [2019-09-20 13:26:45,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,470 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-20 13:26:45,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:45,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:45,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:45,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,472 INFO L87 Difference]: Start difference. First operand 256 states and 434 transitions. Second operand 3 states. [2019-09-20 13:26:45,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,489 INFO L93 Difference]: Finished difference Result 262 states and 435 transitions. [2019-09-20 13:26:45,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:45,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:26:45,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,491 INFO L225 Difference]: With dead ends: 262 [2019-09-20 13:26:45,492 INFO L226 Difference]: Without dead ends: 262 [2019-09-20 13:26:45,492 INFO L636 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-20 13:26:45,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-09-20 13:26:45,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2019-09-20 13:26:45,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:26:45,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 434 transitions. [2019-09-20 13:26:45,501 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 434 transitions. Word has length 23 [2019-09-20 13:26:45,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,501 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 434 transitions. [2019-09-20 13:26:45,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:45,501 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 434 transitions. [2019-09-20 13:26:45,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:26:45,505 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:45,505 INFO L407 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-20 13:26:45,506 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1385664132, now seen corresponding path program 1 times [2019-09-20 13:26:45,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,532 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-20 13:26:45,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:45,533 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:45,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:45,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,534 INFO L87 Difference]: Start difference. First operand 260 states and 434 transitions. Second operand 3 states. [2019-09-20 13:26:45,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,551 INFO L93 Difference]: Finished difference Result 474 states and 799 transitions. [2019-09-20 13:26:45,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:45,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:26:45,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,555 INFO L225 Difference]: With dead ends: 474 [2019-09-20 13:26:45,556 INFO L226 Difference]: Without dead ends: 474 [2019-09-20 13:26:45,556 INFO L636 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-20 13:26:45,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-09-20 13:26:45,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 360. [2019-09-20 13:26:45,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-09-20 13:26:45,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 590 transitions. [2019-09-20 13:26:45,568 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 590 transitions. Word has length 23 [2019-09-20 13:26:45,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,568 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 590 transitions. [2019-09-20 13:26:45,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:45,569 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 590 transitions. [2019-09-20 13:26:45,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:26:45,570 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:45,570 INFO L407 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-20 13:26:45,570 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,571 INFO L82 PathProgramCache]: Analyzing trace with hash 798858118, now seen corresponding path program 1 times [2019-09-20 13:26:45,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,600 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-20 13:26:45,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:45,601 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:45,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:45,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,603 INFO L87 Difference]: Start difference. First operand 360 states and 590 transitions. Second operand 3 states. [2019-09-20 13:26:45,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,626 INFO L93 Difference]: Finished difference Result 498 states and 807 transitions. [2019-09-20 13:26:45,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:45,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:26:45,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,630 INFO L225 Difference]: With dead ends: 498 [2019-09-20 13:26:45,632 INFO L226 Difference]: Without dead ends: 498 [2019-09-20 13:26:45,633 INFO L636 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-20 13:26:45,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-09-20 13:26:45,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2019-09-20 13:26:45,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-09-20 13:26:45,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 806 transitions. [2019-09-20 13:26:45,647 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 806 transitions. Word has length 23 [2019-09-20 13:26:45,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,647 INFO L475 AbstractCegarLoop]: Abstraction has 496 states and 806 transitions. [2019-09-20 13:26:45,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:45,648 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 806 transitions. [2019-09-20 13:26:45,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:26:45,650 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:45,650 INFO L407 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-20 13:26:45,650 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,650 INFO L82 PathProgramCache]: Analyzing trace with hash 6129535, now seen corresponding path program 1 times [2019-09-20 13:26:45,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,695 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-20 13:26:45,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:45,695 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:45,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:45,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,697 INFO L87 Difference]: Start difference. First operand 496 states and 806 transitions. Second operand 3 states. [2019-09-20 13:26:45,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,718 INFO L93 Difference]: Finished difference Result 506 states and 807 transitions. [2019-09-20 13:26:45,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:45,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:26:45,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,722 INFO L225 Difference]: With dead ends: 506 [2019-09-20 13:26:45,722 INFO L226 Difference]: Without dead ends: 506 [2019-09-20 13:26:45,722 INFO L636 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-20 13:26:45,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-09-20 13:26:45,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2019-09-20 13:26:45,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-09-20 13:26:45,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 806 transitions. [2019-09-20 13:26:45,736 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 806 transitions. Word has length 24 [2019-09-20 13:26:45,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,737 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 806 transitions. [2019-09-20 13:26:45,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:45,737 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 806 transitions. [2019-09-20 13:26:45,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:26:45,738 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:45,739 INFO L407 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-20 13:26:45,739 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1004987715, now seen corresponding path program 1 times [2019-09-20 13:26:45,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,774 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-20 13:26:45,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:45,775 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:45,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:45,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,776 INFO L87 Difference]: Start difference. First operand 504 states and 806 transitions. Second operand 3 states. [2019-09-20 13:26:45,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,800 INFO L93 Difference]: Finished difference Result 906 states and 1463 transitions. [2019-09-20 13:26:45,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:45,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:26:45,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,806 INFO L225 Difference]: With dead ends: 906 [2019-09-20 13:26:45,806 INFO L226 Difference]: Without dead ends: 906 [2019-09-20 13:26:45,806 INFO L636 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-20 13:26:45,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2019-09-20 13:26:45,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 712. [2019-09-20 13:26:45,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-09-20 13:26:45,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1110 transitions. [2019-09-20 13:26:45,827 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1110 transitions. Word has length 24 [2019-09-20 13:26:45,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,827 INFO L475 AbstractCegarLoop]: Abstraction has 712 states and 1110 transitions. [2019-09-20 13:26:45,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:45,828 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1110 transitions. [2019-09-20 13:26:45,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:26:45,829 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:45,829 INFO L407 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-20 13:26:45,829 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1591793729, now seen corresponding path program 1 times [2019-09-20 13:26:45,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,866 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-20 13:26:45,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:45,869 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:45,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:45,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,870 INFO L87 Difference]: Start difference. First operand 712 states and 1110 transitions. Second operand 3 states. [2019-09-20 13:26:45,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,891 INFO L93 Difference]: Finished difference Result 970 states and 1495 transitions. [2019-09-20 13:26:45,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:45,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:26:45,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,897 INFO L225 Difference]: With dead ends: 970 [2019-09-20 13:26:45,897 INFO L226 Difference]: Without dead ends: 970 [2019-09-20 13:26:45,898 INFO L636 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-20 13:26:45,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-09-20 13:26:45,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 968. [2019-09-20 13:26:45,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-09-20 13:26:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1494 transitions. [2019-09-20 13:26:45,923 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1494 transitions. Word has length 24 [2019-09-20 13:26:45,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:45,924 INFO L475 AbstractCegarLoop]: Abstraction has 968 states and 1494 transitions. [2019-09-20 13:26:45,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1494 transitions. [2019-09-20 13:26:45,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:26:45,926 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:45,926 INFO L407 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-20 13:26:45,928 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:45,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:45,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1089633349, now seen corresponding path program 1 times [2019-09-20 13:26:45,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:45,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:45,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:45,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:45,955 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-20 13:26:45,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:45,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:45,956 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:45,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:45,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:45,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:45,957 INFO L87 Difference]: Start difference. First operand 968 states and 1494 transitions. Second operand 3 states. [2019-09-20 13:26:45,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:45,977 INFO L93 Difference]: Finished difference Result 986 states and 1495 transitions. [2019-09-20 13:26:45,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:45,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:26:45,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:45,982 INFO L225 Difference]: With dead ends: 986 [2019-09-20 13:26:45,983 INFO L226 Difference]: Without dead ends: 986 [2019-09-20 13:26:45,985 INFO L636 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-20 13:26:45,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2019-09-20 13:26:46,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2019-09-20 13:26:46,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-09-20 13:26:46,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1494 transitions. [2019-09-20 13:26:46,011 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1494 transitions. Word has length 25 [2019-09-20 13:26:46,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:46,012 INFO L475 AbstractCegarLoop]: Abstraction has 984 states and 1494 transitions. [2019-09-20 13:26:46,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:46,013 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1494 transitions. [2019-09-20 13:26:46,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:26:46,014 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:46,014 INFO L407 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-20 13:26:46,015 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:46,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:46,015 INFO L82 PathProgramCache]: Analyzing trace with hash -2100750599, now seen corresponding path program 1 times [2019-09-20 13:26:46,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:46,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:46,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:46,048 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-20 13:26:46,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:46,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:46,048 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:46,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:46,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:46,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:46,049 INFO L87 Difference]: Start difference. First operand 984 states and 1494 transitions. Second operand 3 states. [2019-09-20 13:26:46,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:46,075 INFO L93 Difference]: Finished difference Result 1738 states and 2663 transitions. [2019-09-20 13:26:46,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:46,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:26:46,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:46,084 INFO L225 Difference]: With dead ends: 1738 [2019-09-20 13:26:46,085 INFO L226 Difference]: Without dead ends: 1738 [2019-09-20 13:26:46,085 INFO L636 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-20 13:26:46,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-09-20 13:26:46,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1416. [2019-09-20 13:26:46,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2019-09-20 13:26:46,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2086 transitions. [2019-09-20 13:26:46,127 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2086 transitions. Word has length 25 [2019-09-20 13:26:46,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:46,127 INFO L475 AbstractCegarLoop]: Abstraction has 1416 states and 2086 transitions. [2019-09-20 13:26:46,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:46,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2086 transitions. [2019-09-20 13:26:46,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:26:46,130 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:46,130 INFO L407 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-20 13:26:46,131 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:46,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:46,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1607410683, now seen corresponding path program 1 times [2019-09-20 13:26:46,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:46,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:46,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:46,163 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-20 13:26:46,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:46,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:46,164 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:46,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:46,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:46,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:46,165 INFO L87 Difference]: Start difference. First operand 1416 states and 2086 transitions. Second operand 3 states. [2019-09-20 13:26:46,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:46,193 INFO L93 Difference]: Finished difference Result 1898 states and 2759 transitions. [2019-09-20 13:26:46,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:46,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:26:46,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:46,203 INFO L225 Difference]: With dead ends: 1898 [2019-09-20 13:26:46,204 INFO L226 Difference]: Without dead ends: 1898 [2019-09-20 13:26:46,204 INFO L636 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-20 13:26:46,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2019-09-20 13:26:46,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1896. [2019-09-20 13:26:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2019-09-20 13:26:46,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2758 transitions. [2019-09-20 13:26:46,261 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2758 transitions. Word has length 25 [2019-09-20 13:26:46,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:46,261 INFO L475 AbstractCegarLoop]: Abstraction has 1896 states and 2758 transitions. [2019-09-20 13:26:46,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:46,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2758 transitions. [2019-09-20 13:26:46,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:26:46,264 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:46,264 INFO L407 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-20 13:26:46,264 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:46,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:46,265 INFO L82 PathProgramCache]: Analyzing trace with hash -698544044, now seen corresponding path program 1 times [2019-09-20 13:26:46,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:46,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:46,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:46,299 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-20 13:26:46,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:46,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:46,300 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:46,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:46,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:46,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:46,301 INFO L87 Difference]: Start difference. First operand 1896 states and 2758 transitions. Second operand 3 states. [2019-09-20 13:26:46,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:46,326 INFO L93 Difference]: Finished difference Result 1930 states and 2759 transitions. [2019-09-20 13:26:46,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:46,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:26:46,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:46,336 INFO L225 Difference]: With dead ends: 1930 [2019-09-20 13:26:46,337 INFO L226 Difference]: Without dead ends: 1930 [2019-09-20 13:26:46,337 INFO L636 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-20 13:26:46,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2019-09-20 13:26:46,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2019-09-20 13:26:46,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2019-09-20 13:26:46,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2758 transitions. [2019-09-20 13:26:46,385 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2758 transitions. Word has length 26 [2019-09-20 13:26:46,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:46,386 INFO L475 AbstractCegarLoop]: Abstraction has 1928 states and 2758 transitions. [2019-09-20 13:26:46,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:46,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2758 transitions. [2019-09-20 13:26:46,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:26:46,390 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:46,391 INFO L407 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-20 13:26:46,391 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:46,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:46,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1709661294, now seen corresponding path program 1 times [2019-09-20 13:26:46,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:46,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:46,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:46,424 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-20 13:26:46,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:46,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:46,425 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:46,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:46,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:46,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:46,429 INFO L87 Difference]: Start difference. First operand 1928 states and 2758 transitions. Second operand 3 states. [2019-09-20 13:26:46,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:46,469 INFO L93 Difference]: Finished difference Result 3338 states and 4807 transitions. [2019-09-20 13:26:46,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:46,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:26:46,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:46,491 INFO L225 Difference]: With dead ends: 3338 [2019-09-20 13:26:46,491 INFO L226 Difference]: Without dead ends: 3338 [2019-09-20 13:26:46,492 INFO L636 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-20 13:26:46,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2019-09-20 13:26:46,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2824. [2019-09-20 13:26:46,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2019-09-20 13:26:46,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3910 transitions. [2019-09-20 13:26:46,581 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3910 transitions. Word has length 26 [2019-09-20 13:26:46,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:46,582 INFO L475 AbstractCegarLoop]: Abstraction has 2824 states and 3910 transitions. [2019-09-20 13:26:46,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:46,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3910 transitions. [2019-09-20 13:26:46,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:26:46,589 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:46,589 INFO L407 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-20 13:26:46,590 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:46,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:46,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1998499988, now seen corresponding path program 1 times [2019-09-20 13:26:46,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:46,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:46,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:46,615 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-20 13:26:46,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:46,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:46,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:46,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:46,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:46,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:46,617 INFO L87 Difference]: Start difference. First operand 2824 states and 3910 transitions. Second operand 3 states. [2019-09-20 13:26:46,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:46,674 INFO L93 Difference]: Finished difference Result 3722 states and 5063 transitions. [2019-09-20 13:26:46,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:46,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:26:46,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:46,696 INFO L225 Difference]: With dead ends: 3722 [2019-09-20 13:26:46,697 INFO L226 Difference]: Without dead ends: 3722 [2019-09-20 13:26:46,697 INFO L636 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-20 13:26:46,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2019-09-20 13:26:46,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3720. [2019-09-20 13:26:46,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3720 states. [2019-09-20 13:26:46,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 5062 transitions. [2019-09-20 13:26:46,802 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 5062 transitions. Word has length 26 [2019-09-20 13:26:46,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:46,803 INFO L475 AbstractCegarLoop]: Abstraction has 3720 states and 5062 transitions. [2019-09-20 13:26:46,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:46,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 5062 transitions. [2019-09-20 13:26:46,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:26:46,810 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:46,810 INFO L407 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-20 13:26:46,811 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:46,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:46,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1459677136, now seen corresponding path program 1 times [2019-09-20 13:26:46,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:46,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:46,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:46,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:46,839 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-20 13:26:46,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:46,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:46,840 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:46,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:46,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:46,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:46,841 INFO L87 Difference]: Start difference. First operand 3720 states and 5062 transitions. Second operand 3 states. [2019-09-20 13:26:46,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:46,883 INFO L93 Difference]: Finished difference Result 3786 states and 5063 transitions. [2019-09-20 13:26:46,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:46,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:26:46,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:46,907 INFO L225 Difference]: With dead ends: 3786 [2019-09-20 13:26:46,907 INFO L226 Difference]: Without dead ends: 3786 [2019-09-20 13:26:46,908 INFO L636 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-20 13:26:46,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2019-09-20 13:26:46,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2019-09-20 13:26:46,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-09-20 13:26:47,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5062 transitions. [2019-09-20 13:26:47,067 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5062 transitions. Word has length 27 [2019-09-20 13:26:47,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:47,067 INFO L475 AbstractCegarLoop]: Abstraction has 3784 states and 5062 transitions. [2019-09-20 13:26:47,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:47,067 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5062 transitions. [2019-09-20 13:26:47,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:26:47,073 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:47,073 INFO L407 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-20 13:26:47,075 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:47,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:47,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1824172910, now seen corresponding path program 1 times [2019-09-20 13:26:47,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:47,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:47,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:47,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:47,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:47,112 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-20 13:26:47,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:47,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:47,113 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:47,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:47,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:47,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:47,114 INFO L87 Difference]: Start difference. First operand 3784 states and 5062 transitions. Second operand 3 states. [2019-09-20 13:26:47,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:47,170 INFO L93 Difference]: Finished difference Result 7306 states and 9351 transitions. [2019-09-20 13:26:47,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:47,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:26:47,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:47,208 INFO L225 Difference]: With dead ends: 7306 [2019-09-20 13:26:47,209 INFO L226 Difference]: Without dead ends: 7306 [2019-09-20 13:26:47,209 INFO L636 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-20 13:26:47,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2019-09-20 13:26:47,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7304. [2019-09-20 13:26:47,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2019-09-20 13:26:47,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9350 transitions. [2019-09-20 13:26:47,361 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9350 transitions. Word has length 27 [2019-09-20 13:26:47,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:47,362 INFO L475 AbstractCegarLoop]: Abstraction has 7304 states and 9350 transitions. [2019-09-20 13:26:47,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:47,362 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9350 transitions. [2019-09-20 13:26:47,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:26:47,372 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:47,372 INFO L407 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-20 13:26:47,372 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:47,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:47,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1883988372, now seen corresponding path program 1 times [2019-09-20 13:26:47,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:47,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:47,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:47,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:47,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:47,396 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-20 13:26:47,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:47,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:47,397 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:47,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:47,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:47,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:47,398 INFO L87 Difference]: Start difference. First operand 7304 states and 9350 transitions. Second operand 3 states. [2019-09-20 13:26:47,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:47,439 INFO L93 Difference]: Finished difference Result 8074 states and 10503 transitions. [2019-09-20 13:26:47,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:47,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:26:47,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:47,457 INFO L225 Difference]: With dead ends: 8074 [2019-09-20 13:26:47,457 INFO L226 Difference]: Without dead ends: 8074 [2019-09-20 13:26:47,458 INFO L636 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-20 13:26:47,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2019-09-20 13:26:47,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 7304. [2019-09-20 13:26:47,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2019-09-20 13:26:47,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9222 transitions. [2019-09-20 13:26:47,722 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9222 transitions. Word has length 27 [2019-09-20 13:26:47,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:47,723 INFO L475 AbstractCegarLoop]: Abstraction has 7304 states and 9222 transitions. [2019-09-20 13:26:47,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:47,723 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9222 transitions. [2019-09-20 13:26:47,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:26:47,742 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:47,742 INFO L407 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-20 13:26:47,743 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:47,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:47,744 INFO L82 PathProgramCache]: Analyzing trace with hash 715001129, now seen corresponding path program 1 times [2019-09-20 13:26:47,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:47,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:47,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:47,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:47,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:47,774 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-20 13:26:47,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:47,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:47,775 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:47,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:47,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:47,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:47,776 INFO L87 Difference]: Start difference. First operand 7304 states and 9222 transitions. Second operand 3 states. [2019-09-20 13:26:47,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:47,841 INFO L93 Difference]: Finished difference Result 12170 states and 15239 transitions. [2019-09-20 13:26:47,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:47,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-20 13:26:47,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:47,876 INFO L225 Difference]: With dead ends: 12170 [2019-09-20 13:26:47,876 INFO L226 Difference]: Without dead ends: 12170 [2019-09-20 13:26:47,883 INFO L636 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-20 13:26:47,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2019-09-20 13:26:48,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 11144. [2019-09-20 13:26:48,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2019-09-20 13:26:48,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 13702 transitions. [2019-09-20 13:26:48,091 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 13702 transitions. Word has length 28 [2019-09-20 13:26:48,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:48,092 INFO L475 AbstractCegarLoop]: Abstraction has 11144 states and 13702 transitions. [2019-09-20 13:26:48,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:48,092 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 13702 transitions. [2019-09-20 13:26:48,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:26:48,112 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:48,112 INFO L407 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-20 13:26:48,112 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:48,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:48,113 INFO L82 PathProgramCache]: Analyzing trace with hash 128195115, now seen corresponding path program 1 times [2019-09-20 13:26:48,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:48,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:48,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:48,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:48,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:48,134 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-20 13:26:48,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:48,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:48,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:48,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:48,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:48,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:48,136 INFO L87 Difference]: Start difference. First operand 11144 states and 13702 transitions. Second operand 3 states. [2019-09-20 13:26:48,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:48,194 INFO L93 Difference]: Finished difference Result 14218 states and 16903 transitions. [2019-09-20 13:26:48,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:48,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-20 13:26:48,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:48,224 INFO L225 Difference]: With dead ends: 14218 [2019-09-20 13:26:48,224 INFO L226 Difference]: Without dead ends: 14218 [2019-09-20 13:26:48,225 INFO L636 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-20 13:26:48,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2019-09-20 13:26:48,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 14216. [2019-09-20 13:26:48,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2019-09-20 13:26:48,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 16902 transitions. [2019-09-20 13:26:48,669 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 16902 transitions. Word has length 28 [2019-09-20 13:26:48,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:48,669 INFO L475 AbstractCegarLoop]: Abstraction has 14216 states and 16902 transitions. [2019-09-20 13:26:48,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:48,670 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 16902 transitions. [2019-09-20 13:26:48,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:26:48,691 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:48,691 INFO L407 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-20 13:26:48,692 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:48,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:48,693 INFO L82 PathProgramCache]: Analyzing trace with hash 690414627, now seen corresponding path program 1 times [2019-09-20 13:26:48,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:48,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:48,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:48,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:48,696 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:48,710 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-20 13:26:48,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:48,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:48,711 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:48,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:48,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:48,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:48,713 INFO L87 Difference]: Start difference. First operand 14216 states and 16902 transitions. Second operand 3 states. [2019-09-20 13:26:48,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:48,772 INFO L93 Difference]: Finished difference Result 14602 states and 17159 transitions. [2019-09-20 13:26:48,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:48,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-20 13:26:48,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:48,805 INFO L225 Difference]: With dead ends: 14602 [2019-09-20 13:26:48,805 INFO L226 Difference]: Without dead ends: 14602 [2019-09-20 13:26:48,806 INFO L636 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-20 13:26:48,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14602 states. [2019-09-20 13:26:48,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14602 to 14600. [2019-09-20 13:26:48,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2019-09-20 13:26:49,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 17158 transitions. [2019-09-20 13:26:49,035 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 17158 transitions. Word has length 29 [2019-09-20 13:26:49,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:49,036 INFO L475 AbstractCegarLoop]: Abstraction has 14600 states and 17158 transitions. [2019-09-20 13:26:49,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:49,036 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 17158 transitions. [2019-09-20 13:26:49,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:26:49,057 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:49,057 INFO L407 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-20 13:26:49,057 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:49,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:49,058 INFO L82 PathProgramCache]: Analyzing trace with hash -320702623, now seen corresponding path program 1 times [2019-09-20 13:26:49,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:49,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:49,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:49,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:49,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:49,076 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-20 13:26:49,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:49,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:49,076 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:49,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:49,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:49,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:49,077 INFO L87 Difference]: Start difference. First operand 14600 states and 17158 transitions. Second operand 3 states. [2019-09-20 13:26:49,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:49,157 INFO L93 Difference]: Finished difference Result 23560 states and 26886 transitions. [2019-09-20 13:26:49,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:49,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-20 13:26:49,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:49,205 INFO L225 Difference]: With dead ends: 23560 [2019-09-20 13:26:49,205 INFO L226 Difference]: Without dead ends: 23560 [2019-09-20 13:26:49,205 INFO L636 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-20 13:26:49,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23560 states. [2019-09-20 13:26:49,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23560 to 22536. [2019-09-20 13:26:49,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22536 states. [2019-09-20 13:26:50,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22536 states to 22536 states and 25862 transitions. [2019-09-20 13:26:50,018 INFO L78 Accepts]: Start accepts. Automaton has 22536 states and 25862 transitions. Word has length 29 [2019-09-20 13:26:50,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:50,019 INFO L475 AbstractCegarLoop]: Abstraction has 22536 states and 25862 transitions. [2019-09-20 13:26:50,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:50,019 INFO L276 IsEmpty]: Start isEmpty. Operand 22536 states and 25862 transitions. [2019-09-20 13:26:50,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:26:50,061 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:50,061 INFO L407 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-20 13:26:50,062 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:50,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:50,062 INFO L82 PathProgramCache]: Analyzing trace with hash -907508637, now seen corresponding path program 1 times [2019-09-20 13:26:50,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:50,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:50,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:50,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:50,082 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-20 13:26:50,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:26:50,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:26:50,083 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:26:50,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:26:50,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:26:50,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:26:50,084 INFO L87 Difference]: Start difference. First operand 22536 states and 25862 transitions. Second operand 3 states. [2019-09-20 13:26:50,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:50,168 INFO L93 Difference]: Finished difference Result 28166 states and 30725 transitions. [2019-09-20 13:26:50,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:26:50,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-20 13:26:50,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:50,169 INFO L225 Difference]: With dead ends: 28166 [2019-09-20 13:26:50,169 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:26:50,169 INFO L636 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-20 13:26:50,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:26:50,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:26:50,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:26:50,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:26:50,170 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-09-20 13:26:50,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:50,170 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:26:50,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:26:50,170 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:26:50,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:26:50,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:26:50 BoogieIcfgContainer [2019-09-20 13:26:50,178 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:26:50,180 INFO L168 Benchmark]: Toolchain (without parser) took 6866.90 ms. Allocated memory was 133.2 MB in the beginning and 486.5 MB in the end (delta: 353.4 MB). Free memory was 87.3 MB in the beginning and 248.9 MB in the end (delta: -161.6 MB). Peak memory consumption was 191.8 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:50,181 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 133.2 MB. Free memory was 106.1 MB in the beginning and 105.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:26:50,183 INFO L168 Benchmark]: CACSL2BoogieTranslator took 387.19 ms. Allocated memory was 133.2 MB in the beginning and 199.8 MB in the end (delta: 66.6 MB). Free memory was 87.1 MB in the beginning and 175.5 MB in the end (delta: -88.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:50,186 INFO L168 Benchmark]: Boogie Preprocessor took 36.54 ms. Allocated memory is still 199.8 MB. Free memory was 175.5 MB in the beginning and 173.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:50,189 INFO L168 Benchmark]: RCFGBuilder took 411.96 ms. Allocated memory is still 199.8 MB. Free memory was 173.8 MB in the beginning and 154.9 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:50,190 INFO L168 Benchmark]: TraceAbstraction took 6026.84 ms. Allocated memory was 199.8 MB in the beginning and 486.5 MB in the end (delta: 286.8 MB). Free memory was 154.3 MB in the beginning and 248.9 MB in the end (delta: -94.6 MB). Peak memory consumption was 192.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:26:50,198 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 133.2 MB. Free memory was 106.1 MB in the beginning and 105.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 387.19 ms. Allocated memory was 133.2 MB in the beginning and 199.8 MB in the end (delta: 66.6 MB). Free memory was 87.1 MB in the beginning and 175.5 MB in the end (delta: -88.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.54 ms. Allocated memory is still 199.8 MB. Free memory was 175.5 MB in the beginning and 173.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 411.96 ms. Allocated memory is still 199.8 MB. Free memory was 173.8 MB in the beginning and 154.9 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6026.84 ms. Allocated memory was 199.8 MB in the beginning and 486.5 MB in the end (delta: 286.8 MB). Free memory was 154.3 MB in the beginning and 248.9 MB in the end (delta: -94.6 MB). Peak memory consumption was 192.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: 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, 44 locations, 1 error locations. SAFE Result, 5.9s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2384 SDtfs, 1153 SDslu, 1624 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22536occurred in iteration=27, 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: 2.8s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 659 ConstructedInterpolants, 0 QuantifiedInterpolants, 31265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...