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_7.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:04:46,447 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:04:46,449 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:04:46,461 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:04:46,462 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:04:46,463 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:04:46,464 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:04:46,466 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:04:46,467 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:04:46,468 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:04:46,469 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:04:46,470 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:04:46,471 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:04:46,472 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:04:46,473 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:04:46,474 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:04:46,475 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:04:46,476 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:04:46,477 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:04:46,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:04:46,481 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:04:46,482 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:04:46,483 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:04:46,483 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:04:46,486 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:04:46,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:04:46,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:04:46,487 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:04:46,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:04:46,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:04:46,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:04:46,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:04:46,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:04:46,491 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:04:46,492 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:04:46,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:04:46,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:04:46,493 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:04:46,493 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:04:46,494 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:04:46,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:04:46,495 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-16 17:04:46,510 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:04:46,510 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:04:46,511 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:04:46,511 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:04:46,511 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:04:46,512 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:04:46,512 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:04:46,512 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:04:46,512 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:04:46,512 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:04:46,513 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:04:46,513 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:04:46,513 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:04:46,514 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:04:46,514 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:04:46,514 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:04:46,514 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:04:46,514 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:04:46,514 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:04:46,515 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:04:46,515 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:04:46,515 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:04:46,515 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:04:46,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:04:46,516 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:04:46,516 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:04:46,516 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:04:46,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:04:46,517 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:04:46,517 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:04:46,544 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:04:46,557 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:04:46,560 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:04:46,562 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:04:46,562 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:04:46,563 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2019-09-16 17:04:46,620 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/355cbefc6/7c18637ec4904e189275a3f6bcd65702/FLAG32de683a4 [2019-09-16 17:04:47,055 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:04:47,056 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2019-09-16 17:04:47,067 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/355cbefc6/7c18637ec4904e189275a3f6bcd65702/FLAG32de683a4 [2019-09-16 17:04:47,444 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/355cbefc6/7c18637ec4904e189275a3f6bcd65702 [2019-09-16 17:04:47,453 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:04:47,454 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:04:47,455 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:47,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:04:47,458 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:04:47,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:47" (1/1) ... [2019-09-16 17:04:47,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52e46397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:47, skipping insertion in model container [2019-09-16 17:04:47,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:47" (1/1) ... [2019-09-16 17:04:47,473 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:04:47,497 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:04:47,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:47,700 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:04:47,725 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:47,841 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:04:47,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:47 WrapperNode [2019-09-16 17:04:47,842 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:47,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:04:47,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:04:47,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:04:47,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:47" (1/1) ... [2019-09-16 17:04:47,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:47" (1/1) ... [2019-09-16 17:04:47,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:47" (1/1) ... [2019-09-16 17:04:47,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:47" (1/1) ... [2019-09-16 17:04:47,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:47" (1/1) ... [2019-09-16 17:04:47,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:47" (1/1) ... [2019-09-16 17:04:47,883 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:47" (1/1) ... [2019-09-16 17:04:47,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:04:47,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:04:47,888 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:04:47,889 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:04:47,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:04:47,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:04:47,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:04:47,960 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:04:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:04:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:04:47,961 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:04:47,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:04:47,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:04:48,263 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:04:48,263 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 17:04:48,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:48 BoogieIcfgContainer [2019-09-16 17:04:48,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:04:48,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:04:48,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:04:48,269 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:04:48,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:04:47" (1/3) ... [2019-09-16 17:04:48,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29366704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:48, skipping insertion in model container [2019-09-16 17:04:48,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:47" (2/3) ... [2019-09-16 17:04:48,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29366704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:48, skipping insertion in model container [2019-09-16 17:04:48,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:48" (3/3) ... [2019-09-16 17:04:48,275 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2019-09-16 17:04:48,298 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:04:48,307 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:04:48,322 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:04:48,351 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:04:48,351 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:04:48,352 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:04:48,352 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:04:48,352 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:04:48,353 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:04:48,353 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:04:48,354 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:04:48,372 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-09-16 17:04:48,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-16 17:04:48,382 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:48,382 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:48,385 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:48,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:48,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1819770524, now seen corresponding path program 1 times [2019-09-16 17:04:48,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:48,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:48,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:48,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:48,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:48,549 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-16 17:04:48,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:48,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:48,552 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:48,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:48,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:48,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:48,575 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-09-16 17:04:48,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:48,631 INFO L93 Difference]: Finished difference Result 62 states and 101 transitions. [2019-09-16 17:04:48,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:48,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-16 17:04:48,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:48,642 INFO L225 Difference]: With dead ends: 62 [2019-09-16 17:04:48,643 INFO L226 Difference]: Without dead ends: 54 [2019-09-16 17:04:48,645 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-16 17:04:48,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-16 17:04:48,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-09-16 17:04:48,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-16 17:04:48,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 65 transitions. [2019-09-16 17:04:48,681 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 65 transitions. Word has length 17 [2019-09-16 17:04:48,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:48,682 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 65 transitions. [2019-09-16 17:04:48,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:48,682 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 65 transitions. [2019-09-16 17:04:48,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-16 17:04:48,684 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:48,685 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:48,685 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:48,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:48,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1426743514, now seen corresponding path program 1 times [2019-09-16 17:04:48,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:48,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:48,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:48,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:48,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:48,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:48,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:48,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:48,741 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:48,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:48,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:48,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:48,743 INFO L87 Difference]: Start difference. First operand 38 states and 65 transitions. Second operand 3 states. [2019-09-16 17:04:48,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:48,781 INFO L93 Difference]: Finished difference Result 54 states and 90 transitions. [2019-09-16 17:04:48,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:48,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-16 17:04:48,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:48,783 INFO L225 Difference]: With dead ends: 54 [2019-09-16 17:04:48,783 INFO L226 Difference]: Without dead ends: 54 [2019-09-16 17:04:48,784 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-16 17:04:48,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-16 17:04:48,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-09-16 17:04:48,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-16 17:04:48,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 89 transitions. [2019-09-16 17:04:48,792 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 89 transitions. Word has length 17 [2019-09-16 17:04:48,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:48,792 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 89 transitions. [2019-09-16 17:04:48,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:48,793 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 89 transitions. [2019-09-16 17:04:48,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-16 17:04:48,794 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:48,794 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:48,794 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:48,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:48,795 INFO L82 PathProgramCache]: Analyzing trace with hash 578525748, now seen corresponding path program 1 times [2019-09-16 17:04:48,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:48,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:48,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:48,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:48,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:48,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-16 17:04:48,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:48,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:48,840 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:48,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:48,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:48,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:48,846 INFO L87 Difference]: Start difference. First operand 52 states and 89 transitions. Second operand 3 states. [2019-09-16 17:04:48,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:48,874 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2019-09-16 17:04:48,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:48,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-16 17:04:48,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:48,877 INFO L225 Difference]: With dead ends: 57 [2019-09-16 17:04:48,877 INFO L226 Difference]: Without dead ends: 57 [2019-09-16 17:04:48,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-16 17:04:48,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-16 17:04:48,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-09-16 17:04:48,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-16 17:04:48,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 91 transitions. [2019-09-16 17:04:48,891 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 91 transitions. Word has length 18 [2019-09-16 17:04:48,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:48,893 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 91 transitions. [2019-09-16 17:04:48,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:48,893 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2019-09-16 17:04:48,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-16 17:04:48,894 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:48,894 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:48,895 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:48,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:48,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1279590326, now seen corresponding path program 1 times [2019-09-16 17:04:48,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:48,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:48,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:48,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:48,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:48,940 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-16 17:04:48,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:48,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:48,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:48,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:48,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:48,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:48,943 INFO L87 Difference]: Start difference. First operand 55 states and 91 transitions. Second operand 3 states. [2019-09-16 17:04:48,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:48,971 INFO L93 Difference]: Finished difference Result 98 states and 165 transitions. [2019-09-16 17:04:48,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:48,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-16 17:04:48,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:48,974 INFO L225 Difference]: With dead ends: 98 [2019-09-16 17:04:48,974 INFO L226 Difference]: Without dead ends: 98 [2019-09-16 17:04:48,975 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-16 17:04:48,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-16 17:04:48,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2019-09-16 17:04:48,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-16 17:04:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 120 transitions. [2019-09-16 17:04:48,985 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 120 transitions. Word has length 18 [2019-09-16 17:04:48,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:48,985 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 120 transitions. [2019-09-16 17:04:48,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:48,986 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 120 transitions. [2019-09-16 17:04:48,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-16 17:04:48,987 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:48,987 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:48,987 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:48,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:48,988 INFO L82 PathProgramCache]: Analyzing trace with hash 886563316, now seen corresponding path program 1 times [2019-09-16 17:04:48,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:48,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:48,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:48,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:48,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:49,021 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-16 17:04:49,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:49,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:49,021 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:49,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:49,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:49,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:49,023 INFO L87 Difference]: Start difference. First operand 72 states and 120 transitions. Second operand 3 states. [2019-09-16 17:04:49,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:49,040 INFO L93 Difference]: Finished difference Result 100 states and 163 transitions. [2019-09-16 17:04:49,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:49,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-16 17:04:49,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:49,042 INFO L225 Difference]: With dead ends: 100 [2019-09-16 17:04:49,042 INFO L226 Difference]: Without dead ends: 100 [2019-09-16 17:04:49,043 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-16 17:04:49,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-16 17:04:49,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-09-16 17:04:49,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-16 17:04:49,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 162 transitions. [2019-09-16 17:04:49,053 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 162 transitions. Word has length 18 [2019-09-16 17:04:49,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:49,053 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 162 transitions. [2019-09-16 17:04:49,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:49,054 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 162 transitions. [2019-09-16 17:04:49,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-16 17:04:49,055 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:49,055 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:49,055 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:49,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:49,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1012809135, now seen corresponding path program 1 times [2019-09-16 17:04:49,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:49,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:49,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:49,092 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-16 17:04:49,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:49,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:49,093 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:49,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:49,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:49,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:49,094 INFO L87 Difference]: Start difference. First operand 98 states and 162 transitions. Second operand 3 states. [2019-09-16 17:04:49,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:49,121 INFO L93 Difference]: Finished difference Result 102 states and 163 transitions. [2019-09-16 17:04:49,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:49,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-16 17:04:49,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:49,123 INFO L225 Difference]: With dead ends: 102 [2019-09-16 17:04:49,124 INFO L226 Difference]: Without dead ends: 102 [2019-09-16 17:04:49,124 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-16 17:04:49,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-16 17:04:49,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-09-16 17:04:49,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-16 17:04:49,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 162 transitions. [2019-09-16 17:04:49,134 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 162 transitions. Word has length 19 [2019-09-16 17:04:49,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:49,134 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 162 transitions. [2019-09-16 17:04:49,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:49,135 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 162 transitions. [2019-09-16 17:04:49,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-16 17:04:49,136 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:49,136 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:49,137 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:49,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:49,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1713873713, now seen corresponding path program 1 times [2019-09-16 17:04:49,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:49,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:49,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:49,212 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-16 17:04:49,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:49,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:49,213 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:49,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:49,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:49,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:49,214 INFO L87 Difference]: Start difference. First operand 100 states and 162 transitions. Second operand 3 states. [2019-09-16 17:04:49,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:49,229 INFO L93 Difference]: Finished difference Result 178 states and 291 transitions. [2019-09-16 17:04:49,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:49,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-16 17:04:49,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:49,231 INFO L225 Difference]: With dead ends: 178 [2019-09-16 17:04:49,231 INFO L226 Difference]: Without dead ends: 178 [2019-09-16 17:04:49,232 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-16 17:04:49,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-16 17:04:49,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 136. [2019-09-16 17:04:49,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-16 17:04:49,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 218 transitions. [2019-09-16 17:04:49,242 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 218 transitions. Word has length 19 [2019-09-16 17:04:49,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:49,243 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 218 transitions. [2019-09-16 17:04:49,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:49,243 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 218 transitions. [2019-09-16 17:04:49,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-16 17:04:49,245 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:49,245 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:49,245 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:49,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:49,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1320846703, now seen corresponding path program 1 times [2019-09-16 17:04:49,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:49,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:49,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:49,295 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-16 17:04:49,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:49,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:49,296 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:49,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:49,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:49,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:49,297 INFO L87 Difference]: Start difference. First operand 136 states and 218 transitions. Second operand 3 states. [2019-09-16 17:04:49,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:49,315 INFO L93 Difference]: Finished difference Result 186 states and 291 transitions. [2019-09-16 17:04:49,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:49,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-16 17:04:49,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:49,317 INFO L225 Difference]: With dead ends: 186 [2019-09-16 17:04:49,317 INFO L226 Difference]: Without dead ends: 186 [2019-09-16 17:04:49,318 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-16 17:04:49,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-16 17:04:49,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2019-09-16 17:04:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-16 17:04:49,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 290 transitions. [2019-09-16 17:04:49,331 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 290 transitions. Word has length 19 [2019-09-16 17:04:49,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:49,332 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 290 transitions. [2019-09-16 17:04:49,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:49,332 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 290 transitions. [2019-09-16 17:04:49,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 17:04:49,333 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:49,334 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-16 17:04:49,334 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:49,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:49,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1590692585, now seen corresponding path program 1 times [2019-09-16 17:04:49,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:49,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:49,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:49,365 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-16 17:04:49,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:49,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:49,366 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:49,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:49,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:49,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:49,367 INFO L87 Difference]: Start difference. First operand 184 states and 290 transitions. Second operand 3 states. [2019-09-16 17:04:49,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:49,384 INFO L93 Difference]: Finished difference Result 190 states and 291 transitions. [2019-09-16 17:04:49,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:49,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-16 17:04:49,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:49,386 INFO L225 Difference]: With dead ends: 190 [2019-09-16 17:04:49,386 INFO L226 Difference]: Without dead ends: 190 [2019-09-16 17:04:49,387 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-16 17:04:49,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-16 17:04:49,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2019-09-16 17:04:49,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-09-16 17:04:49,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 290 transitions. [2019-09-16 17:04:49,406 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 290 transitions. Word has length 20 [2019-09-16 17:04:49,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:49,406 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 290 transitions. [2019-09-16 17:04:49,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:49,406 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 290 transitions. [2019-09-16 17:04:49,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 17:04:49,408 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:49,408 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-16 17:04:49,408 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:49,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:49,409 INFO L82 PathProgramCache]: Analyzing trace with hash -2003210133, now seen corresponding path program 1 times [2019-09-16 17:04:49,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:49,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:49,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:49,463 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-16 17:04:49,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:49,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:49,463 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:49,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:49,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:49,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:49,466 INFO L87 Difference]: Start difference. First operand 188 states and 290 transitions. Second operand 3 states. [2019-09-16 17:04:49,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:49,483 INFO L93 Difference]: Finished difference Result 330 states and 511 transitions. [2019-09-16 17:04:49,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:49,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-16 17:04:49,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:49,486 INFO L225 Difference]: With dead ends: 330 [2019-09-16 17:04:49,487 INFO L226 Difference]: Without dead ends: 330 [2019-09-16 17:04:49,487 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-16 17:04:49,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-16 17:04:49,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 264. [2019-09-16 17:04:49,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-16 17:04:49,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 398 transitions. [2019-09-16 17:04:49,509 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 398 transitions. Word has length 20 [2019-09-16 17:04:49,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:49,509 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 398 transitions. [2019-09-16 17:04:49,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:49,510 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 398 transitions. [2019-09-16 17:04:49,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 17:04:49,518 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:49,518 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-16 17:04:49,518 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:49,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:49,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1898730153, now seen corresponding path program 1 times [2019-09-16 17:04:49,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:49,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:49,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:49,567 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-16 17:04:49,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:49,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:49,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:49,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:49,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:49,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:49,569 INFO L87 Difference]: Start difference. First operand 264 states and 398 transitions. Second operand 3 states. [2019-09-16 17:04:49,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:49,591 INFO L93 Difference]: Finished difference Result 354 states and 519 transitions. [2019-09-16 17:04:49,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:49,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-16 17:04:49,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:49,596 INFO L225 Difference]: With dead ends: 354 [2019-09-16 17:04:49,596 INFO L226 Difference]: Without dead ends: 354 [2019-09-16 17:04:49,597 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-16 17:04:49,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-09-16 17:04:49,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2019-09-16 17:04:49,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-16 17:04:49,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 518 transitions. [2019-09-16 17:04:49,607 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 518 transitions. Word has length 20 [2019-09-16 17:04:49,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:49,607 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 518 transitions. [2019-09-16 17:04:49,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:49,608 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 518 transitions. [2019-09-16 17:04:49,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-16 17:04:49,610 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:49,610 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-16 17:04:49,610 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:49,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:49,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1969756604, now seen corresponding path program 1 times [2019-09-16 17:04:49,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:49,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:49,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:49,647 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-16 17:04:49,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:49,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:49,648 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:49,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:49,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:49,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:49,650 INFO L87 Difference]: Start difference. First operand 352 states and 518 transitions. Second operand 3 states. [2019-09-16 17:04:49,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:49,665 INFO L93 Difference]: Finished difference Result 362 states and 519 transitions. [2019-09-16 17:04:49,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:49,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-16 17:04:49,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:49,667 INFO L225 Difference]: With dead ends: 362 [2019-09-16 17:04:49,668 INFO L226 Difference]: Without dead ends: 362 [2019-09-16 17:04:49,668 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-16 17:04:49,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-09-16 17:04:49,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2019-09-16 17:04:49,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-09-16 17:04:49,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 518 transitions. [2019-09-16 17:04:49,677 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 518 transitions. Word has length 21 [2019-09-16 17:04:49,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:49,677 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 518 transitions. [2019-09-16 17:04:49,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:49,678 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 518 transitions. [2019-09-16 17:04:49,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-16 17:04:49,679 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:49,679 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-16 17:04:49,679 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:49,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:49,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1268692026, now seen corresponding path program 1 times [2019-09-16 17:04:49,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:49,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:49,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:49,712 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-16 17:04:49,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:49,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:49,713 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:49,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:49,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:49,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:49,714 INFO L87 Difference]: Start difference. First operand 360 states and 518 transitions. Second operand 3 states. [2019-09-16 17:04:49,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:49,728 INFO L93 Difference]: Finished difference Result 618 states and 887 transitions. [2019-09-16 17:04:49,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:49,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-16 17:04:49,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:49,732 INFO L225 Difference]: With dead ends: 618 [2019-09-16 17:04:49,732 INFO L226 Difference]: Without dead ends: 618 [2019-09-16 17:04:49,733 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-16 17:04:49,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-09-16 17:04:49,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 520. [2019-09-16 17:04:49,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-09-16 17:04:49,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 726 transitions. [2019-09-16 17:04:49,746 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 726 transitions. Word has length 21 [2019-09-16 17:04:49,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:49,747 INFO L475 AbstractCegarLoop]: Abstraction has 520 states and 726 transitions. [2019-09-16 17:04:49,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:49,747 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 726 transitions. [2019-09-16 17:04:49,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-16 17:04:49,748 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:49,749 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-16 17:04:49,749 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:49,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:49,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1661719036, now seen corresponding path program 1 times [2019-09-16 17:04:49,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:49,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:49,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:49,771 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-16 17:04:49,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:49,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:49,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:49,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:49,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:49,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:49,773 INFO L87 Difference]: Start difference. First operand 520 states and 726 transitions. Second operand 3 states. [2019-09-16 17:04:49,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:49,793 INFO L93 Difference]: Finished difference Result 682 states and 919 transitions. [2019-09-16 17:04:49,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:49,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-16 17:04:49,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:49,797 INFO L225 Difference]: With dead ends: 682 [2019-09-16 17:04:49,797 INFO L226 Difference]: Without dead ends: 682 [2019-09-16 17:04:49,798 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-16 17:04:49,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-09-16 17:04:49,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2019-09-16 17:04:49,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-09-16 17:04:49,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 918 transitions. [2019-09-16 17:04:49,814 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 918 transitions. Word has length 21 [2019-09-16 17:04:49,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:49,814 INFO L475 AbstractCegarLoop]: Abstraction has 680 states and 918 transitions. [2019-09-16 17:04:49,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:49,815 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 918 transitions. [2019-09-16 17:04:49,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-16 17:04:49,816 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:49,816 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-16 17:04:49,817 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:49,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:49,817 INFO L82 PathProgramCache]: Analyzing trace with hash -674531426, now seen corresponding path program 1 times [2019-09-16 17:04:49,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:49,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:49,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:49,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-16 17:04:49,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:49,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:49,837 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:49,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:49,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:49,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:49,838 INFO L87 Difference]: Start difference. First operand 680 states and 918 transitions. Second operand 3 states. [2019-09-16 17:04:49,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:49,855 INFO L93 Difference]: Finished difference Result 698 states and 919 transitions. [2019-09-16 17:04:49,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:49,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-16 17:04:49,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:49,859 INFO L225 Difference]: With dead ends: 698 [2019-09-16 17:04:49,860 INFO L226 Difference]: Without dead ends: 698 [2019-09-16 17:04:49,862 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-16 17:04:49,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-09-16 17:04:49,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2019-09-16 17:04:49,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-09-16 17:04:49,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 918 transitions. [2019-09-16 17:04:49,878 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 918 transitions. Word has length 22 [2019-09-16 17:04:49,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:49,878 INFO L475 AbstractCegarLoop]: Abstraction has 696 states and 918 transitions. [2019-09-16 17:04:49,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:49,878 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 918 transitions. [2019-09-16 17:04:49,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-16 17:04:49,880 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:49,880 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-16 17:04:49,880 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:49,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:49,881 INFO L82 PathProgramCache]: Analyzing trace with hash 26533152, now seen corresponding path program 1 times [2019-09-16 17:04:49,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:49,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:49,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:49,907 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-16 17:04:49,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:49,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:49,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:49,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:49,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:49,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:49,909 INFO L87 Difference]: Start difference. First operand 696 states and 918 transitions. Second operand 3 states. [2019-09-16 17:04:49,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:49,932 INFO L93 Difference]: Finished difference Result 1162 states and 1511 transitions. [2019-09-16 17:04:49,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:49,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-16 17:04:49,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:49,940 INFO L225 Difference]: With dead ends: 1162 [2019-09-16 17:04:49,940 INFO L226 Difference]: Without dead ends: 1162 [2019-09-16 17:04:49,940 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-16 17:04:49,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-09-16 17:04:49,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1032. [2019-09-16 17:04:49,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2019-09-16 17:04:49,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1318 transitions. [2019-09-16 17:04:49,973 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1318 transitions. Word has length 22 [2019-09-16 17:04:49,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:49,974 INFO L475 AbstractCegarLoop]: Abstraction has 1032 states and 1318 transitions. [2019-09-16 17:04:49,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:49,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1318 transitions. [2019-09-16 17:04:49,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-16 17:04:49,977 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:49,977 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-16 17:04:49,978 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:49,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:49,978 INFO L82 PathProgramCache]: Analyzing trace with hash -366493858, now seen corresponding path program 1 times [2019-09-16 17:04:49,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:49,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:49,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:49,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:50,013 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-16 17:04:50,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:50,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:50,014 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:50,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:50,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:50,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:50,015 INFO L87 Difference]: Start difference. First operand 1032 states and 1318 transitions. Second operand 3 states. [2019-09-16 17:04:50,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:50,037 INFO L93 Difference]: Finished difference Result 1322 states and 1607 transitions. [2019-09-16 17:04:50,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:50,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-16 17:04:50,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:50,044 INFO L225 Difference]: With dead ends: 1322 [2019-09-16 17:04:50,044 INFO L226 Difference]: Without dead ends: 1322 [2019-09-16 17:04:50,045 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-16 17:04:50,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-09-16 17:04:50,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1320. [2019-09-16 17:04:50,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2019-09-16 17:04:50,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1606 transitions. [2019-09-16 17:04:50,074 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1606 transitions. Word has length 22 [2019-09-16 17:04:50,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:50,075 INFO L475 AbstractCegarLoop]: Abstraction has 1320 states and 1606 transitions. [2019-09-16 17:04:50,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:50,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1606 transitions. [2019-09-16 17:04:50,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-16 17:04:50,078 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:50,078 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-16 17:04:50,078 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:50,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:50,079 INFO L82 PathProgramCache]: Analyzing trace with hash 822743769, now seen corresponding path program 1 times [2019-09-16 17:04:50,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:50,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:50,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:50,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:50,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:50,101 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-16 17:04:50,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:50,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:50,103 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:50,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:50,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:50,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:50,104 INFO L87 Difference]: Start difference. First operand 1320 states and 1606 transitions. Second operand 3 states. [2019-09-16 17:04:50,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:50,124 INFO L93 Difference]: Finished difference Result 1354 states and 1607 transitions. [2019-09-16 17:04:50,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:50,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-16 17:04:50,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:50,132 INFO L225 Difference]: With dead ends: 1354 [2019-09-16 17:04:50,132 INFO L226 Difference]: Without dead ends: 1354 [2019-09-16 17:04:50,132 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-16 17:04:50,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-09-16 17:04:50,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2019-09-16 17:04:50,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-09-16 17:04:50,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1606 transitions. [2019-09-16 17:04:50,165 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1606 transitions. Word has length 23 [2019-09-16 17:04:50,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:50,167 INFO L475 AbstractCegarLoop]: Abstraction has 1352 states and 1606 transitions. [2019-09-16 17:04:50,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:50,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1606 transitions. [2019-09-16 17:04:50,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-16 17:04:50,170 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:50,170 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-16 17:04:50,171 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:50,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:50,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1523808347, now seen corresponding path program 1 times [2019-09-16 17:04:50,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:50,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:50,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:50,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:50,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:50,199 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-16 17:04:50,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:50,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:50,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:50,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:50,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:50,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:50,201 INFO L87 Difference]: Start difference. First operand 1352 states and 1606 transitions. Second operand 3 states. [2019-09-16 17:04:50,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:50,225 INFO L93 Difference]: Finished difference Result 2184 states and 2502 transitions. [2019-09-16 17:04:50,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:50,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-16 17:04:50,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:50,236 INFO L225 Difference]: With dead ends: 2184 [2019-09-16 17:04:50,236 INFO L226 Difference]: Without dead ends: 2184 [2019-09-16 17:04:50,237 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-16 17:04:50,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2019-09-16 17:04:50,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2056. [2019-09-16 17:04:50,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-09-16 17:04:50,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2374 transitions. [2019-09-16 17:04:50,290 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2374 transitions. Word has length 23 [2019-09-16 17:04:50,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:50,291 INFO L475 AbstractCegarLoop]: Abstraction has 2056 states and 2374 transitions. [2019-09-16 17:04:50,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:50,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2374 transitions. [2019-09-16 17:04:50,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-16 17:04:50,295 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:50,295 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-16 17:04:50,295 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:50,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:50,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1130781337, now seen corresponding path program 1 times [2019-09-16 17:04:50,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:50,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:50,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:50,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:50,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:50,313 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-16 17:04:50,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:50,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:50,313 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:50,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:50,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:50,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:50,314 INFO L87 Difference]: Start difference. First operand 2056 states and 2374 transitions. Second operand 3 states. [2019-09-16 17:04:50,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:50,340 INFO L93 Difference]: Finished difference Result 2566 states and 2757 transitions. [2019-09-16 17:04:50,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:50,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-16 17:04:50,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:50,341 INFO L225 Difference]: With dead ends: 2566 [2019-09-16 17:04:50,341 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:04:50,342 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-16 17:04:50,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:04:50,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:04:50,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:04:50,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:04:50,343 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-09-16 17:04:50,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:50,343 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:04:50,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:50,343 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:04:50,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:04:50,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:04:50 BoogieIcfgContainer [2019-09-16 17:04:50,349 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:04:50,352 INFO L168 Benchmark]: Toolchain (without parser) took 2897.15 ms. Allocated memory was 142.1 MB in the beginning and 253.8 MB in the end (delta: 111.7 MB). Free memory was 89.6 MB in the beginning and 198.1 MB in the end (delta: -108.5 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:50,353 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 142.1 MB. Free memory was 108.1 MB in the beginning and 107.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:04:50,354 INFO L168 Benchmark]: CACSL2BoogieTranslator took 387.63 ms. Allocated memory was 142.1 MB in the beginning and 201.9 MB in the end (delta: 59.8 MB). Free memory was 89.4 MB in the beginning and 180.4 MB in the end (delta: -91.0 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:50,355 INFO L168 Benchmark]: Boogie Preprocessor took 45.05 ms. Allocated memory is still 201.9 MB. Free memory was 180.4 MB in the beginning and 178.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:50,356 INFO L168 Benchmark]: RCFGBuilder took 376.82 ms. Allocated memory is still 201.9 MB. Free memory was 178.3 MB in the beginning and 161.8 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:50,357 INFO L168 Benchmark]: TraceAbstraction took 2083.42 ms. Allocated memory was 201.9 MB in the beginning and 253.8 MB in the end (delta: 51.9 MB). Free memory was 161.8 MB in the beginning and 198.1 MB in the end (delta: -36.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:50,361 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 142.1 MB. Free memory was 108.1 MB in the beginning and 107.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.63 ms. Allocated memory was 142.1 MB in the beginning and 201.9 MB in the end (delta: 59.8 MB). Free memory was 89.4 MB in the beginning and 180.4 MB in the end (delta: -91.0 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.05 ms. Allocated memory is still 201.9 MB. Free memory was 180.4 MB in the beginning and 178.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 376.82 ms. Allocated memory is still 201.9 MB. Free memory was 178.3 MB in the beginning and 161.8 MB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2083.42 ms. Allocated memory was 201.9 MB in the beginning and 253.8 MB in the end (delta: 51.9 MB). Free memory was 161.8 MB in the beginning and 198.1 MB in the end (delta: -36.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: 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, 35 locations, 1 error locations. SAFE Result, 2.0s OverallTime, 20 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1238 SDtfs, 574 SDslu, 829 SDs, 0 SdLazy, 107 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2056occurred in iteration=19, 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: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 530 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 383 ConstructedInterpolants, 0 QuantifiedInterpolants, 13856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...