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_8.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:04:48,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:04:48,433 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:04:48,445 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:04:48,445 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:04:48,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:04:48,448 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:04:48,450 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:04:48,452 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:04:48,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:04:48,454 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:04:48,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:04:48,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:04:48,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:04:48,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:04:48,458 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:04:48,459 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:04:48,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:04:48,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:04:48,464 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:04:48,465 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:04:48,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:04:48,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:04:48,469 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:04:48,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:04:48,471 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:04:48,472 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:04:48,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:04:48,473 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:04:48,474 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:04:48,474 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:04:48,475 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:04:48,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:04:48,477 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:04:48,478 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:04:48,478 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:04:48,479 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:04:48,479 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:04:48,479 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:04:48,480 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:04:48,481 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:04:48,482 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:48,497 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:04:48,497 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:04:48,498 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:04:48,500 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:04:48,500 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:04:48,501 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:04:48,501 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:04:48,501 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:04:48,502 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:04:48,502 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:04:48,503 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:04:48,503 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:04:48,504 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:04:48,505 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:04:48,505 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:04:48,505 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:04:48,505 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:04:48,505 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:04:48,506 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:04:48,506 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:04:48,506 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:04:48,507 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:04:48,507 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:04:48,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:04:48,507 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:04:48,508 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:04:48,508 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:04:48,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:04:48,509 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:04:48,509 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:04:48,564 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:04:48,584 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:04:48,589 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:04:48,592 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:04:48,592 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:04:48,594 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2019-09-16 17:04:48,669 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b2c6cde/47bd1f94abdb4f06b9137a565299faf5/FLAGa0057ab6c [2019-09-16 17:04:49,131 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:04:49,135 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2019-09-16 17:04:49,145 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b2c6cde/47bd1f94abdb4f06b9137a565299faf5/FLAGa0057ab6c [2019-09-16 17:04:49,492 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b2c6cde/47bd1f94abdb4f06b9137a565299faf5 [2019-09-16 17:04:49,506 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:04:49,508 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:04:49,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:49,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:04:49,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:04:49,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:49" (1/1) ... [2019-09-16 17:04:49,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f3fac14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:49, skipping insertion in model container [2019-09-16 17:04:49,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:49" (1/1) ... [2019-09-16 17:04:49,527 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:04:49,551 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:04:49,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:49,751 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:04:49,777 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:49,792 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:04:49,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:49 WrapperNode [2019-09-16 17:04:49,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:49,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:04:49,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:04:49,794 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:04:49,894 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:49" (1/1) ... [2019-09-16 17:04:49,894 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:49" (1/1) ... [2019-09-16 17:04:49,899 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:49" (1/1) ... [2019-09-16 17:04:49,900 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:49" (1/1) ... [2019-09-16 17:04:49,904 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:49" (1/1) ... [2019-09-16 17:04:49,913 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:49" (1/1) ... [2019-09-16 17:04:49,914 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:49" (1/1) ... [2019-09-16 17:04:49,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:04:49,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:04:49,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:04:49,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:04:49,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:49" (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:49,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:04:49,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:04:49,971 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:04:49,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:04:49,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:04:49,972 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:04:49,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:04:49,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:04:50,256 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:04:50,257 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 17:04:50,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:50 BoogieIcfgContainer [2019-09-16 17:04:50,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:04:50,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:04:50,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:04:50,264 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:04:50,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:04:49" (1/3) ... [2019-09-16 17:04:50,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162f6c21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:50, skipping insertion in model container [2019-09-16 17:04:50,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:49" (2/3) ... [2019-09-16 17:04:50,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162f6c21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:50, skipping insertion in model container [2019-09-16 17:04:50,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:50" (3/3) ... [2019-09-16 17:04:50,268 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2019-09-16 17:04:50,290 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:04:50,304 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:04:50,318 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:04:50,344 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:04:50,345 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:04:50,345 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:04:50,345 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:04:50,345 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:04:50,345 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:04:50,345 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:04:50,346 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:04:50,360 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-09-16 17:04:50,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-16 17:04:50,368 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:50,369 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:50,371 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:50,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:50,376 INFO L82 PathProgramCache]: Analyzing trace with hash 577441593, now seen corresponding path program 1 times [2019-09-16 17:04:50,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:50,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:50,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:50,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:50,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:50,537 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,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:50,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:50,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:50,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:50,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:50,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:50,558 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2019-09-16 17:04:50,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:50,630 INFO L93 Difference]: Finished difference Result 68 states and 113 transitions. [2019-09-16 17:04:50,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:50,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-16 17:04:50,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:50,651 INFO L225 Difference]: With dead ends: 68 [2019-09-16 17:04:50,651 INFO L226 Difference]: Without dead ends: 60 [2019-09-16 17:04:50,656 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,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-16 17:04:50,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-09-16 17:04:50,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-16 17:04:50,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2019-09-16 17:04:50,720 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 18 [2019-09-16 17:04:50,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:50,721 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2019-09-16 17:04:50,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:50,721 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2019-09-16 17:04:50,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-16 17:04:50,723 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:50,723 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:50,723 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:50,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:50,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1278506171, now seen corresponding path program 1 times [2019-09-16 17:04:50,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:50,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:50,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:50,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:50,726 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:50,797 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,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:50,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:50,798 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:50,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:50,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:50,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:50,801 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2019-09-16 17:04:50,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:50,848 INFO L93 Difference]: Finished difference Result 60 states and 102 transitions. [2019-09-16 17:04:50,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:50,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-16 17:04:50,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:50,851 INFO L225 Difference]: With dead ends: 60 [2019-09-16 17:04:50,851 INFO L226 Difference]: Without dead ends: 60 [2019-09-16 17:04:50,852 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,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-16 17:04:50,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-09-16 17:04:50,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-16 17:04:50,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 101 transitions. [2019-09-16 17:04:50,869 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 101 transitions. Word has length 18 [2019-09-16 17:04:50,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:50,870 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 101 transitions. [2019-09-16 17:04:50,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:50,871 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2019-09-16 17:04:50,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-16 17:04:50,872 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:50,873 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:50,874 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:50,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:50,874 INFO L82 PathProgramCache]: Analyzing trace with hash 721034227, now seen corresponding path program 1 times [2019-09-16 17:04:50,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:50,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:50,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:50,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:50,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:50,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:50,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:50,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:50,957 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:50,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:50,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:50,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:50,960 INFO L87 Difference]: Start difference. First operand 58 states and 101 transitions. Second operand 3 states. [2019-09-16 17:04:50,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:50,996 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2019-09-16 17:04:50,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:50,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-16 17:04:50,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:51,000 INFO L225 Difference]: With dead ends: 63 [2019-09-16 17:04:51,000 INFO L226 Difference]: Without dead ends: 63 [2019-09-16 17:04:51,001 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:51,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-16 17:04:51,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-09-16 17:04:51,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-16 17:04:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 103 transitions. [2019-09-16 17:04:51,010 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 103 transitions. Word has length 19 [2019-09-16 17:04:51,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:51,011 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 103 transitions. [2019-09-16 17:04:51,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:51,011 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2019-09-16 17:04:51,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-16 17:04:51,012 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:51,012 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:51,013 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:51,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:51,013 INFO L82 PathProgramCache]: Analyzing trace with hash 979199665, now seen corresponding path program 1 times [2019-09-16 17:04:51,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:51,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:51,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:51,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:51,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:51,054 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:51,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:51,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:51,055 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:51,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:51,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:51,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:51,056 INFO L87 Difference]: Start difference. First operand 61 states and 103 transitions. Second operand 3 states. [2019-09-16 17:04:51,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:51,088 INFO L93 Difference]: Finished difference Result 110 states and 189 transitions. [2019-09-16 17:04:51,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:51,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-16 17:04:51,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:51,091 INFO L225 Difference]: With dead ends: 110 [2019-09-16 17:04:51,091 INFO L226 Difference]: Without dead ends: 110 [2019-09-16 17:04:51,092 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:51,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-16 17:04:51,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2019-09-16 17:04:51,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-16 17:04:51,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 136 transitions. [2019-09-16 17:04:51,110 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 136 transitions. Word has length 19 [2019-09-16 17:04:51,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:51,111 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 136 transitions. [2019-09-16 17:04:51,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:51,114 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 136 transitions. [2019-09-16 17:04:51,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-16 17:04:51,115 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:51,115 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:51,115 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:51,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:51,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1680264243, now seen corresponding path program 1 times [2019-09-16 17:04:51,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:51,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:51,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:51,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:51,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:51,182 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:51,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:51,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:51,182 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:51,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:51,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:51,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:51,184 INFO L87 Difference]: Start difference. First operand 80 states and 136 transitions. Second operand 3 states. [2019-09-16 17:04:51,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:51,204 INFO L93 Difference]: Finished difference Result 112 states and 187 transitions. [2019-09-16 17:04:51,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:51,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-16 17:04:51,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:51,206 INFO L225 Difference]: With dead ends: 112 [2019-09-16 17:04:51,207 INFO L226 Difference]: Without dead ends: 112 [2019-09-16 17:04:51,207 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:51,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-16 17:04:51,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-09-16 17:04:51,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-16 17:04:51,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 186 transitions. [2019-09-16 17:04:51,216 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 186 transitions. Word has length 19 [2019-09-16 17:04:51,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:51,217 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 186 transitions. [2019-09-16 17:04:51,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:51,217 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 186 transitions. [2019-09-16 17:04:51,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 17:04:51,218 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:51,218 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:51,219 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:51,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:51,219 INFO L82 PathProgramCache]: Analyzing trace with hash 290632912, now seen corresponding path program 1 times [2019-09-16 17:04:51,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:51,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:51,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:51,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:51,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:51,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:51,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:51,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:51,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:51,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:51,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:51,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:51,261 INFO L87 Difference]: Start difference. First operand 110 states and 186 transitions. Second operand 3 states. [2019-09-16 17:04:51,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:51,283 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2019-09-16 17:04:51,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:51,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-16 17:04:51,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:51,285 INFO L225 Difference]: With dead ends: 114 [2019-09-16 17:04:51,286 INFO L226 Difference]: Without dead ends: 114 [2019-09-16 17:04:51,286 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:51,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-16 17:04:51,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2019-09-16 17:04:51,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-16 17:04:51,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 186 transitions. [2019-09-16 17:04:51,296 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 186 transitions. Word has length 20 [2019-09-16 17:04:51,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:51,296 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 186 transitions. [2019-09-16 17:04:51,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:51,297 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 186 transitions. [2019-09-16 17:04:51,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 17:04:51,298 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:51,298 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:51,298 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:51,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:51,299 INFO L82 PathProgramCache]: Analyzing trace with hash 548798350, now seen corresponding path program 1 times [2019-09-16 17:04:51,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:51,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:51,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:51,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:51,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:51,356 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:51,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:51,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:51,357 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:51,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:51,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:51,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:51,358 INFO L87 Difference]: Start difference. First operand 112 states and 186 transitions. Second operand 3 states. [2019-09-16 17:04:51,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:51,390 INFO L93 Difference]: Finished difference Result 202 states and 339 transitions. [2019-09-16 17:04:51,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:51,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-16 17:04:51,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:51,393 INFO L225 Difference]: With dead ends: 202 [2019-09-16 17:04:51,393 INFO L226 Difference]: Without dead ends: 202 [2019-09-16 17:04:51,394 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:51,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-16 17:04:51,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 152. [2019-09-16 17:04:51,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-16 17:04:51,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 250 transitions. [2019-09-16 17:04:51,415 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 250 transitions. Word has length 20 [2019-09-16 17:04:51,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:51,419 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 250 transitions. [2019-09-16 17:04:51,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:51,420 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 250 transitions. [2019-09-16 17:04:51,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-16 17:04:51,421 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:51,421 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:51,422 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:51,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:51,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1249862928, now seen corresponding path program 1 times [2019-09-16 17:04:51,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:51,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:51,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:51,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:51,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:51,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:51,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:51,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:51,464 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:51,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:51,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:51,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:51,466 INFO L87 Difference]: Start difference. First operand 152 states and 250 transitions. Second operand 3 states. [2019-09-16 17:04:51,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:51,498 INFO L93 Difference]: Finished difference Result 210 states and 339 transitions. [2019-09-16 17:04:51,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:51,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-16 17:04:51,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:51,501 INFO L225 Difference]: With dead ends: 210 [2019-09-16 17:04:51,501 INFO L226 Difference]: Without dead ends: 210 [2019-09-16 17:04:51,502 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:51,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-16 17:04:51,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2019-09-16 17:04:51,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-16 17:04:51,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 338 transitions. [2019-09-16 17:04:51,523 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 338 transitions. Word has length 20 [2019-09-16 17:04:51,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:51,524 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 338 transitions. [2019-09-16 17:04:51,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:51,525 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 338 transitions. [2019-09-16 17:04:51,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-16 17:04:51,528 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:51,528 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:51,532 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:51,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:51,533 INFO L82 PathProgramCache]: Analyzing trace with hash -166905624, now seen corresponding path program 1 times [2019-09-16 17:04:51,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:51,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:51,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:51,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:51,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:51,571 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:51,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:51,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:51,571 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:51,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:51,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:51,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:51,573 INFO L87 Difference]: Start difference. First operand 208 states and 338 transitions. Second operand 3 states. [2019-09-16 17:04:51,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:51,605 INFO L93 Difference]: Finished difference Result 214 states and 339 transitions. [2019-09-16 17:04:51,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:51,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-16 17:04:51,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:51,608 INFO L225 Difference]: With dead ends: 214 [2019-09-16 17:04:51,608 INFO L226 Difference]: Without dead ends: 214 [2019-09-16 17:04:51,608 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:51,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-16 17:04:51,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2019-09-16 17:04:51,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-16 17:04:51,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 338 transitions. [2019-09-16 17:04:51,617 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 338 transitions. Word has length 21 [2019-09-16 17:04:51,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:51,617 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 338 transitions. [2019-09-16 17:04:51,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:51,618 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 338 transitions. [2019-09-16 17:04:51,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-16 17:04:51,621 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:51,621 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:51,622 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:51,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:51,622 INFO L82 PathProgramCache]: Analyzing trace with hash 91259814, now seen corresponding path program 1 times [2019-09-16 17:04:51,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:51,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:51,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:51,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:51,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:51,670 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:51,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:51,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:51,671 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:51,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:51,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:51,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:51,673 INFO L87 Difference]: Start difference. First operand 212 states and 338 transitions. Second operand 3 states. [2019-09-16 17:04:51,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:51,688 INFO L93 Difference]: Finished difference Result 378 states and 607 transitions. [2019-09-16 17:04:51,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:51,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-16 17:04:51,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:51,690 INFO L225 Difference]: With dead ends: 378 [2019-09-16 17:04:51,691 INFO L226 Difference]: Without dead ends: 378 [2019-09-16 17:04:51,691 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:51,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-09-16 17:04:51,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 296. [2019-09-16 17:04:51,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-09-16 17:04:51,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 462 transitions. [2019-09-16 17:04:51,703 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 462 transitions. Word has length 21 [2019-09-16 17:04:51,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:51,707 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 462 transitions. [2019-09-16 17:04:51,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:51,708 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 462 transitions. [2019-09-16 17:04:51,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-16 17:04:51,709 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:51,709 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:51,709 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:51,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:51,710 INFO L82 PathProgramCache]: Analyzing trace with hash 792324392, now seen corresponding path program 1 times [2019-09-16 17:04:51,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:51,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:51,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:51,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:51,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:51,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:51,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:51,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:51,740 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:51,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:51,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:51,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:51,741 INFO L87 Difference]: Start difference. First operand 296 states and 462 transitions. Second operand 3 states. [2019-09-16 17:04:51,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:51,757 INFO L93 Difference]: Finished difference Result 402 states and 615 transitions. [2019-09-16 17:04:51,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:51,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-16 17:04:51,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:51,760 INFO L225 Difference]: With dead ends: 402 [2019-09-16 17:04:51,760 INFO L226 Difference]: Without dead ends: 402 [2019-09-16 17:04:51,761 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:51,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-09-16 17:04:51,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2019-09-16 17:04:51,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-16 17:04:51,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 614 transitions. [2019-09-16 17:04:51,771 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 614 transitions. Word has length 21 [2019-09-16 17:04:51,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:51,771 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 614 transitions. [2019-09-16 17:04:51,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:51,772 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 614 transitions. [2019-09-16 17:04:51,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-16 17:04:51,773 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:51,773 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:51,773 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:51,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:51,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1465698011, now seen corresponding path program 1 times [2019-09-16 17:04:51,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:51,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:51,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:51,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:51,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:51,802 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:51,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:51,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:51,803 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:51,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:51,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:51,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:51,805 INFO L87 Difference]: Start difference. First operand 400 states and 614 transitions. Second operand 3 states. [2019-09-16 17:04:51,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:51,820 INFO L93 Difference]: Finished difference Result 410 states and 615 transitions. [2019-09-16 17:04:51,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:51,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-16 17:04:51,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:51,825 INFO L225 Difference]: With dead ends: 410 [2019-09-16 17:04:51,825 INFO L226 Difference]: Without dead ends: 410 [2019-09-16 17:04:51,826 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:51,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-09-16 17:04:51,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2019-09-16 17:04:51,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-09-16 17:04:51,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 614 transitions. [2019-09-16 17:04:51,837 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 614 transitions. Word has length 22 [2019-09-16 17:04:51,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:51,839 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 614 transitions. [2019-09-16 17:04:51,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:51,839 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 614 transitions. [2019-09-16 17:04:51,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-16 17:04:51,840 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:51,840 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:51,841 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:51,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:51,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1207532573, now seen corresponding path program 1 times [2019-09-16 17:04:51,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:51,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:51,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:51,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:51,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:51,885 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:51,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:51,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:51,886 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:51,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:51,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:51,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:51,887 INFO L87 Difference]: Start difference. First operand 408 states and 614 transitions. Second operand 3 states. [2019-09-16 17:04:51,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:51,908 INFO L93 Difference]: Finished difference Result 714 states and 1079 transitions. [2019-09-16 17:04:51,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:51,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-16 17:04:51,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:51,914 INFO L225 Difference]: With dead ends: 714 [2019-09-16 17:04:51,915 INFO L226 Difference]: Without dead ends: 714 [2019-09-16 17:04:51,915 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:51,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-09-16 17:04:51,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 584. [2019-09-16 17:04:51,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-09-16 17:04:51,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 854 transitions. [2019-09-16 17:04:51,935 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 854 transitions. Word has length 22 [2019-09-16 17:04:51,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:51,936 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 854 transitions. [2019-09-16 17:04:51,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:51,936 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 854 transitions. [2019-09-16 17:04:51,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-16 17:04:51,937 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:51,938 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:51,938 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:51,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:51,939 INFO L82 PathProgramCache]: Analyzing trace with hash -506467995, now seen corresponding path program 1 times [2019-09-16 17:04:51,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:51,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:51,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:51,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:51,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:51,980 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:51,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:51,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:51,981 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:51,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:51,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:51,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:51,983 INFO L87 Difference]: Start difference. First operand 584 states and 854 transitions. Second operand 3 states. [2019-09-16 17:04:52,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:52,013 INFO L93 Difference]: Finished difference Result 778 states and 1111 transitions. [2019-09-16 17:04:52,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:52,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-16 17:04:52,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:52,020 INFO L225 Difference]: With dead ends: 778 [2019-09-16 17:04:52,020 INFO L226 Difference]: Without dead ends: 778 [2019-09-16 17:04:52,022 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:52,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-09-16 17:04:52,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 776. [2019-09-16 17:04:52,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-09-16 17:04:52,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1110 transitions. [2019-09-16 17:04:52,046 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1110 transitions. Word has length 22 [2019-09-16 17:04:52,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:52,046 INFO L475 AbstractCegarLoop]: Abstraction has 776 states and 1110 transitions. [2019-09-16 17:04:52,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:52,046 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1110 transitions. [2019-09-16 17:04:52,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-16 17:04:52,048 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:52,048 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:52,048 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:52,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:52,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1221411293, now seen corresponding path program 1 times [2019-09-16 17:04:52,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:52,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:52,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:52,072 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:52,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:52,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:52,072 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:52,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:52,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:52,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:52,073 INFO L87 Difference]: Start difference. First operand 776 states and 1110 transitions. Second operand 3 states. [2019-09-16 17:04:52,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:52,091 INFO L93 Difference]: Finished difference Result 794 states and 1111 transitions. [2019-09-16 17:04:52,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:52,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-16 17:04:52,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:52,096 INFO L225 Difference]: With dead ends: 794 [2019-09-16 17:04:52,096 INFO L226 Difference]: Without dead ends: 794 [2019-09-16 17:04:52,098 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:52,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-09-16 17:04:52,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 792. [2019-09-16 17:04:52,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-09-16 17:04:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1110 transitions. [2019-09-16 17:04:52,118 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1110 transitions. Word has length 23 [2019-09-16 17:04:52,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:52,118 INFO L475 AbstractCegarLoop]: Abstraction has 792 states and 1110 transitions. [2019-09-16 17:04:52,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:52,118 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1110 transitions. [2019-09-16 17:04:52,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-16 17:04:52,120 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:52,120 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:52,121 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:52,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:52,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1479576731, now seen corresponding path program 1 times [2019-09-16 17:04:52,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:52,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:52,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:52,144 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:52,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:52,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:52,144 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:52,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:52,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:52,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:52,148 INFO L87 Difference]: Start difference. First operand 792 states and 1110 transitions. Second operand 3 states. [2019-09-16 17:04:52,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:52,169 INFO L93 Difference]: Finished difference Result 1354 states and 1895 transitions. [2019-09-16 17:04:52,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:52,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-16 17:04:52,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:52,176 INFO L225 Difference]: With dead ends: 1354 [2019-09-16 17:04:52,177 INFO L226 Difference]: Without dead ends: 1354 [2019-09-16 17:04:52,177 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:52,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-09-16 17:04:52,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1160. [2019-09-16 17:04:52,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2019-09-16 17:04:52,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1574 transitions. [2019-09-16 17:04:52,212 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1574 transitions. Word has length 23 [2019-09-16 17:04:52,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:52,213 INFO L475 AbstractCegarLoop]: Abstraction has 1160 states and 1574 transitions. [2019-09-16 17:04:52,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:52,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1574 transitions. [2019-09-16 17:04:52,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-16 17:04:52,216 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:52,216 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:52,216 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:52,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:52,216 INFO L82 PathProgramCache]: Analyzing trace with hash -2114325987, now seen corresponding path program 1 times [2019-09-16 17:04:52,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:52,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:52,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:52,239 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:52,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:52,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:52,239 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:52,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:52,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:52,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:52,240 INFO L87 Difference]: Start difference. First operand 1160 states and 1574 transitions. Second operand 3 states. [2019-09-16 17:04:52,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:52,263 INFO L93 Difference]: Finished difference Result 1514 states and 1991 transitions. [2019-09-16 17:04:52,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:52,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-16 17:04:52,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:52,271 INFO L225 Difference]: With dead ends: 1514 [2019-09-16 17:04:52,271 INFO L226 Difference]: Without dead ends: 1514 [2019-09-16 17:04:52,272 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:52,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2019-09-16 17:04:52,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1512. [2019-09-16 17:04:52,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2019-09-16 17:04:52,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1990 transitions. [2019-09-16 17:04:52,316 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1990 transitions. Word has length 23 [2019-09-16 17:04:52,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:52,317 INFO L475 AbstractCegarLoop]: Abstraction has 1512 states and 1990 transitions. [2019-09-16 17:04:52,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:52,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1990 transitions. [2019-09-16 17:04:52,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 17:04:52,321 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:52,321 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:52,322 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:52,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:52,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1377545862, now seen corresponding path program 1 times [2019-09-16 17:04:52,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:52,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:52,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:52,348 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:52,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:52,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:52,349 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:52,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:52,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:52,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:52,350 INFO L87 Difference]: Start difference. First operand 1512 states and 1990 transitions. Second operand 3 states. [2019-09-16 17:04:52,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:52,374 INFO L93 Difference]: Finished difference Result 1546 states and 1991 transitions. [2019-09-16 17:04:52,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:52,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-16 17:04:52,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:52,383 INFO L225 Difference]: With dead ends: 1546 [2019-09-16 17:04:52,383 INFO L226 Difference]: Without dead ends: 1546 [2019-09-16 17:04:52,383 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:52,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2019-09-16 17:04:52,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1544. [2019-09-16 17:04:52,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-09-16 17:04:52,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1990 transitions. [2019-09-16 17:04:52,436 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1990 transitions. Word has length 24 [2019-09-16 17:04:52,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:52,436 INFO L475 AbstractCegarLoop]: Abstraction has 1544 states and 1990 transitions. [2019-09-16 17:04:52,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:52,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1990 transitions. [2019-09-16 17:04:52,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 17:04:52,439 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:52,439 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:52,440 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:52,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:52,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1119380424, now seen corresponding path program 1 times [2019-09-16 17:04:52,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:52,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:52,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:52,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:52,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:52,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:52,464 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:52,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:52,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:52,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:52,466 INFO L87 Difference]: Start difference. First operand 1544 states and 1990 transitions. Second operand 3 states. [2019-09-16 17:04:52,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:52,493 INFO L93 Difference]: Finished difference Result 2570 states and 3271 transitions. [2019-09-16 17:04:52,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:52,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-16 17:04:52,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:52,508 INFO L225 Difference]: With dead ends: 2570 [2019-09-16 17:04:52,508 INFO L226 Difference]: Without dead ends: 2570 [2019-09-16 17:04:52,510 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:52,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2019-09-16 17:04:52,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2312. [2019-09-16 17:04:52,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-09-16 17:04:52,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2886 transitions. [2019-09-16 17:04:52,583 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2886 transitions. Word has length 24 [2019-09-16 17:04:52,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:52,583 INFO L475 AbstractCegarLoop]: Abstraction has 2312 states and 2886 transitions. [2019-09-16 17:04:52,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:52,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2886 transitions. [2019-09-16 17:04:52,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 17:04:52,588 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:52,588 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:52,588 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:52,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:52,589 INFO L82 PathProgramCache]: Analyzing trace with hash -418315846, now seen corresponding path program 1 times [2019-09-16 17:04:52,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:52,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:52,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:52,614 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:52,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:52,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:52,615 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:52,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:52,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:52,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:52,617 INFO L87 Difference]: Start difference. First operand 2312 states and 2886 transitions. Second operand 3 states. [2019-09-16 17:04:52,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:52,658 INFO L93 Difference]: Finished difference Result 2954 states and 3527 transitions. [2019-09-16 17:04:52,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:52,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-16 17:04:52,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:52,674 INFO L225 Difference]: With dead ends: 2954 [2019-09-16 17:04:52,675 INFO L226 Difference]: Without dead ends: 2954 [2019-09-16 17:04:52,675 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:52,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2019-09-16 17:04:52,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2952. [2019-09-16 17:04:52,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2019-09-16 17:04:52,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 3526 transitions. [2019-09-16 17:04:52,771 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 3526 transitions. Word has length 24 [2019-09-16 17:04:52,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:52,771 INFO L475 AbstractCegarLoop]: Abstraction has 2952 states and 3526 transitions. [2019-09-16 17:04:52,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:52,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 3526 transitions. [2019-09-16 17:04:52,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 17:04:52,777 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:52,778 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:52,778 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:52,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:52,779 INFO L82 PathProgramCache]: Analyzing trace with hash -340838702, now seen corresponding path program 1 times [2019-09-16 17:04:52,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:52,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:52,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:52,821 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:52,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:52,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:52,822 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:52,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:52,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:52,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:52,823 INFO L87 Difference]: Start difference. First operand 2952 states and 3526 transitions. Second operand 3 states. [2019-09-16 17:04:52,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:52,860 INFO L93 Difference]: Finished difference Result 3018 states and 3527 transitions. [2019-09-16 17:04:52,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:52,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 17:04:52,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:52,875 INFO L225 Difference]: With dead ends: 3018 [2019-09-16 17:04:52,876 INFO L226 Difference]: Without dead ends: 3018 [2019-09-16 17:04:52,876 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:52,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2019-09-16 17:04:52,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3016. [2019-09-16 17:04:52,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2019-09-16 17:04:52,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3526 transitions. [2019-09-16 17:04:52,959 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3526 transitions. Word has length 25 [2019-09-16 17:04:52,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:52,960 INFO L475 AbstractCegarLoop]: Abstraction has 3016 states and 3526 transitions. [2019-09-16 17:04:52,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:52,960 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3526 transitions. [2019-09-16 17:04:52,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 17:04:52,965 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:52,965 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:52,965 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:52,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:52,966 INFO L82 PathProgramCache]: Analyzing trace with hash -82673264, now seen corresponding path program 1 times [2019-09-16 17:04:52,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:52,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:52,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:52,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:52,986 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:52,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:52,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:52,987 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:52,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:52,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:52,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:52,988 INFO L87 Difference]: Start difference. First operand 3016 states and 3526 transitions. Second operand 3 states. [2019-09-16 17:04:53,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:53,028 INFO L93 Difference]: Finished difference Result 5768 states and 6278 transitions. [2019-09-16 17:04:53,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:53,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 17:04:53,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:53,043 INFO L225 Difference]: With dead ends: 5768 [2019-09-16 17:04:53,043 INFO L226 Difference]: Without dead ends: 3016 [2019-09-16 17:04:53,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:53,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2019-09-16 17:04:53,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 3016. [2019-09-16 17:04:53,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2019-09-16 17:04:53,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3270 transitions. [2019-09-16 17:04:53,115 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3270 transitions. Word has length 25 [2019-09-16 17:04:53,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:53,115 INFO L475 AbstractCegarLoop]: Abstraction has 3016 states and 3270 transitions. [2019-09-16 17:04:53,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:53,115 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2019-09-16 17:04:53,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 17:04:53,120 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:53,120 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:53,120 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:53,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:53,121 INFO L82 PathProgramCache]: Analyzing trace with hash -783737842, now seen corresponding path program 1 times [2019-09-16 17:04:53,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:53,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:53,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:53,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:53,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:53,143 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:53,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:53,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:53,143 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:53,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:53,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:53,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:53,144 INFO L87 Difference]: Start difference. First operand 3016 states and 3270 transitions. Second operand 3 states. [2019-09-16 17:04:53,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:53,164 INFO L93 Difference]: Finished difference Result 3014 states and 3141 transitions. [2019-09-16 17:04:53,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:53,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 17:04:53,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:53,166 INFO L225 Difference]: With dead ends: 3014 [2019-09-16 17:04:53,166 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:04:53,167 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:53,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:04:53,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:04:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:04:53,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:04:53,168 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-09-16 17:04:53,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:53,168 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:04:53,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:53,168 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:04:53,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:04:53,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:04:53 BoogieIcfgContainer [2019-09-16 17:04:53,175 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:04:53,184 INFO L168 Benchmark]: Toolchain (without parser) took 3669.38 ms. Allocated memory was 141.6 MB in the beginning and 257.4 MB in the end (delta: 115.9 MB). Free memory was 89.1 MB in the beginning and 83.2 MB in the end (delta: 5.9 MB). Peak memory consumption was 121.8 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:53,194 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 141.6 MB. Free memory was 107.5 MB in the beginning and 107.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:04:53,194 INFO L168 Benchmark]: CACSL2BoogieTranslator took 282.26 ms. Allocated memory is still 141.6 MB. Free memory was 88.8 MB in the beginning and 78.5 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:53,196 INFO L168 Benchmark]: Boogie Preprocessor took 123.49 ms. Allocated memory was 141.6 MB in the beginning and 198.7 MB in the end (delta: 57.1 MB). Free memory was 78.5 MB in the beginning and 175.8 MB in the end (delta: -97.3 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:53,197 INFO L168 Benchmark]: RCFGBuilder took 341.37 ms. Allocated memory is still 198.7 MB. Free memory was 175.8 MB in the beginning and 159.0 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:53,200 INFO L168 Benchmark]: TraceAbstraction took 2914.78 ms. Allocated memory was 198.7 MB in the beginning and 257.4 MB in the end (delta: 58.7 MB). Free memory was 158.4 MB in the beginning and 83.2 MB in the end (delta: 75.3 MB). Peak memory consumption was 134.0 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:53,210 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.25 ms. Allocated memory is still 141.6 MB. Free memory was 107.5 MB in the beginning and 107.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 282.26 ms. Allocated memory is still 141.6 MB. Free memory was 88.8 MB in the beginning and 78.5 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.49 ms. Allocated memory was 141.6 MB in the beginning and 198.7 MB in the end (delta: 57.1 MB). Free memory was 78.5 MB in the beginning and 175.8 MB in the end (delta: -97.3 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 341.37 ms. Allocated memory is still 198.7 MB. Free memory was 175.8 MB in the beginning and 159.0 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2914.78 ms. Allocated memory was 198.7 MB in the beginning and 257.4 MB in the end (delta: 58.7 MB). Free memory was 158.4 MB in the beginning and 83.2 MB in the end (delta: 75.3 MB). Peak memory consumption was 134.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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, 38 locations, 1 error locations. SAFE Result, 2.8s OverallTime, 23 OverallIterations, 1 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1573 SDtfs, 755 SDslu, 1056 SDs, 0 SdLazy, 121 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3016occurred in iteration=21, 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.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 790 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 19027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...