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-112bae1 [2019-09-09 05:50:07,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:50:07,436 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:50:07,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:50:07,451 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:50:07,452 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:50:07,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:50:07,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:50:07,457 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:50:07,458 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:50:07,459 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:50:07,461 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:50:07,461 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:50:07,462 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:50:07,463 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:50:07,464 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:50:07,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:50:07,466 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:50:07,468 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:50:07,470 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:50:07,472 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:50:07,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:50:07,476 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:50:07,477 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:50:07,484 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:50:07,487 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:50:07,488 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:50:07,489 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:50:07,489 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:50:07,492 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:50:07,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:50:07,493 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:50:07,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:50:07,494 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:50:07,497 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:50:07,497 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:50:07,498 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:50:07,498 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:50:07,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:50:07,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:50:07,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:50:07,503 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 05:50:07,535 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:50:07,536 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:50:07,536 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:50:07,536 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:50:07,537 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:50:07,537 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:50:07,538 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:50:07,538 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:50:07,538 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:50:07,538 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:50:07,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:50:07,539 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:50:07,539 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:50:07,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:50:07,540 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:50:07,540 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:50:07,540 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:50:07,540 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:50:07,541 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:50:07,541 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:50:07,541 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:50:07,541 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:50:07,542 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:50:07,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:50:07,542 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:50:07,542 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:50:07,542 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:50:07,543 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:50:07,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:50:07,543 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:50:07,583 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:50:07,597 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:50:07,600 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:50:07,602 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:50:07,602 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:50:07,603 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-09 05:50:07,674 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ab69966c/102b317000b9429f8559e223df83b2f7/FLAG48fdc4046 [2019-09-09 05:50:08,148 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:50:08,149 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2019-09-09 05:50:08,159 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ab69966c/102b317000b9429f8559e223df83b2f7/FLAG48fdc4046 [2019-09-09 05:50:08,517 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ab69966c/102b317000b9429f8559e223df83b2f7 [2019-09-09 05:50:08,528 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:50:08,529 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:50:08,530 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:50:08,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:50:08,534 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:50:08,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:50:08" (1/1) ... [2019-09-09 05:50:08,538 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b099e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:50:08, skipping insertion in model container [2019-09-09 05:50:08,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:50:08" (1/1) ... [2019-09-09 05:50:08,546 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:50:08,577 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:50:08,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:50:08,742 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:50:08,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:50:08,863 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:50:08,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:50:08 WrapperNode [2019-09-09 05:50:08,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:50:08,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:50:08,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:50:08,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:50:08,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:50:08" (1/1) ... [2019-09-09 05:50:08,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:50:08" (1/1) ... [2019-09-09 05:50:08,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:50:08" (1/1) ... [2019-09-09 05:50:08,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:50:08" (1/1) ... [2019-09-09 05:50:08,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:50:08" (1/1) ... [2019-09-09 05:50:08,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:50:08" (1/1) ... [2019-09-09 05:50:08,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:50:08" (1/1) ... [2019-09-09 05:50:08,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:50:08,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:50:08,904 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:50:08,904 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:50:08,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:50:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:50:08,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:50:08,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:50:08,963 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:50:08,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:50:08,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:50:08,963 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:50:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:50:08,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:50:09,301 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:50:09,301 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:50:09,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:50:09 BoogieIcfgContainer [2019-09-09 05:50:09,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:50:09,304 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:50:09,304 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:50:09,307 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:50:09,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:50:08" (1/3) ... [2019-09-09 05:50:09,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15755907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:50:09, skipping insertion in model container [2019-09-09 05:50:09,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:50:08" (2/3) ... [2019-09-09 05:50:09,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15755907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:50:09, skipping insertion in model container [2019-09-09 05:50:09,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:50:09" (3/3) ... [2019-09-09 05:50:09,311 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2019-09-09 05:50:09,322 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:50:09,330 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:50:09,353 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:50:09,379 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:50:09,379 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:50:09,379 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:50:09,380 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:50:09,380 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:50:09,380 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:50:09,380 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:50:09,380 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:50:09,395 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-09-09 05:50:09,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-09 05:50:09,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:09,406 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:09,409 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:09,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:09,415 INFO L82 PathProgramCache]: Analyzing trace with hash 577441593, now seen corresponding path program 1 times [2019-09-09 05:50:09,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:09,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:09,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:09,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:09,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:09,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:50:09,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:09,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:09,595 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:09,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:09,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:09,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:09,617 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2019-09-09 05:50:09,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:09,689 INFO L93 Difference]: Finished difference Result 68 states and 113 transitions. [2019-09-09 05:50:09,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:09,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-09 05:50:09,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:09,714 INFO L225 Difference]: With dead ends: 68 [2019-09-09 05:50:09,715 INFO L226 Difference]: Without dead ends: 60 [2019-09-09 05:50:09,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:09,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-09 05:50:09,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-09-09 05:50:09,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-09 05:50:09,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2019-09-09 05:50:09,781 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 18 [2019-09-09 05:50:09,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:09,782 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2019-09-09 05:50:09,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:09,782 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2019-09-09 05:50:09,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-09 05:50:09,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:09,784 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:09,784 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:09,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:09,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1278506171, now seen corresponding path program 1 times [2019-09-09 05:50:09,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:09,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:09,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:09,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:09,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:09,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:50:09,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:09,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:09,858 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:09,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:09,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:09,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:09,861 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2019-09-09 05:50:09,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:09,892 INFO L93 Difference]: Finished difference Result 60 states and 102 transitions. [2019-09-09 05:50:09,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:09,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-09 05:50:09,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:09,895 INFO L225 Difference]: With dead ends: 60 [2019-09-09 05:50:09,895 INFO L226 Difference]: Without dead ends: 60 [2019-09-09 05:50:09,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:09,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-09-09 05:50:09,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2019-09-09 05:50:09,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-09 05:50:09,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 101 transitions. [2019-09-09 05:50:09,919 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 101 transitions. Word has length 18 [2019-09-09 05:50:09,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:09,920 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 101 transitions. [2019-09-09 05:50:09,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:09,921 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2019-09-09 05:50:09,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-09 05:50:09,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:09,923 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:09,923 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:09,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:09,924 INFO L82 PathProgramCache]: Analyzing trace with hash 721034227, now seen corresponding path program 1 times [2019-09-09 05:50:09,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:09,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:09,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:09,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:09,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:09,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:50:09,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:09,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:09,989 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:09,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:09,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:09,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:09,991 INFO L87 Difference]: Start difference. First operand 58 states and 101 transitions. Second operand 3 states. [2019-09-09 05:50:10,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:10,016 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2019-09-09 05:50:10,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:10,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-09 05:50:10,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:10,019 INFO L225 Difference]: With dead ends: 63 [2019-09-09 05:50:10,019 INFO L226 Difference]: Without dead ends: 63 [2019-09-09 05:50:10,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:10,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-09 05:50:10,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-09-09 05:50:10,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-09 05:50:10,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 103 transitions. [2019-09-09 05:50:10,029 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 103 transitions. Word has length 19 [2019-09-09 05:50:10,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:10,029 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 103 transitions. [2019-09-09 05:50:10,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:10,030 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2019-09-09 05:50:10,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-09 05:50:10,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:10,031 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:10,031 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:10,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:10,032 INFO L82 PathProgramCache]: Analyzing trace with hash 979199665, now seen corresponding path program 1 times [2019-09-09 05:50:10,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:10,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:10,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:10,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:10,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:10,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:50:10,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:10,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:10,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:10,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:10,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:10,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:10,098 INFO L87 Difference]: Start difference. First operand 61 states and 103 transitions. Second operand 3 states. [2019-09-09 05:50:10,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:10,132 INFO L93 Difference]: Finished difference Result 110 states and 189 transitions. [2019-09-09 05:50:10,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:10,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-09 05:50:10,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:10,135 INFO L225 Difference]: With dead ends: 110 [2019-09-09 05:50:10,136 INFO L226 Difference]: Without dead ends: 110 [2019-09-09 05:50:10,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:10,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-09 05:50:10,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2019-09-09 05:50:10,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-09 05:50:10,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 136 transitions. [2019-09-09 05:50:10,155 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 136 transitions. Word has length 19 [2019-09-09 05:50:10,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:10,157 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 136 transitions. [2019-09-09 05:50:10,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:10,157 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 136 transitions. [2019-09-09 05:50:10,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-09 05:50:10,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:10,161 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:10,161 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:10,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:10,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1680264243, now seen corresponding path program 1 times [2019-09-09 05:50:10,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:10,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:10,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:10,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:10,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:10,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:50:10,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:10,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:10,202 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:10,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:10,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:10,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:10,203 INFO L87 Difference]: Start difference. First operand 80 states and 136 transitions. Second operand 3 states. [2019-09-09 05:50:10,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:10,228 INFO L93 Difference]: Finished difference Result 112 states and 187 transitions. [2019-09-09 05:50:10,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:10,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-09 05:50:10,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:10,231 INFO L225 Difference]: With dead ends: 112 [2019-09-09 05:50:10,231 INFO L226 Difference]: Without dead ends: 112 [2019-09-09 05:50:10,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:10,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-09-09 05:50:10,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-09-09 05:50:10,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-09 05:50:10,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 186 transitions. [2019-09-09 05:50:10,251 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 186 transitions. Word has length 19 [2019-09-09 05:50:10,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:10,251 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 186 transitions. [2019-09-09 05:50:10,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:10,251 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 186 transitions. [2019-09-09 05:50:10,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-09 05:50:10,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:10,253 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:10,253 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:10,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:10,253 INFO L82 PathProgramCache]: Analyzing trace with hash 290632912, now seen corresponding path program 1 times [2019-09-09 05:50:10,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:10,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:10,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:10,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:10,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:10,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:50:10,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:10,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:10,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:10,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:10,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:10,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:10,309 INFO L87 Difference]: Start difference. First operand 110 states and 186 transitions. Second operand 3 states. [2019-09-09 05:50:10,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:10,337 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2019-09-09 05:50:10,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:10,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-09 05:50:10,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:10,339 INFO L225 Difference]: With dead ends: 114 [2019-09-09 05:50:10,339 INFO L226 Difference]: Without dead ends: 114 [2019-09-09 05:50:10,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:10,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-09 05:50:10,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2019-09-09 05:50:10,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-09 05:50:10,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 186 transitions. [2019-09-09 05:50:10,348 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 186 transitions. Word has length 20 [2019-09-09 05:50:10,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:10,349 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 186 transitions. [2019-09-09 05:50:10,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:10,349 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 186 transitions. [2019-09-09 05:50:10,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-09 05:50:10,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:10,350 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:10,351 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:10,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:10,351 INFO L82 PathProgramCache]: Analyzing trace with hash 548798350, now seen corresponding path program 1 times [2019-09-09 05:50:10,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:10,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:10,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:10,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:10,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:10,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:50:10,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:10,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:10,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:10,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:10,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:10,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:10,406 INFO L87 Difference]: Start difference. First operand 112 states and 186 transitions. Second operand 3 states. [2019-09-09 05:50:10,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:10,432 INFO L93 Difference]: Finished difference Result 202 states and 339 transitions. [2019-09-09 05:50:10,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:10,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-09 05:50:10,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:10,434 INFO L225 Difference]: With dead ends: 202 [2019-09-09 05:50:10,435 INFO L226 Difference]: Without dead ends: 202 [2019-09-09 05:50:10,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:10,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-09 05:50:10,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 152. [2019-09-09 05:50:10,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-09 05:50:10,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 250 transitions. [2019-09-09 05:50:10,446 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 250 transitions. Word has length 20 [2019-09-09 05:50:10,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:10,447 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 250 transitions. [2019-09-09 05:50:10,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:10,447 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 250 transitions. [2019-09-09 05:50:10,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-09 05:50:10,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:10,449 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:10,449 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:10,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:10,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1249862928, now seen corresponding path program 1 times [2019-09-09 05:50:10,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:10,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:10,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:10,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:10,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:10,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:50:10,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:10,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:10,482 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:10,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:10,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:10,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:10,483 INFO L87 Difference]: Start difference. First operand 152 states and 250 transitions. Second operand 3 states. [2019-09-09 05:50:10,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:10,509 INFO L93 Difference]: Finished difference Result 210 states and 339 transitions. [2019-09-09 05:50:10,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:10,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-09 05:50:10,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:10,511 INFO L225 Difference]: With dead ends: 210 [2019-09-09 05:50:10,511 INFO L226 Difference]: Without dead ends: 210 [2019-09-09 05:50:10,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:10,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-09 05:50:10,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2019-09-09 05:50:10,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-09-09 05:50:10,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 338 transitions. [2019-09-09 05:50:10,523 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 338 transitions. Word has length 20 [2019-09-09 05:50:10,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:10,523 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 338 transitions. [2019-09-09 05:50:10,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:10,524 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 338 transitions. [2019-09-09 05:50:10,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-09 05:50:10,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:10,526 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:10,526 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:10,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:10,527 INFO L82 PathProgramCache]: Analyzing trace with hash -166905624, now seen corresponding path program 1 times [2019-09-09 05:50:10,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:10,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:10,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:10,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:10,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:50:10,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:10,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:10,558 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:10,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:10,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:10,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:10,559 INFO L87 Difference]: Start difference. First operand 208 states and 338 transitions. Second operand 3 states. [2019-09-09 05:50:10,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:10,573 INFO L93 Difference]: Finished difference Result 214 states and 339 transitions. [2019-09-09 05:50:10,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:10,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-09 05:50:10,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:10,591 INFO L225 Difference]: With dead ends: 214 [2019-09-09 05:50:10,592 INFO L226 Difference]: Without dead ends: 214 [2019-09-09 05:50:10,592 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:10,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-09 05:50:10,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2019-09-09 05:50:10,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-09 05:50:10,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 338 transitions. [2019-09-09 05:50:10,600 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 338 transitions. Word has length 21 [2019-09-09 05:50:10,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:10,601 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 338 transitions. [2019-09-09 05:50:10,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:10,601 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 338 transitions. [2019-09-09 05:50:10,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-09 05:50:10,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:10,603 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:10,603 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:10,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:10,604 INFO L82 PathProgramCache]: Analyzing trace with hash 91259814, now seen corresponding path program 1 times [2019-09-09 05:50:10,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:10,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:10,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:10,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:10,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:10,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:50:10,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:10,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:10,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:10,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:10,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:10,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:10,638 INFO L87 Difference]: Start difference. First operand 212 states and 338 transitions. Second operand 3 states. [2019-09-09 05:50:10,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:10,656 INFO L93 Difference]: Finished difference Result 378 states and 607 transitions. [2019-09-09 05:50:10,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:10,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-09 05:50:10,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:10,659 INFO L225 Difference]: With dead ends: 378 [2019-09-09 05:50:10,659 INFO L226 Difference]: Without dead ends: 378 [2019-09-09 05:50:10,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:10,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-09-09 05:50:10,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 296. [2019-09-09 05:50:10,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-09-09 05:50:10,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 462 transitions. [2019-09-09 05:50:10,671 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 462 transitions. Word has length 21 [2019-09-09 05:50:10,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:10,671 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 462 transitions. [2019-09-09 05:50:10,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:10,672 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 462 transitions. [2019-09-09 05:50:10,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-09 05:50:10,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:10,673 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:10,673 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:10,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:10,674 INFO L82 PathProgramCache]: Analyzing trace with hash 792324392, now seen corresponding path program 1 times [2019-09-09 05:50:10,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:10,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:10,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:10,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:10,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:10,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:50:10,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:10,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:10,696 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:10,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:10,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:10,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:10,697 INFO L87 Difference]: Start difference. First operand 296 states and 462 transitions. Second operand 3 states. [2019-09-09 05:50:10,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:10,716 INFO L93 Difference]: Finished difference Result 402 states and 615 transitions. [2019-09-09 05:50:10,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:10,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-09 05:50:10,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:10,719 INFO L225 Difference]: With dead ends: 402 [2019-09-09 05:50:10,719 INFO L226 Difference]: Without dead ends: 402 [2019-09-09 05:50:10,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:10,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-09-09 05:50:10,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2019-09-09 05:50:10,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-09 05:50:10,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 614 transitions. [2019-09-09 05:50:10,731 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 614 transitions. Word has length 21 [2019-09-09 05:50:10,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:10,731 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 614 transitions. [2019-09-09 05:50:10,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:10,731 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 614 transitions. [2019-09-09 05:50:10,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-09 05:50:10,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:10,732 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:10,733 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:10,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:10,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1465698011, now seen corresponding path program 1 times [2019-09-09 05:50:10,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:10,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:10,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:10,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:10,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:10,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:50:10,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:10,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:10,755 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:10,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:10,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:10,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:10,756 INFO L87 Difference]: Start difference. First operand 400 states and 614 transitions. Second operand 3 states. [2019-09-09 05:50:10,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:10,770 INFO L93 Difference]: Finished difference Result 410 states and 615 transitions. [2019-09-09 05:50:10,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:10,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-09 05:50:10,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:10,773 INFO L225 Difference]: With dead ends: 410 [2019-09-09 05:50:10,773 INFO L226 Difference]: Without dead ends: 410 [2019-09-09 05:50:10,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:10,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-09-09 05:50:10,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2019-09-09 05:50:10,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-09-09 05:50:10,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 614 transitions. [2019-09-09 05:50:10,785 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 614 transitions. Word has length 22 [2019-09-09 05:50:10,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:10,785 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 614 transitions. [2019-09-09 05:50:10,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:10,785 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 614 transitions. [2019-09-09 05:50:10,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-09 05:50:10,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:10,787 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:10,787 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:10,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:10,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1207532573, now seen corresponding path program 1 times [2019-09-09 05:50:10,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:10,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:10,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:10,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:10,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:10,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:50:10,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:10,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:10,823 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:10,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:10,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:10,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:10,824 INFO L87 Difference]: Start difference. First operand 408 states and 614 transitions. Second operand 3 states. [2019-09-09 05:50:10,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:10,844 INFO L93 Difference]: Finished difference Result 714 states and 1079 transitions. [2019-09-09 05:50:10,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:10,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-09 05:50:10,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:10,848 INFO L225 Difference]: With dead ends: 714 [2019-09-09 05:50:10,849 INFO L226 Difference]: Without dead ends: 714 [2019-09-09 05:50:10,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:10,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-09-09 05:50:10,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 584. [2019-09-09 05:50:10,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-09-09 05:50:10,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 854 transitions. [2019-09-09 05:50:10,865 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 854 transitions. Word has length 22 [2019-09-09 05:50:10,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:10,865 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 854 transitions. [2019-09-09 05:50:10,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:10,866 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 854 transitions. [2019-09-09 05:50:10,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-09 05:50:10,867 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:10,868 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:10,868 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:10,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:10,869 INFO L82 PathProgramCache]: Analyzing trace with hash -506467995, now seen corresponding path program 1 times [2019-09-09 05:50:10,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:10,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:10,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:10,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:10,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:10,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:50:10,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:10,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:10,905 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:10,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:10,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:10,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:10,906 INFO L87 Difference]: Start difference. First operand 584 states and 854 transitions. Second operand 3 states. [2019-09-09 05:50:10,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:10,931 INFO L93 Difference]: Finished difference Result 778 states and 1111 transitions. [2019-09-09 05:50:10,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:10,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-09 05:50:10,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:10,937 INFO L225 Difference]: With dead ends: 778 [2019-09-09 05:50:10,937 INFO L226 Difference]: Without dead ends: 778 [2019-09-09 05:50:10,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:10,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-09-09 05:50:10,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 776. [2019-09-09 05:50:10,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-09-09 05:50:10,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1110 transitions. [2019-09-09 05:50:10,957 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1110 transitions. Word has length 22 [2019-09-09 05:50:10,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:10,958 INFO L475 AbstractCegarLoop]: Abstraction has 776 states and 1110 transitions. [2019-09-09 05:50:10,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:10,958 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1110 transitions. [2019-09-09 05:50:10,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-09 05:50:10,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:10,960 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:10,961 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:10,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:10,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1221411293, now seen corresponding path program 1 times [2019-09-09 05:50:10,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:10,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:10,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:10,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:10,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:10,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:50:10,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:10,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:10,993 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:10,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:10,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:10,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:10,994 INFO L87 Difference]: Start difference. First operand 776 states and 1110 transitions. Second operand 3 states. [2019-09-09 05:50:11,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:11,012 INFO L93 Difference]: Finished difference Result 794 states and 1111 transitions. [2019-09-09 05:50:11,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:11,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-09 05:50:11,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:11,016 INFO L225 Difference]: With dead ends: 794 [2019-09-09 05:50:11,017 INFO L226 Difference]: Without dead ends: 794 [2019-09-09 05:50:11,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:11,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-09-09 05:50:11,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 792. [2019-09-09 05:50:11,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-09-09 05:50:11,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1110 transitions. [2019-09-09 05:50:11,046 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1110 transitions. Word has length 23 [2019-09-09 05:50:11,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:11,047 INFO L475 AbstractCegarLoop]: Abstraction has 792 states and 1110 transitions. [2019-09-09 05:50:11,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:11,047 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1110 transitions. [2019-09-09 05:50:11,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-09 05:50:11,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:11,050 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:11,052 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:11,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:11,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1479576731, now seen corresponding path program 1 times [2019-09-09 05:50:11,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:11,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:11,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:11,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:11,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:11,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:50:11,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:11,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:11,093 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:11,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:11,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:11,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:11,097 INFO L87 Difference]: Start difference. First operand 792 states and 1110 transitions. Second operand 3 states. [2019-09-09 05:50:11,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:11,124 INFO L93 Difference]: Finished difference Result 1354 states and 1895 transitions. [2019-09-09 05:50:11,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:11,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-09 05:50:11,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:11,132 INFO L225 Difference]: With dead ends: 1354 [2019-09-09 05:50:11,133 INFO L226 Difference]: Without dead ends: 1354 [2019-09-09 05:50:11,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:11,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-09-09 05:50:11,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1160. [2019-09-09 05:50:11,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2019-09-09 05:50:11,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1574 transitions. [2019-09-09 05:50:11,172 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1574 transitions. Word has length 23 [2019-09-09 05:50:11,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:11,172 INFO L475 AbstractCegarLoop]: Abstraction has 1160 states and 1574 transitions. [2019-09-09 05:50:11,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:11,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1574 transitions. [2019-09-09 05:50:11,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-09 05:50:11,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:11,175 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:11,175 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:11,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:11,176 INFO L82 PathProgramCache]: Analyzing trace with hash -2114325987, now seen corresponding path program 1 times [2019-09-09 05:50:11,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:11,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:11,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:11,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:11,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:11,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:50:11,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:11,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:11,204 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:11,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:11,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:11,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:11,205 INFO L87 Difference]: Start difference. First operand 1160 states and 1574 transitions. Second operand 3 states. [2019-09-09 05:50:11,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:11,226 INFO L93 Difference]: Finished difference Result 1514 states and 1991 transitions. [2019-09-09 05:50:11,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:11,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-09 05:50:11,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:11,234 INFO L225 Difference]: With dead ends: 1514 [2019-09-09 05:50:11,234 INFO L226 Difference]: Without dead ends: 1514 [2019-09-09 05:50:11,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:11,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2019-09-09 05:50:11,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1512. [2019-09-09 05:50:11,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2019-09-09 05:50:11,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1990 transitions. [2019-09-09 05:50:11,279 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1990 transitions. Word has length 23 [2019-09-09 05:50:11,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:11,281 INFO L475 AbstractCegarLoop]: Abstraction has 1512 states and 1990 transitions. [2019-09-09 05:50:11,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:11,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1990 transitions. [2019-09-09 05:50:11,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-09 05:50:11,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:11,285 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:11,286 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:11,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:11,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1377545862, now seen corresponding path program 1 times [2019-09-09 05:50:11,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:11,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:11,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:11,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:11,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:11,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:50:11,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:11,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:11,315 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:11,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:11,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:11,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:11,316 INFO L87 Difference]: Start difference. First operand 1512 states and 1990 transitions. Second operand 3 states. [2019-09-09 05:50:11,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:11,336 INFO L93 Difference]: Finished difference Result 1546 states and 1991 transitions. [2019-09-09 05:50:11,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:11,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-09 05:50:11,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:11,345 INFO L225 Difference]: With dead ends: 1546 [2019-09-09 05:50:11,345 INFO L226 Difference]: Without dead ends: 1546 [2019-09-09 05:50:11,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:11,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2019-09-09 05:50:11,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1544. [2019-09-09 05:50:11,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-09-09 05:50:11,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1990 transitions. [2019-09-09 05:50:11,399 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1990 transitions. Word has length 24 [2019-09-09 05:50:11,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:11,399 INFO L475 AbstractCegarLoop]: Abstraction has 1544 states and 1990 transitions. [2019-09-09 05:50:11,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:11,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1990 transitions. [2019-09-09 05:50:11,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-09 05:50:11,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:11,402 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:11,403 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:11,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:11,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1119380424, now seen corresponding path program 1 times [2019-09-09 05:50:11,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:11,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:11,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:11,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:11,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:50:11,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:11,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:11,423 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:11,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:11,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:11,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:11,425 INFO L87 Difference]: Start difference. First operand 1544 states and 1990 transitions. Second operand 3 states. [2019-09-09 05:50:11,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:11,452 INFO L93 Difference]: Finished difference Result 2570 states and 3271 transitions. [2019-09-09 05:50:11,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:11,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-09 05:50:11,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:11,465 INFO L225 Difference]: With dead ends: 2570 [2019-09-09 05:50:11,465 INFO L226 Difference]: Without dead ends: 2570 [2019-09-09 05:50:11,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:11,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2019-09-09 05:50:11,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2312. [2019-09-09 05:50:11,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-09-09 05:50:11,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2886 transitions. [2019-09-09 05:50:11,530 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2886 transitions. Word has length 24 [2019-09-09 05:50:11,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:11,530 INFO L475 AbstractCegarLoop]: Abstraction has 2312 states and 2886 transitions. [2019-09-09 05:50:11,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:11,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2886 transitions. [2019-09-09 05:50:11,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-09 05:50:11,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:11,536 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:11,537 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:11,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:11,537 INFO L82 PathProgramCache]: Analyzing trace with hash -418315846, now seen corresponding path program 1 times [2019-09-09 05:50:11,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:11,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:11,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:11,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:11,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:11,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:50:11,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:11,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:11,562 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:11,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:11,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:11,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:11,563 INFO L87 Difference]: Start difference. First operand 2312 states and 2886 transitions. Second operand 3 states. [2019-09-09 05:50:11,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:11,591 INFO L93 Difference]: Finished difference Result 2954 states and 3527 transitions. [2019-09-09 05:50:11,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:11,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-09 05:50:11,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:11,607 INFO L225 Difference]: With dead ends: 2954 [2019-09-09 05:50:11,607 INFO L226 Difference]: Without dead ends: 2954 [2019-09-09 05:50:11,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:11,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2019-09-09 05:50:11,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2952. [2019-09-09 05:50:11,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2019-09-09 05:50:11,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 3526 transitions. [2019-09-09 05:50:11,683 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 3526 transitions. Word has length 24 [2019-09-09 05:50:11,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:11,683 INFO L475 AbstractCegarLoop]: Abstraction has 2952 states and 3526 transitions. [2019-09-09 05:50:11,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:11,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 3526 transitions. [2019-09-09 05:50:11,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-09 05:50:11,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:11,688 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:11,689 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:11,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:11,689 INFO L82 PathProgramCache]: Analyzing trace with hash -340838702, now seen corresponding path program 1 times [2019-09-09 05:50:11,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:11,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:11,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:11,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:11,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:50:11,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:11,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:11,716 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:11,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:11,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:11,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:11,717 INFO L87 Difference]: Start difference. First operand 2952 states and 3526 transitions. Second operand 3 states. [2019-09-09 05:50:11,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:11,748 INFO L93 Difference]: Finished difference Result 3018 states and 3527 transitions. [2019-09-09 05:50:11,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:11,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-09 05:50:11,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:11,763 INFO L225 Difference]: With dead ends: 3018 [2019-09-09 05:50:11,763 INFO L226 Difference]: Without dead ends: 3018 [2019-09-09 05:50:11,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:11,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2019-09-09 05:50:11,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3016. [2019-09-09 05:50:11,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2019-09-09 05:50:11,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3526 transitions. [2019-09-09 05:50:11,832 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3526 transitions. Word has length 25 [2019-09-09 05:50:11,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:11,832 INFO L475 AbstractCegarLoop]: Abstraction has 3016 states and 3526 transitions. [2019-09-09 05:50:11,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:11,833 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3526 transitions. [2019-09-09 05:50:11,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-09 05:50:11,838 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:11,838 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:11,838 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:11,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:11,838 INFO L82 PathProgramCache]: Analyzing trace with hash -82673264, now seen corresponding path program 1 times [2019-09-09 05:50:11,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:11,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:11,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:11,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:11,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:11,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:50:11,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:11,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:11,863 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:11,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:11,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:11,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:11,864 INFO L87 Difference]: Start difference. First operand 3016 states and 3526 transitions. Second operand 3 states. [2019-09-09 05:50:11,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:11,895 INFO L93 Difference]: Finished difference Result 5768 states and 6278 transitions. [2019-09-09 05:50:11,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:11,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-09 05:50:11,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:11,911 INFO L225 Difference]: With dead ends: 5768 [2019-09-09 05:50:11,911 INFO L226 Difference]: Without dead ends: 3016 [2019-09-09 05:50:11,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:11,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2019-09-09 05:50:11,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 3016. [2019-09-09 05:50:11,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2019-09-09 05:50:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3270 transitions. [2019-09-09 05:50:11,968 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3270 transitions. Word has length 25 [2019-09-09 05:50:11,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:11,969 INFO L475 AbstractCegarLoop]: Abstraction has 3016 states and 3270 transitions. [2019-09-09 05:50:11,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:11,969 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2019-09-09 05:50:11,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-09 05:50:11,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:50:11,974 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:50:11,974 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:50:11,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:50:11,974 INFO L82 PathProgramCache]: Analyzing trace with hash -783737842, now seen corresponding path program 1 times [2019-09-09 05:50:11,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:50:11,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:11,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:50:11,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:50:11,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:50:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:50:12,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:50:12,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:50:12,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:50:12,001 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:50:12,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:50:12,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:50:12,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:12,002 INFO L87 Difference]: Start difference. First operand 3016 states and 3270 transitions. Second operand 3 states. [2019-09-09 05:50:12,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:50:12,019 INFO L93 Difference]: Finished difference Result 3014 states and 3141 transitions. [2019-09-09 05:50:12,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:50:12,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-09 05:50:12,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:50:12,021 INFO L225 Difference]: With dead ends: 3014 [2019-09-09 05:50:12,021 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:50:12,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:50:12,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:50:12,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:50:12,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:50:12,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:50:12,023 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-09-09 05:50:12,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:50:12,023 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:50:12,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:50:12,024 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:50:12,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:50:12,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:50:12 BoogieIcfgContainer [2019-09-09 05:50:12,032 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:50:12,040 INFO L168 Benchmark]: Toolchain (without parser) took 3504.46 ms. Allocated memory was 133.7 MB in the beginning and 260.0 MB in the end (delta: 126.4 MB). Free memory was 89.4 MB in the beginning and 86.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 129.7 MB. Max. memory is 7.1 GB. [2019-09-09 05:50:12,041 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 133.7 MB. Free memory was 108.1 MB in the beginning and 107.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:50:12,042 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.65 ms. Allocated memory was 133.7 MB in the beginning and 200.8 MB in the end (delta: 67.1 MB). Free memory was 89.2 MB in the beginning and 178.3 MB in the end (delta: -89.1 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2019-09-09 05:50:12,043 INFO L168 Benchmark]: Boogie Preprocessor took 39.09 ms. Allocated memory is still 200.8 MB. Free memory was 178.3 MB in the beginning and 176.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:50:12,044 INFO L168 Benchmark]: RCFGBuilder took 398.99 ms. Allocated memory is still 200.8 MB. Free memory was 176.1 MB in the beginning and 158.9 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:50:12,047 INFO L168 Benchmark]: TraceAbstraction took 2728.13 ms. Allocated memory was 200.8 MB in the beginning and 260.0 MB in the end (delta: 59.2 MB). Free memory was 158.9 MB in the beginning and 86.1 MB in the end (delta: 72.8 MB). Peak memory consumption was 132.0 MB. Max. memory is 7.1 GB. [2019-09-09 05:50:12,058 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 133.7 MB. Free memory was 108.1 MB in the beginning and 107.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 333.65 ms. Allocated memory was 133.7 MB in the beginning and 200.8 MB in the end (delta: 67.1 MB). Free memory was 89.2 MB in the beginning and 178.3 MB in the end (delta: -89.1 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.09 ms. Allocated memory is still 200.8 MB. Free memory was 178.3 MB in the beginning and 176.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 398.99 ms. Allocated memory is still 200.8 MB. Free memory was 176.1 MB in the beginning and 158.9 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2728.13 ms. Allocated memory was 200.8 MB in the beginning and 260.0 MB in the end (delta: 59.2 MB). Free memory was 158.9 MB in the beginning and 86.1 MB in the end (delta: 72.8 MB). Peak memory consumption was 132.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.6s 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.2s 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.6s 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...