java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/locks/test_locks_10.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:30:46,724 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:30:46,727 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:30:46,740 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:30:46,741 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:30:46,742 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:30:46,744 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:30:46,746 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:30:46,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:30:46,750 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:30:46,751 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:30:46,753 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:30:46,753 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:30:46,755 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:30:46,756 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:30:46,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:30:46,759 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:30:46,760 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:30:46,762 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:30:46,765 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:30:46,767 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:30:46,769 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:30:46,770 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:30:46,772 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:30:46,775 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:30:46,775 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:30:46,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:30:46,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:30:46,777 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:30:46,778 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:30:46,779 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:30:46,780 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:30:46,781 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:30:46,782 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:30:46,784 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:30:46,784 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:30:46,785 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:30:46,785 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:30:46,786 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:30:46,787 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:30:46,788 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:30:46,789 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-10-03 02:30:46,806 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:30:46,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:30:46,807 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:30:46,807 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:30:46,808 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:30:46,808 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:30:46,809 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:30:46,809 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:30:46,809 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:30:46,809 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:30:46,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:30:46,811 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:30:46,811 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:30:46,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:30:46,811 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:30:46,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:30:46,812 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:30:46,812 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:30:46,812 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:30:46,812 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:30:46,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:30:46,813 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:30:46,813 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:30:46,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:30:46,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:30:46,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:30:46,814 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:30:46,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:30:46,814 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:30:46,814 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:30:46,849 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:30:46,865 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:30:46,869 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:30:46,871 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:30:46,872 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:30:46,873 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10.c [2019-10-03 02:30:46,949 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/686211db5/d204888e866c4ed3909e40e107ae7b7d/FLAG35c3945b8 [2019-10-03 02:30:47,517 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:30:47,518 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c [2019-10-03 02:30:47,533 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/686211db5/d204888e866c4ed3909e40e107ae7b7d/FLAG35c3945b8 [2019-10-03 02:30:47,876 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/686211db5/d204888e866c4ed3909e40e107ae7b7d [2019-10-03 02:30:47,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:30:47,899 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:30:47,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:30:47,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:30:47,908 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:30:47,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:30:47" (1/1) ... [2019-10-03 02:30:47,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f0e942a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:47, skipping insertion in model container [2019-10-03 02:30:47,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:30:47" (1/1) ... [2019-10-03 02:30:47,926 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:30:47,966 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:30:48,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:30:48,280 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:30:48,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:30:48,434 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:30:48,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:48 WrapperNode [2019-10-03 02:30:48,436 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:30:48,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:30:48,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:30:48,438 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:30:48,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:48" (1/1) ... [2019-10-03 02:30:48,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:48" (1/1) ... [2019-10-03 02:30:48,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:48" (1/1) ... [2019-10-03 02:30:48,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:48" (1/1) ... [2019-10-03 02:30:48,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:48" (1/1) ... [2019-10-03 02:30:48,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:48" (1/1) ... [2019-10-03 02:30:48,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:48" (1/1) ... [2019-10-03 02:30:48,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:30:48,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:30:48,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:30:48,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:30:48,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:48" (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-10-03 02:30:48,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:30:48,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:30:48,579 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:30:48,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:30:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:30:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:30:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:30:48,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:30:49,028 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:30:49,028 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-03 02:30:49,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:30:49 BoogieIcfgContainer [2019-10-03 02:30:49,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:30:49,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:30:49,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:30:49,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:30:49,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:30:47" (1/3) ... [2019-10-03 02:30:49,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e7b4e91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:30:49, skipping insertion in model container [2019-10-03 02:30:49,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:30:48" (2/3) ... [2019-10-03 02:30:49,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e7b4e91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:30:49, skipping insertion in model container [2019-10-03 02:30:49,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:30:49" (3/3) ... [2019-10-03 02:30:49,041 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2019-10-03 02:30:49,054 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:30:49,063 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:30:49,087 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:30:49,126 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:30:49,126 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:30:49,127 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:30:49,127 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:30:49,127 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:30:49,128 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:30:49,128 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:30:49,128 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:30:49,155 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-10-03 02:30:49,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-03 02:30:49,166 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:49,167 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:30:49,169 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:49,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:49,175 INFO L82 PathProgramCache]: Analyzing trace with hash -917347053, now seen corresponding path program 1 times [2019-10-03 02:30:49,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:49,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:49,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:49,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:49,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:49,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:49,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:49,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:49,381 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:49,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:49,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:49,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:49,399 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-10-03 02:30:49,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:49,445 INFO L93 Difference]: Finished difference Result 80 states and 137 transitions. [2019-10-03 02:30:49,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:49,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-03 02:30:49,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:49,458 INFO L225 Difference]: With dead ends: 80 [2019-10-03 02:30:49,459 INFO L226 Difference]: Without dead ends: 72 [2019-10-03 02:30:49,460 INFO L640 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-10-03 02:30:49,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-03 02:30:49,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-10-03 02:30:49,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-03 02:30:49,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 89 transitions. [2019-10-03 02:30:49,502 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 89 transitions. Word has length 20 [2019-10-03 02:30:49,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:49,503 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 89 transitions. [2019-10-03 02:30:49,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:49,503 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 89 transitions. [2019-10-03 02:30:49,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-03 02:30:49,505 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:49,505 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:30:49,505 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:49,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:49,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1504153067, now seen corresponding path program 1 times [2019-10-03 02:30:49,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:49,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:49,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:49,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:49,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:49,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:49,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:49,570 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:49,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:49,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:49,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:49,572 INFO L87 Difference]: Start difference. First operand 50 states and 89 transitions. Second operand 3 states. [2019-10-03 02:30:49,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:49,604 INFO L93 Difference]: Finished difference Result 72 states and 126 transitions. [2019-10-03 02:30:49,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:49,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-03 02:30:49,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:49,607 INFO L225 Difference]: With dead ends: 72 [2019-10-03 02:30:49,607 INFO L226 Difference]: Without dead ends: 72 [2019-10-03 02:30:49,608 INFO L640 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-10-03 02:30:49,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-03 02:30:49,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-10-03 02:30:49,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-03 02:30:49,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 125 transitions. [2019-10-03 02:30:49,624 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 125 transitions. Word has length 20 [2019-10-03 02:30:49,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:49,625 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 125 transitions. [2019-10-03 02:30:49,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:49,625 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 125 transitions. [2019-10-03 02:30:49,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 02:30:49,627 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:49,627 INFO L411 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-10-03 02:30:49,627 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:49,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:49,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1627225809, now seen corresponding path program 1 times [2019-10-03 02:30:49,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:49,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:49,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:49,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:49,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:49,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:49,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:49,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:49,699 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:49,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:49,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:49,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:49,700 INFO L87 Difference]: Start difference. First operand 70 states and 125 transitions. Second operand 3 states. [2019-10-03 02:30:49,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:49,723 INFO L93 Difference]: Finished difference Result 75 states and 128 transitions. [2019-10-03 02:30:49,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:49,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-03 02:30:49,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:49,725 INFO L225 Difference]: With dead ends: 75 [2019-10-03 02:30:49,727 INFO L226 Difference]: Without dead ends: 75 [2019-10-03 02:30:49,728 INFO L640 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-10-03 02:30:49,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-03 02:30:49,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-10-03 02:30:49,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-03 02:30:49,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 127 transitions. [2019-10-03 02:30:49,749 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 127 transitions. Word has length 21 [2019-10-03 02:30:49,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:49,750 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 127 transitions. [2019-10-03 02:30:49,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:49,750 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2019-10-03 02:30:49,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 02:30:49,752 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:49,753 INFO L411 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-10-03 02:30:49,753 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:49,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:49,753 INFO L82 PathProgramCache]: Analyzing trace with hash 616108559, now seen corresponding path program 1 times [2019-10-03 02:30:49,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:49,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:49,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:49,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:49,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:49,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:49,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:49,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:49,828 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:49,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:49,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:49,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:49,830 INFO L87 Difference]: Start difference. First operand 73 states and 127 transitions. Second operand 3 states. [2019-10-03 02:30:49,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:49,863 INFO L93 Difference]: Finished difference Result 134 states and 237 transitions. [2019-10-03 02:30:49,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:49,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-03 02:30:49,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:49,865 INFO L225 Difference]: With dead ends: 134 [2019-10-03 02:30:49,865 INFO L226 Difference]: Without dead ends: 134 [2019-10-03 02:30:49,866 INFO L640 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-10-03 02:30:49,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-10-03 02:30:49,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2019-10-03 02:30:49,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-03 02:30:49,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 168 transitions. [2019-10-03 02:30:49,884 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 168 transitions. Word has length 21 [2019-10-03 02:30:49,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:49,884 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 168 transitions. [2019-10-03 02:30:49,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:49,885 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 168 transitions. [2019-10-03 02:30:49,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 02:30:49,886 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:49,886 INFO L411 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-10-03 02:30:49,886 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:49,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:49,887 INFO L82 PathProgramCache]: Analyzing trace with hash 29302545, now seen corresponding path program 1 times [2019-10-03 02:30:49,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:49,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:49,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:49,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:49,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:49,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:49,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:49,923 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:49,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:49,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:49,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:49,924 INFO L87 Difference]: Start difference. First operand 96 states and 168 transitions. Second operand 3 states. [2019-10-03 02:30:49,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:49,953 INFO L93 Difference]: Finished difference Result 136 states and 235 transitions. [2019-10-03 02:30:49,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:49,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-03 02:30:49,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:49,955 INFO L225 Difference]: With dead ends: 136 [2019-10-03 02:30:49,955 INFO L226 Difference]: Without dead ends: 136 [2019-10-03 02:30:49,956 INFO L640 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-10-03 02:30:49,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-03 02:30:49,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2019-10-03 02:30:49,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-10-03 02:30:49,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 234 transitions. [2019-10-03 02:30:49,965 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 234 transitions. Word has length 21 [2019-10-03 02:30:49,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:49,966 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 234 transitions. [2019-10-03 02:30:49,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:49,966 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 234 transitions. [2019-10-03 02:30:49,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-03 02:30:49,967 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:49,968 INFO L411 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-10-03 02:30:49,968 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:49,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:49,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1919709866, now seen corresponding path program 1 times [2019-10-03 02:30:49,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:49,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:49,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:49,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:49,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:50,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:50,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:50,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:50,024 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:50,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:50,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:50,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:50,025 INFO L87 Difference]: Start difference. First operand 134 states and 234 transitions. Second operand 3 states. [2019-10-03 02:30:50,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:50,042 INFO L93 Difference]: Finished difference Result 138 states and 235 transitions. [2019-10-03 02:30:50,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:50,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-03 02:30:50,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:50,044 INFO L225 Difference]: With dead ends: 138 [2019-10-03 02:30:50,044 INFO L226 Difference]: Without dead ends: 138 [2019-10-03 02:30:50,045 INFO L640 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-10-03 02:30:50,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-10-03 02:30:50,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-10-03 02:30:50,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-03 02:30:50,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 234 transitions. [2019-10-03 02:30:50,056 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 234 transitions. Word has length 22 [2019-10-03 02:30:50,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:50,056 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 234 transitions. [2019-10-03 02:30:50,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:50,056 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 234 transitions. [2019-10-03 02:30:50,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-03 02:30:50,058 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:50,058 INFO L411 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-10-03 02:30:50,058 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:50,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:50,059 INFO L82 PathProgramCache]: Analyzing trace with hash 908592616, now seen corresponding path program 1 times [2019-10-03 02:30:50,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:50,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:50,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:50,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:50,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:50,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-10-03 02:30:50,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:50,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:50,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:50,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:50,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:50,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:50,096 INFO L87 Difference]: Start difference. First operand 136 states and 234 transitions. Second operand 3 states. [2019-10-03 02:30:50,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:50,120 INFO L93 Difference]: Finished difference Result 250 states and 435 transitions. [2019-10-03 02:30:50,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:50,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-03 02:30:50,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:50,123 INFO L225 Difference]: With dead ends: 250 [2019-10-03 02:30:50,123 INFO L226 Difference]: Without dead ends: 250 [2019-10-03 02:30:50,124 INFO L640 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-10-03 02:30:50,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-03 02:30:50,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 184. [2019-10-03 02:30:50,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-10-03 02:30:50,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 314 transitions. [2019-10-03 02:30:50,137 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 314 transitions. Word has length 22 [2019-10-03 02:30:50,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:50,137 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 314 transitions. [2019-10-03 02:30:50,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:50,138 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 314 transitions. [2019-10-03 02:30:50,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-03 02:30:50,140 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:50,140 INFO L411 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-10-03 02:30:50,140 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:50,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:50,141 INFO L82 PathProgramCache]: Analyzing trace with hash 321786602, now seen corresponding path program 1 times [2019-10-03 02:30:50,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:50,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:50,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:50,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:50,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:50,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:50,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:50,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:50,181 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:50,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:50,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:50,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:50,182 INFO L87 Difference]: Start difference. First operand 184 states and 314 transitions. Second operand 3 states. [2019-10-03 02:30:50,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:50,210 INFO L93 Difference]: Finished difference Result 258 states and 435 transitions. [2019-10-03 02:30:50,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:50,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-03 02:30:50,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:50,226 INFO L225 Difference]: With dead ends: 258 [2019-10-03 02:30:50,227 INFO L226 Difference]: Without dead ends: 258 [2019-10-03 02:30:50,229 INFO L640 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-10-03 02:30:50,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-03 02:30:50,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-10-03 02:30:50,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-10-03 02:30:50,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 434 transitions. [2019-10-03 02:30:50,251 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 434 transitions. Word has length 22 [2019-10-03 02:30:50,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:50,252 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 434 transitions. [2019-10-03 02:30:50,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:50,252 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 434 transitions. [2019-10-03 02:30:50,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-03 02:30:50,254 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:50,254 INFO L411 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-10-03 02:30:50,254 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:50,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:50,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1898185914, now seen corresponding path program 1 times [2019-10-03 02:30:50,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:50,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:50,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:50,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:50,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:50,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:50,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:50,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:50,280 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:50,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:50,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:50,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:50,281 INFO L87 Difference]: Start difference. First operand 256 states and 434 transitions. Second operand 3 states. [2019-10-03 02:30:50,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:50,296 INFO L93 Difference]: Finished difference Result 262 states and 435 transitions. [2019-10-03 02:30:50,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:50,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-03 02:30:50,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:50,299 INFO L225 Difference]: With dead ends: 262 [2019-10-03 02:30:50,299 INFO L226 Difference]: Without dead ends: 262 [2019-10-03 02:30:50,300 INFO L640 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-10-03 02:30:50,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-10-03 02:30:50,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2019-10-03 02:30:50,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-03 02:30:50,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 434 transitions. [2019-10-03 02:30:50,308 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 434 transitions. Word has length 23 [2019-10-03 02:30:50,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:50,308 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 434 transitions. [2019-10-03 02:30:50,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:50,308 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 434 transitions. [2019-10-03 02:30:50,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-03 02:30:50,310 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:50,310 INFO L411 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-10-03 02:30:50,311 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:50,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:50,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1385664132, now seen corresponding path program 1 times [2019-10-03 02:30:50,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:50,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:50,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:50,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:50,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:50,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:50,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:50,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:50,336 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:50,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:50,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:50,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:50,337 INFO L87 Difference]: Start difference. First operand 260 states and 434 transitions. Second operand 3 states. [2019-10-03 02:30:50,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:50,353 INFO L93 Difference]: Finished difference Result 474 states and 799 transitions. [2019-10-03 02:30:50,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:50,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-03 02:30:50,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:50,357 INFO L225 Difference]: With dead ends: 474 [2019-10-03 02:30:50,357 INFO L226 Difference]: Without dead ends: 474 [2019-10-03 02:30:50,358 INFO L640 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-10-03 02:30:50,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-10-03 02:30:50,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 360. [2019-10-03 02:30:50,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-10-03 02:30:50,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 590 transitions. [2019-10-03 02:30:50,369 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 590 transitions. Word has length 23 [2019-10-03 02:30:50,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:50,370 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 590 transitions. [2019-10-03 02:30:50,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:50,370 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 590 transitions. [2019-10-03 02:30:50,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-03 02:30:50,372 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:50,372 INFO L411 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-10-03 02:30:50,372 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:50,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:50,373 INFO L82 PathProgramCache]: Analyzing trace with hash 798858118, now seen corresponding path program 1 times [2019-10-03 02:30:50,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:50,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:50,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:50,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:50,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:50,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:50,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:50,395 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:50,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:50,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:50,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:50,396 INFO L87 Difference]: Start difference. First operand 360 states and 590 transitions. Second operand 3 states. [2019-10-03 02:30:50,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:50,412 INFO L93 Difference]: Finished difference Result 498 states and 807 transitions. [2019-10-03 02:30:50,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:50,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-03 02:30:50,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:50,416 INFO L225 Difference]: With dead ends: 498 [2019-10-03 02:30:50,416 INFO L226 Difference]: Without dead ends: 498 [2019-10-03 02:30:50,417 INFO L640 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-10-03 02:30:50,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-10-03 02:30:50,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2019-10-03 02:30:50,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2019-10-03 02:30:50,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 806 transitions. [2019-10-03 02:30:50,430 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 806 transitions. Word has length 23 [2019-10-03 02:30:50,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:50,431 INFO L475 AbstractCegarLoop]: Abstraction has 496 states and 806 transitions. [2019-10-03 02:30:50,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:50,431 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 806 transitions. [2019-10-03 02:30:50,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-03 02:30:50,432 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:50,432 INFO L411 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-10-03 02:30:50,433 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:50,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:50,433 INFO L82 PathProgramCache]: Analyzing trace with hash 6129535, now seen corresponding path program 1 times [2019-10-03 02:30:50,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:50,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:50,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:50,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:50,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:50,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:50,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:50,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:50,455 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:50,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:50,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:50,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:50,456 INFO L87 Difference]: Start difference. First operand 496 states and 806 transitions. Second operand 3 states. [2019-10-03 02:30:50,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:50,472 INFO L93 Difference]: Finished difference Result 506 states and 807 transitions. [2019-10-03 02:30:50,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:50,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-03 02:30:50,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:50,475 INFO L225 Difference]: With dead ends: 506 [2019-10-03 02:30:50,476 INFO L226 Difference]: Without dead ends: 506 [2019-10-03 02:30:50,476 INFO L640 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-10-03 02:30:50,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-10-03 02:30:50,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2019-10-03 02:30:50,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-10-03 02:30:50,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 806 transitions. [2019-10-03 02:30:50,489 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 806 transitions. Word has length 24 [2019-10-03 02:30:50,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:50,489 INFO L475 AbstractCegarLoop]: Abstraction has 504 states and 806 transitions. [2019-10-03 02:30:50,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:50,490 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 806 transitions. [2019-10-03 02:30:50,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-03 02:30:50,491 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:50,491 INFO L411 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-10-03 02:30:50,491 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:50,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:50,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1004987715, now seen corresponding path program 1 times [2019-10-03 02:30:50,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:50,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:50,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:50,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:50,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:50,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:50,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:50,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:50,513 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:50,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:50,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:50,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:50,514 INFO L87 Difference]: Start difference. First operand 504 states and 806 transitions. Second operand 3 states. [2019-10-03 02:30:50,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:50,532 INFO L93 Difference]: Finished difference Result 906 states and 1463 transitions. [2019-10-03 02:30:50,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:50,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-03 02:30:50,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:50,538 INFO L225 Difference]: With dead ends: 906 [2019-10-03 02:30:50,538 INFO L226 Difference]: Without dead ends: 906 [2019-10-03 02:30:50,538 INFO L640 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-10-03 02:30:50,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2019-10-03 02:30:50,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 712. [2019-10-03 02:30:50,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-10-03 02:30:50,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1110 transitions. [2019-10-03 02:30:50,557 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1110 transitions. Word has length 24 [2019-10-03 02:30:50,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:50,557 INFO L475 AbstractCegarLoop]: Abstraction has 712 states and 1110 transitions. [2019-10-03 02:30:50,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:50,558 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1110 transitions. [2019-10-03 02:30:50,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-03 02:30:50,559 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:50,559 INFO L411 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-10-03 02:30:50,560 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:50,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:50,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1591793729, now seen corresponding path program 1 times [2019-10-03 02:30:50,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:50,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:50,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:50,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:50,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:50,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:50,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:50,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:50,580 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:50,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:50,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:50,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:50,582 INFO L87 Difference]: Start difference. First operand 712 states and 1110 transitions. Second operand 3 states. [2019-10-03 02:30:50,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:50,601 INFO L93 Difference]: Finished difference Result 970 states and 1495 transitions. [2019-10-03 02:30:50,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:50,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-03 02:30:50,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:50,607 INFO L225 Difference]: With dead ends: 970 [2019-10-03 02:30:50,607 INFO L226 Difference]: Without dead ends: 970 [2019-10-03 02:30:50,608 INFO L640 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-10-03 02:30:50,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-10-03 02:30:50,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 968. [2019-10-03 02:30:50,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-10-03 02:30:50,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1494 transitions. [2019-10-03 02:30:50,632 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1494 transitions. Word has length 24 [2019-10-03 02:30:50,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:50,633 INFO L475 AbstractCegarLoop]: Abstraction has 968 states and 1494 transitions. [2019-10-03 02:30:50,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:50,633 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1494 transitions. [2019-10-03 02:30:50,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-03 02:30:50,635 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:50,635 INFO L411 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-10-03 02:30:50,635 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:50,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:50,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1089633349, now seen corresponding path program 1 times [2019-10-03 02:30:50,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:50,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:50,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:50,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:50,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:50,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:50,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:50,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:50,657 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:50,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:50,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:50,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:50,658 INFO L87 Difference]: Start difference. First operand 968 states and 1494 transitions. Second operand 3 states. [2019-10-03 02:30:50,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:50,681 INFO L93 Difference]: Finished difference Result 986 states and 1495 transitions. [2019-10-03 02:30:50,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:50,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-03 02:30:50,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:50,686 INFO L225 Difference]: With dead ends: 986 [2019-10-03 02:30:50,687 INFO L226 Difference]: Without dead ends: 986 [2019-10-03 02:30:50,687 INFO L640 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-10-03 02:30:50,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2019-10-03 02:30:50,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2019-10-03 02:30:50,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-10-03 02:30:50,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1494 transitions. [2019-10-03 02:30:50,712 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1494 transitions. Word has length 25 [2019-10-03 02:30:50,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:50,712 INFO L475 AbstractCegarLoop]: Abstraction has 984 states and 1494 transitions. [2019-10-03 02:30:50,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:50,713 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1494 transitions. [2019-10-03 02:30:50,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-03 02:30:50,715 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:50,715 INFO L411 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-10-03 02:30:50,715 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:50,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:50,715 INFO L82 PathProgramCache]: Analyzing trace with hash -2100750599, now seen corresponding path program 1 times [2019-10-03 02:30:50,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:50,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:50,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:50,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:50,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:50,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:50,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:50,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:50,741 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:50,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:50,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:50,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:50,742 INFO L87 Difference]: Start difference. First operand 984 states and 1494 transitions. Second operand 3 states. [2019-10-03 02:30:50,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:50,764 INFO L93 Difference]: Finished difference Result 1738 states and 2663 transitions. [2019-10-03 02:30:50,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:50,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-03 02:30:50,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:50,775 INFO L225 Difference]: With dead ends: 1738 [2019-10-03 02:30:50,775 INFO L226 Difference]: Without dead ends: 1738 [2019-10-03 02:30:50,776 INFO L640 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-10-03 02:30:50,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2019-10-03 02:30:50,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1416. [2019-10-03 02:30:50,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2019-10-03 02:30:50,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2086 transitions. [2019-10-03 02:30:50,820 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2086 transitions. Word has length 25 [2019-10-03 02:30:50,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:50,821 INFO L475 AbstractCegarLoop]: Abstraction has 1416 states and 2086 transitions. [2019-10-03 02:30:50,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:50,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2086 transitions. [2019-10-03 02:30:50,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-03 02:30:50,824 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:50,825 INFO L411 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-10-03 02:30:50,825 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:50,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:50,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1607410683, now seen corresponding path program 1 times [2019-10-03 02:30:50,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:50,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:50,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:50,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:50,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:50,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:50,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:50,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:50,850 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:50,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:50,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:50,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:50,851 INFO L87 Difference]: Start difference. First operand 1416 states and 2086 transitions. Second operand 3 states. [2019-10-03 02:30:50,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:50,882 INFO L93 Difference]: Finished difference Result 1898 states and 2759 transitions. [2019-10-03 02:30:50,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:50,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-03 02:30:50,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:50,892 INFO L225 Difference]: With dead ends: 1898 [2019-10-03 02:30:50,892 INFO L226 Difference]: Without dead ends: 1898 [2019-10-03 02:30:50,893 INFO L640 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-10-03 02:30:50,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2019-10-03 02:30:50,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1896. [2019-10-03 02:30:50,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2019-10-03 02:30:50,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2758 transitions. [2019-10-03 02:30:50,952 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2758 transitions. Word has length 25 [2019-10-03 02:30:50,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:50,952 INFO L475 AbstractCegarLoop]: Abstraction has 1896 states and 2758 transitions. [2019-10-03 02:30:50,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:50,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2758 transitions. [2019-10-03 02:30:50,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-03 02:30:50,957 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:50,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:30:50,957 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:50,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:50,958 INFO L82 PathProgramCache]: Analyzing trace with hash -698544044, now seen corresponding path program 1 times [2019-10-03 02:30:50,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:50,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:50,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:50,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:50,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:50,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:50,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:50,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:50,995 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:50,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:50,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:50,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:50,996 INFO L87 Difference]: Start difference. First operand 1896 states and 2758 transitions. Second operand 3 states. [2019-10-03 02:30:51,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:51,023 INFO L93 Difference]: Finished difference Result 1930 states and 2759 transitions. [2019-10-03 02:30:51,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:51,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-03 02:30:51,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:51,033 INFO L225 Difference]: With dead ends: 1930 [2019-10-03 02:30:51,033 INFO L226 Difference]: Without dead ends: 1930 [2019-10-03 02:30:51,034 INFO L640 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-10-03 02:30:51,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2019-10-03 02:30:51,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2019-10-03 02:30:51,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2019-10-03 02:30:51,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2758 transitions. [2019-10-03 02:30:51,077 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2758 transitions. Word has length 26 [2019-10-03 02:30:51,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:51,077 INFO L475 AbstractCegarLoop]: Abstraction has 1928 states and 2758 transitions. [2019-10-03 02:30:51,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:51,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2758 transitions. [2019-10-03 02:30:51,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-03 02:30:51,080 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:51,080 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:30:51,080 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:51,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:51,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1709661294, now seen corresponding path program 1 times [2019-10-03 02:30:51,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:51,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:51,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:51,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:51,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:51,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:51,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:51,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:51,107 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:51,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:51,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:51,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:51,109 INFO L87 Difference]: Start difference. First operand 1928 states and 2758 transitions. Second operand 3 states. [2019-10-03 02:30:51,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:51,143 INFO L93 Difference]: Finished difference Result 3338 states and 4807 transitions. [2019-10-03 02:30:51,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:51,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-03 02:30:51,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:51,159 INFO L225 Difference]: With dead ends: 3338 [2019-10-03 02:30:51,159 INFO L226 Difference]: Without dead ends: 3338 [2019-10-03 02:30:51,161 INFO L640 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-10-03 02:30:51,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2019-10-03 02:30:51,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2824. [2019-10-03 02:30:51,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2019-10-03 02:30:51,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3910 transitions. [2019-10-03 02:30:51,226 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3910 transitions. Word has length 26 [2019-10-03 02:30:51,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:51,227 INFO L475 AbstractCegarLoop]: Abstraction has 2824 states and 3910 transitions. [2019-10-03 02:30:51,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:51,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3910 transitions. [2019-10-03 02:30:51,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-03 02:30:51,232 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:51,232 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:30:51,232 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:51,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:51,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1998499988, now seen corresponding path program 1 times [2019-10-03 02:30:51,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:51,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:51,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:51,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:51,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:51,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:51,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:51,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:51,257 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:51,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:51,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:51,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:51,259 INFO L87 Difference]: Start difference. First operand 2824 states and 3910 transitions. Second operand 3 states. [2019-10-03 02:30:51,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:51,318 INFO L93 Difference]: Finished difference Result 3722 states and 5063 transitions. [2019-10-03 02:30:51,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:51,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-03 02:30:51,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:51,340 INFO L225 Difference]: With dead ends: 3722 [2019-10-03 02:30:51,340 INFO L226 Difference]: Without dead ends: 3722 [2019-10-03 02:30:51,340 INFO L640 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-10-03 02:30:51,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2019-10-03 02:30:51,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3720. [2019-10-03 02:30:51,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3720 states. [2019-10-03 02:30:51,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 5062 transitions. [2019-10-03 02:30:51,454 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 5062 transitions. Word has length 26 [2019-10-03 02:30:51,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:51,454 INFO L475 AbstractCegarLoop]: Abstraction has 3720 states and 5062 transitions. [2019-10-03 02:30:51,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:51,455 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 5062 transitions. [2019-10-03 02:30:51,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-03 02:30:51,462 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:51,462 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:30:51,462 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:51,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:51,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1459677136, now seen corresponding path program 1 times [2019-10-03 02:30:51,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:51,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:51,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:51,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:51,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:51,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:51,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:51,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:51,491 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:51,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:51,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:51,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:51,492 INFO L87 Difference]: Start difference. First operand 3720 states and 5062 transitions. Second operand 3 states. [2019-10-03 02:30:51,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:51,536 INFO L93 Difference]: Finished difference Result 3786 states and 5063 transitions. [2019-10-03 02:30:51,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:51,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-03 02:30:51,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:51,558 INFO L225 Difference]: With dead ends: 3786 [2019-10-03 02:30:51,558 INFO L226 Difference]: Without dead ends: 3786 [2019-10-03 02:30:51,559 INFO L640 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-10-03 02:30:51,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2019-10-03 02:30:51,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2019-10-03 02:30:51,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-10-03 02:30:51,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5062 transitions. [2019-10-03 02:30:51,706 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5062 transitions. Word has length 27 [2019-10-03 02:30:51,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:51,706 INFO L475 AbstractCegarLoop]: Abstraction has 3784 states and 5062 transitions. [2019-10-03 02:30:51,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:51,707 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5062 transitions. [2019-10-03 02:30:51,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-03 02:30:51,714 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:51,714 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:30:51,715 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:51,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:51,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1824172910, now seen corresponding path program 1 times [2019-10-03 02:30:51,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:51,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:51,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:51,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:51,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:51,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:51,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:51,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:51,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:51,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:51,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:51,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:51,752 INFO L87 Difference]: Start difference. First operand 3784 states and 5062 transitions. Second operand 3 states. [2019-10-03 02:30:51,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:51,815 INFO L93 Difference]: Finished difference Result 7306 states and 9351 transitions. [2019-10-03 02:30:51,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:51,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-03 02:30:51,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:51,866 INFO L225 Difference]: With dead ends: 7306 [2019-10-03 02:30:51,866 INFO L226 Difference]: Without dead ends: 7306 [2019-10-03 02:30:51,866 INFO L640 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-10-03 02:30:51,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2019-10-03 02:30:51,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7304. [2019-10-03 02:30:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2019-10-03 02:30:52,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9350 transitions. [2019-10-03 02:30:52,023 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9350 transitions. Word has length 27 [2019-10-03 02:30:52,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:52,023 INFO L475 AbstractCegarLoop]: Abstraction has 7304 states and 9350 transitions. [2019-10-03 02:30:52,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:52,024 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9350 transitions. [2019-10-03 02:30:52,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-03 02:30:52,033 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:52,034 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:30:52,034 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:52,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:52,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1883988372, now seen corresponding path program 1 times [2019-10-03 02:30:52,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:52,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:52,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:52,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:52,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:52,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:52,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:52,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:52,061 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:52,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:52,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:52,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:52,062 INFO L87 Difference]: Start difference. First operand 7304 states and 9350 transitions. Second operand 3 states. [2019-10-03 02:30:52,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:52,110 INFO L93 Difference]: Finished difference Result 8074 states and 10503 transitions. [2019-10-03 02:30:52,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:52,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-03 02:30:52,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:52,131 INFO L225 Difference]: With dead ends: 8074 [2019-10-03 02:30:52,131 INFO L226 Difference]: Without dead ends: 8074 [2019-10-03 02:30:52,132 INFO L640 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-10-03 02:30:52,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2019-10-03 02:30:52,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 7304. [2019-10-03 02:30:52,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2019-10-03 02:30:52,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9222 transitions. [2019-10-03 02:30:52,322 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9222 transitions. Word has length 27 [2019-10-03 02:30:52,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:52,322 INFO L475 AbstractCegarLoop]: Abstraction has 7304 states and 9222 transitions. [2019-10-03 02:30:52,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:52,322 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9222 transitions. [2019-10-03 02:30:52,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-03 02:30:52,333 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:52,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:30:52,334 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:52,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:52,334 INFO L82 PathProgramCache]: Analyzing trace with hash 715001129, now seen corresponding path program 1 times [2019-10-03 02:30:52,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:52,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:52,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:52,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:52,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:52,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:52,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:52,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:52,353 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:52,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:52,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:52,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:52,354 INFO L87 Difference]: Start difference. First operand 7304 states and 9222 transitions. Second operand 3 states. [2019-10-03 02:30:52,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:52,403 INFO L93 Difference]: Finished difference Result 12170 states and 15239 transitions. [2019-10-03 02:30:52,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:52,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-03 02:30:52,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:52,433 INFO L225 Difference]: With dead ends: 12170 [2019-10-03 02:30:52,433 INFO L226 Difference]: Without dead ends: 12170 [2019-10-03 02:30:52,439 INFO L640 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-10-03 02:30:52,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2019-10-03 02:30:52,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 11144. [2019-10-03 02:30:52,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2019-10-03 02:30:52,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 13702 transitions. [2019-10-03 02:30:52,674 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 13702 transitions. Word has length 28 [2019-10-03 02:30:52,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:52,674 INFO L475 AbstractCegarLoop]: Abstraction has 11144 states and 13702 transitions. [2019-10-03 02:30:52,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:52,674 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 13702 transitions. [2019-10-03 02:30:52,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-03 02:30:52,693 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:52,693 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:30:52,693 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:52,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:52,694 INFO L82 PathProgramCache]: Analyzing trace with hash 128195115, now seen corresponding path program 1 times [2019-10-03 02:30:52,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:52,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:52,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:52,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:52,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:52,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-10-03 02:30:52,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:52,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:52,716 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:52,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:52,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:52,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:52,718 INFO L87 Difference]: Start difference. First operand 11144 states and 13702 transitions. Second operand 3 states. [2019-10-03 02:30:52,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:52,775 INFO L93 Difference]: Finished difference Result 14218 states and 16903 transitions. [2019-10-03 02:30:52,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:52,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-03 02:30:52,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:52,806 INFO L225 Difference]: With dead ends: 14218 [2019-10-03 02:30:52,806 INFO L226 Difference]: Without dead ends: 14218 [2019-10-03 02:30:52,807 INFO L640 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-10-03 02:30:52,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2019-10-03 02:30:53,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 14216. [2019-10-03 02:30:53,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2019-10-03 02:30:53,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 16902 transitions. [2019-10-03 02:30:53,104 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 16902 transitions. Word has length 28 [2019-10-03 02:30:53,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:53,104 INFO L475 AbstractCegarLoop]: Abstraction has 14216 states and 16902 transitions. [2019-10-03 02:30:53,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:53,104 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 16902 transitions. [2019-10-03 02:30:53,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-03 02:30:53,125 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:53,125 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:30:53,125 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:53,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:53,126 INFO L82 PathProgramCache]: Analyzing trace with hash 690414627, now seen corresponding path program 1 times [2019-10-03 02:30:53,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:53,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:53,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:53,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:53,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:53,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:53,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:53,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:53,148 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:53,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:53,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:53,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:53,149 INFO L87 Difference]: Start difference. First operand 14216 states and 16902 transitions. Second operand 3 states. [2019-10-03 02:30:53,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:53,203 INFO L93 Difference]: Finished difference Result 14602 states and 17159 transitions. [2019-10-03 02:30:53,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:53,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-03 02:30:53,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:53,232 INFO L225 Difference]: With dead ends: 14602 [2019-10-03 02:30:53,232 INFO L226 Difference]: Without dead ends: 14602 [2019-10-03 02:30:53,232 INFO L640 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-10-03 02:30:53,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14602 states. [2019-10-03 02:30:53,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14602 to 14600. [2019-10-03 02:30:53,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2019-10-03 02:30:53,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 17158 transitions. [2019-10-03 02:30:53,429 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 17158 transitions. Word has length 29 [2019-10-03 02:30:53,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:53,429 INFO L475 AbstractCegarLoop]: Abstraction has 14600 states and 17158 transitions. [2019-10-03 02:30:53,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:53,429 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 17158 transitions. [2019-10-03 02:30:53,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-03 02:30:53,451 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:53,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:30:53,452 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:53,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:53,456 INFO L82 PathProgramCache]: Analyzing trace with hash -320702623, now seen corresponding path program 1 times [2019-10-03 02:30:53,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:53,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:53,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:53,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:53,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:53,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:53,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:53,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:53,479 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:53,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:53,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:53,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:53,480 INFO L87 Difference]: Start difference. First operand 14600 states and 17158 transitions. Second operand 3 states. [2019-10-03 02:30:53,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:53,990 INFO L93 Difference]: Finished difference Result 23560 states and 26886 transitions. [2019-10-03 02:30:53,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:53,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-03 02:30:53,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:54,034 INFO L225 Difference]: With dead ends: 23560 [2019-10-03 02:30:54,034 INFO L226 Difference]: Without dead ends: 23560 [2019-10-03 02:30:54,035 INFO L640 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-10-03 02:30:54,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23560 states. [2019-10-03 02:30:54,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23560 to 22536. [2019-10-03 02:30:54,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22536 states. [2019-10-03 02:30:54,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22536 states to 22536 states and 25862 transitions. [2019-10-03 02:30:54,322 INFO L78 Accepts]: Start accepts. Automaton has 22536 states and 25862 transitions. Word has length 29 [2019-10-03 02:30:54,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:54,323 INFO L475 AbstractCegarLoop]: Abstraction has 22536 states and 25862 transitions. [2019-10-03 02:30:54,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:54,323 INFO L276 IsEmpty]: Start isEmpty. Operand 22536 states and 25862 transitions. [2019-10-03 02:30:54,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-03 02:30:54,359 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:30:54,359 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:30:54,359 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:30:54,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:30:54,360 INFO L82 PathProgramCache]: Analyzing trace with hash -907508637, now seen corresponding path program 1 times [2019-10-03 02:30:54,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:30:54,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:54,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:30:54,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:30:54,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:30:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:30:54,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:30:54,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:30:54,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:30:54,381 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:30:54,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:30:54,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:30:54,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:30:54,382 INFO L87 Difference]: Start difference. First operand 22536 states and 25862 transitions. Second operand 3 states. [2019-10-03 02:30:54,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:30:54,459 INFO L93 Difference]: Finished difference Result 28166 states and 30725 transitions. [2019-10-03 02:30:54,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:30:54,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-03 02:30:54,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:30:54,460 INFO L225 Difference]: With dead ends: 28166 [2019-10-03 02:30:54,460 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:30:54,461 INFO L640 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-10-03 02:30:54,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:30:54,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:30:54,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:30:54,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:30:54,462 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-10-03 02:30:54,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:30:54,462 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:30:54,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:30:54,462 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:30:54,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:30:54,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:30:54 BoogieIcfgContainer [2019-10-03 02:30:54,469 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:30:54,473 INFO L168 Benchmark]: Toolchain (without parser) took 6573.33 ms. Allocated memory was 133.2 MB in the beginning and 437.8 MB in the end (delta: 304.6 MB). Free memory was 88.1 MB in the beginning and 176.9 MB in the end (delta: -88.8 MB). Peak memory consumption was 215.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:30:54,474 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 133.2 MB. Free memory was 106.1 MB in the beginning and 105.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:30:54,476 INFO L168 Benchmark]: CACSL2BoogieTranslator took 534.40 ms. Allocated memory was 133.2 MB in the beginning and 201.3 MB in the end (delta: 68.2 MB). Free memory was 87.9 MB in the beginning and 178.8 MB in the end (delta: -91.0 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:30:54,479 INFO L168 Benchmark]: Boogie Preprocessor took 49.34 ms. Allocated memory is still 201.3 MB. Free memory was 178.8 MB in the beginning and 176.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:30:54,482 INFO L168 Benchmark]: RCFGBuilder took 543.52 ms. Allocated memory is still 201.3 MB. Free memory was 176.0 MB in the beginning and 157.5 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:30:54,483 INFO L168 Benchmark]: TraceAbstraction took 5437.44 ms. Allocated memory was 201.3 MB in the beginning and 437.8 MB in the end (delta: 236.5 MB). Free memory was 156.9 MB in the beginning and 176.9 MB in the end (delta: -20.0 MB). Peak memory consumption was 216.5 MB. Max. memory is 7.1 GB. [2019-10-03 02:30:54,489 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.37 ms. Allocated memory is still 133.2 MB. Free memory was 106.1 MB in the beginning and 105.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 534.40 ms. Allocated memory was 133.2 MB in the beginning and 201.3 MB in the end (delta: 68.2 MB). Free memory was 87.9 MB in the beginning and 178.8 MB in the end (delta: -91.0 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.34 ms. Allocated memory is still 201.3 MB. Free memory was 178.8 MB in the beginning and 176.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 543.52 ms. Allocated memory is still 201.3 MB. Free memory was 176.0 MB in the beginning and 157.5 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5437.44 ms. Allocated memory was 201.3 MB in the beginning and 437.8 MB in the end (delta: 236.5 MB). Free memory was 156.9 MB in the beginning and 176.9 MB in the end (delta: -20.0 MB). Peak memory consumption was 216.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 1 error locations. SAFE Result, 5.3s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2384 SDtfs, 1153 SDslu, 1624 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22536occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 659 ConstructedInterpolants, 0 QuantifiedInterpolants, 31265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...