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_11.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:49:22,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:49:22,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:49:23,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:49:23,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:49:23,008 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:49:23,010 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:49:23,019 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:49:23,021 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:49:23,021 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:49:23,023 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:49:23,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:49:23,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:49:23,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:49:23,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:49:23,031 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:49:23,032 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:49:23,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:49:23,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:49:23,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:49:23,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:49:23,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:49:23,049 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:49:23,050 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:49:23,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:49:23,052 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:49:23,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:49:23,053 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:49:23,054 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:49:23,055 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:49:23,055 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:49:23,056 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:49:23,056 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:49:23,057 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:49:23,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:49:23,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:49:23,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:49:23,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:49:23,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:49:23,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:49:23,061 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:49:23,061 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 05:49:23,076 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:49:23,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:49:23,077 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:49:23,077 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:49:23,078 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:49:23,078 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:49:23,078 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:49:23,079 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:49:23,079 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:49:23,079 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:49:23,080 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:49:23,080 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:49:23,080 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:49:23,080 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:49:23,080 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:49:23,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:49:23,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:49:23,081 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:49:23,081 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:49:23,081 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:49:23,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:49:23,082 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:49:23,082 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:49:23,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:49:23,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:49:23,083 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:49:23,083 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:49:23,083 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:49:23,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:49:23,083 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:49:23,117 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:49:23,129 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:49:23,139 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:49:23,140 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:49:23,140 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:49:23,141 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_11.c [2019-09-09 05:49:23,212 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33bc958f8/12b94047a0084abaaeb7853c5c95ec72/FLAGa19aed930 [2019-09-09 05:49:23,678 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:49:23,679 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11.c [2019-09-09 05:49:23,688 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33bc958f8/12b94047a0084abaaeb7853c5c95ec72/FLAGa19aed930 [2019-09-09 05:49:24,077 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33bc958f8/12b94047a0084abaaeb7853c5c95ec72 [2019-09-09 05:49:24,086 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:49:24,087 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:49:24,089 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:49:24,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:49:24,092 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:49:24,093 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:49:24" (1/1) ... [2019-09-09 05:49:24,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2243a972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:24, skipping insertion in model container [2019-09-09 05:49:24,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:49:24" (1/1) ... [2019-09-09 05:49:24,104 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:49:24,127 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:49:24,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:49:24,288 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:49:24,316 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:49:24,419 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:49:24,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:24 WrapperNode [2019-09-09 05:49:24,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:49:24,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:49:24,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:49:24,421 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:49:24,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:24" (1/1) ... [2019-09-09 05:49:24,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:24" (1/1) ... [2019-09-09 05:49:24,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:24" (1/1) ... [2019-09-09 05:49:24,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:24" (1/1) ... [2019-09-09 05:49:24,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:24" (1/1) ... [2019-09-09 05:49:24,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:24" (1/1) ... [2019-09-09 05:49:24,458 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:24" (1/1) ... [2019-09-09 05:49:24,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:49:24,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:49:24,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:49:24,461 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:49:24,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:49:24,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:49:24,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:49:24,512 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:49:24,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:49:24,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 05:49:24,513 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:49:24,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:49:24,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:49:24,857 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:49:24,858 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 05:49:24,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:49:24 BoogieIcfgContainer [2019-09-09 05:49:24,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:49:24,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:49:24,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:49:24,863 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:49:24,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:49:24" (1/3) ... [2019-09-09 05:49:24,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a00d3e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:49:24, skipping insertion in model container [2019-09-09 05:49:24,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:49:24" (2/3) ... [2019-09-09 05:49:24,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a00d3e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:49:24, skipping insertion in model container [2019-09-09 05:49:24,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:49:24" (3/3) ... [2019-09-09 05:49:24,867 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2019-09-09 05:49:24,878 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:49:24,899 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:49:24,916 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:49:24,944 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:49:24,944 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:49:24,944 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:49:24,944 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:49:24,944 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:49:24,945 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:49:24,945 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:49:24,945 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:49:24,962 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-09-09 05:49:24,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-09 05:49:24,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:24,973 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:24,975 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:24,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:24,981 INFO L82 PathProgramCache]: Analyzing trace with hash -316470182, now seen corresponding path program 1 times [2019-09-09 05:49:24,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:25,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:25,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:25,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:25,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:25,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:25,174 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:25,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:25,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:25,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,194 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2019-09-09 05:49:25,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:25,251 INFO L93 Difference]: Finished difference Result 86 states and 149 transitions. [2019-09-09 05:49:25,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:25,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-09 05:49:25,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:25,268 INFO L225 Difference]: With dead ends: 86 [2019-09-09 05:49:25,268 INFO L226 Difference]: Without dead ends: 78 [2019-09-09 05:49:25,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-09 05:49:25,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2019-09-09 05:49:25,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-09 05:49:25,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2019-09-09 05:49:25,312 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 21 [2019-09-09 05:49:25,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:25,313 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2019-09-09 05:49:25,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:25,315 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2019-09-09 05:49:25,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-09 05:49:25,316 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:25,316 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:25,317 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:25,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:25,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1327587432, now seen corresponding path program 1 times [2019-09-09 05:49:25,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:25,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:25,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:25,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:25,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:25,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:25,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:25,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:25,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:25,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,404 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2019-09-09 05:49:25,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:25,436 INFO L93 Difference]: Finished difference Result 78 states and 138 transitions. [2019-09-09 05:49:25,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:25,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-09 05:49:25,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:25,439 INFO L225 Difference]: With dead ends: 78 [2019-09-09 05:49:25,439 INFO L226 Difference]: Without dead ends: 78 [2019-09-09 05:49:25,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-09 05:49:25,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-09-09 05:49:25,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-09-09 05:49:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 137 transitions. [2019-09-09 05:49:25,455 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 137 transitions. Word has length 21 [2019-09-09 05:49:25,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:25,455 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 137 transitions. [2019-09-09 05:49:25,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:25,456 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 137 transitions. [2019-09-09 05:49:25,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-09 05:49:25,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:25,457 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:25,458 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:25,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:25,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1220427994, now seen corresponding path program 1 times [2019-09-09 05:49:25,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:25,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:25,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:25,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:25,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:25,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:25,541 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:25,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:25,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:25,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,542 INFO L87 Difference]: Start difference. First operand 76 states and 137 transitions. Second operand 3 states. [2019-09-09 05:49:25,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:25,575 INFO L93 Difference]: Finished difference Result 81 states and 140 transitions. [2019-09-09 05:49:25,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:25,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-09 05:49:25,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:25,578 INFO L225 Difference]: With dead ends: 81 [2019-09-09 05:49:25,578 INFO L226 Difference]: Without dead ends: 81 [2019-09-09 05:49:25,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-09 05:49:25,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2019-09-09 05:49:25,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-09 05:49:25,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 139 transitions. [2019-09-09 05:49:25,591 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 139 transitions. Word has length 22 [2019-09-09 05:49:25,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:25,592 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 139 transitions. [2019-09-09 05:49:25,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:25,592 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2019-09-09 05:49:25,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-09 05:49:25,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:25,594 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:25,594 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:25,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:25,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1794675624, now seen corresponding path program 1 times [2019-09-09 05:49:25,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:25,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:25,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:25,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:25,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:25,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:25,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:25,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:25,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:25,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,630 INFO L87 Difference]: Start difference. First operand 79 states and 139 transitions. Second operand 3 states. [2019-09-09 05:49:25,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:25,652 INFO L93 Difference]: Finished difference Result 146 states and 261 transitions. [2019-09-09 05:49:25,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:25,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-09 05:49:25,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:25,655 INFO L225 Difference]: With dead ends: 146 [2019-09-09 05:49:25,655 INFO L226 Difference]: Without dead ends: 146 [2019-09-09 05:49:25,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-09 05:49:25,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2019-09-09 05:49:25,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-09 05:49:25,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 184 transitions. [2019-09-09 05:49:25,671 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 184 transitions. Word has length 22 [2019-09-09 05:49:25,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:25,671 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 184 transitions. [2019-09-09 05:49:25,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:25,671 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 184 transitions. [2019-09-09 05:49:25,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-09 05:49:25,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:25,675 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:25,675 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:25,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:25,677 INFO L82 PathProgramCache]: Analyzing trace with hash 783558374, now seen corresponding path program 1 times [2019-09-09 05:49:25,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:25,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:25,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:25,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:25,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:25,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:25,721 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:25,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:25,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:25,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,723 INFO L87 Difference]: Start difference. First operand 104 states and 184 transitions. Second operand 3 states. [2019-09-09 05:49:25,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:25,745 INFO L93 Difference]: Finished difference Result 148 states and 259 transitions. [2019-09-09 05:49:25,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:25,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-09-09 05:49:25,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:25,748 INFO L225 Difference]: With dead ends: 148 [2019-09-09 05:49:25,748 INFO L226 Difference]: Without dead ends: 148 [2019-09-09 05:49:25,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-09-09 05:49:25,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2019-09-09 05:49:25,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-09 05:49:25,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 258 transitions. [2019-09-09 05:49:25,760 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 258 transitions. Word has length 22 [2019-09-09 05:49:25,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:25,761 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 258 transitions. [2019-09-09 05:49:25,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:25,761 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 258 transitions. [2019-09-09 05:49:25,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-09 05:49:25,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:25,763 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:25,763 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:25,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:25,764 INFO L82 PathProgramCache]: Analyzing trace with hash -199417107, now seen corresponding path program 1 times [2019-09-09 05:49:25,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:25,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:25,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:25,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:25,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:25,799 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:25,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:25,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:25,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,801 INFO L87 Difference]: Start difference. First operand 146 states and 258 transitions. Second operand 3 states. [2019-09-09 05:49:25,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:25,821 INFO L93 Difference]: Finished difference Result 150 states and 259 transitions. [2019-09-09 05:49:25,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:25,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-09 05:49:25,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:25,826 INFO L225 Difference]: With dead ends: 150 [2019-09-09 05:49:25,826 INFO L226 Difference]: Without dead ends: 150 [2019-09-09 05:49:25,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-09 05:49:25,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-09-09 05:49:25,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-09 05:49:25,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 258 transitions. [2019-09-09 05:49:25,837 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 258 transitions. Word has length 23 [2019-09-09 05:49:25,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:25,838 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 258 transitions. [2019-09-09 05:49:25,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:25,838 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 258 transitions. [2019-09-09 05:49:25,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-09 05:49:25,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:25,840 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:25,840 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:25,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:25,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1479280785, now seen corresponding path program 1 times [2019-09-09 05:49:25,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:25,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:25,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:25,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:25,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:25,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:25,877 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:25,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:25,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:25,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,879 INFO L87 Difference]: Start difference. First operand 148 states and 258 transitions. Second operand 3 states. [2019-09-09 05:49:25,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:25,899 INFO L93 Difference]: Finished difference Result 274 states and 483 transitions. [2019-09-09 05:49:25,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:25,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-09 05:49:25,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:25,902 INFO L225 Difference]: With dead ends: 274 [2019-09-09 05:49:25,902 INFO L226 Difference]: Without dead ends: 274 [2019-09-09 05:49:25,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-09-09 05:49:25,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 200. [2019-09-09 05:49:25,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-09 05:49:25,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 346 transitions. [2019-09-09 05:49:25,916 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 346 transitions. Word has length 23 [2019-09-09 05:49:25,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:25,916 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 346 transitions. [2019-09-09 05:49:25,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:25,917 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 346 transitions. [2019-09-09 05:49:25,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-09 05:49:25,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:25,919 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:25,919 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:25,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:25,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1804569261, now seen corresponding path program 1 times [2019-09-09 05:49:25,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:25,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:25,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:25,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:25,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:25,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:25,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:25,993 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:25,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:25,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:25,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:25,995 INFO L87 Difference]: Start difference. First operand 200 states and 346 transitions. Second operand 3 states. [2019-09-09 05:49:26,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:26,020 INFO L93 Difference]: Finished difference Result 282 states and 483 transitions. [2019-09-09 05:49:26,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:26,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-09 05:49:26,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:26,022 INFO L225 Difference]: With dead ends: 282 [2019-09-09 05:49:26,023 INFO L226 Difference]: Without dead ends: 282 [2019-09-09 05:49:26,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-09 05:49:26,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2019-09-09 05:49:26,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-09 05:49:26,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 482 transitions. [2019-09-09 05:49:26,036 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 482 transitions. Word has length 23 [2019-09-09 05:49:26,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:26,037 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 482 transitions. [2019-09-09 05:49:26,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:26,037 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 482 transitions. [2019-09-09 05:49:26,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-09 05:49:26,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:26,046 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:26,046 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:26,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:26,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1387149659, now seen corresponding path program 1 times [2019-09-09 05:49:26,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:26,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:26,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:26,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:26,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:26,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:26,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:26,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:26,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:26,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,083 INFO L87 Difference]: Start difference. First operand 280 states and 482 transitions. Second operand 3 states. [2019-09-09 05:49:26,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:26,097 INFO L93 Difference]: Finished difference Result 286 states and 483 transitions. [2019-09-09 05:49:26,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:26,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-09 05:49:26,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:26,099 INFO L225 Difference]: With dead ends: 286 [2019-09-09 05:49:26,100 INFO L226 Difference]: Without dead ends: 286 [2019-09-09 05:49:26,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-09 05:49:26,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2019-09-09 05:49:26,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-09-09 05:49:26,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 482 transitions. [2019-09-09 05:49:26,112 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 482 transitions. Word has length 24 [2019-09-09 05:49:26,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:26,112 INFO L475 AbstractCegarLoop]: Abstraction has 284 states and 482 transitions. [2019-09-09 05:49:26,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:26,113 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 482 transitions. [2019-09-09 05:49:26,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-09 05:49:26,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:26,114 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:26,115 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:26,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:26,115 INFO L82 PathProgramCache]: Analyzing trace with hash 107285981, now seen corresponding path program 1 times [2019-09-09 05:49:26,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:26,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:26,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:26,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:26,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:26,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:26,173 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:26,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:26,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:26,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,175 INFO L87 Difference]: Start difference. First operand 284 states and 482 transitions. Second operand 3 states. [2019-09-09 05:49:26,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:26,195 INFO L93 Difference]: Finished difference Result 522 states and 895 transitions. [2019-09-09 05:49:26,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:26,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-09 05:49:26,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:26,200 INFO L225 Difference]: With dead ends: 522 [2019-09-09 05:49:26,200 INFO L226 Difference]: Without dead ends: 522 [2019-09-09 05:49:26,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-09-09 05:49:26,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 392. [2019-09-09 05:49:26,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-09-09 05:49:26,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 654 transitions. [2019-09-09 05:49:26,222 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 654 transitions. Word has length 24 [2019-09-09 05:49:26,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:26,227 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 654 transitions. [2019-09-09 05:49:26,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:26,227 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 654 transitions. [2019-09-09 05:49:26,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-09 05:49:26,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:26,229 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:26,229 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:26,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:26,230 INFO L82 PathProgramCache]: Analyzing trace with hash -903831269, now seen corresponding path program 1 times [2019-09-09 05:49:26,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:26,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:26,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:26,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:26,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:26,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:26,266 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:26,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:26,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:26,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,267 INFO L87 Difference]: Start difference. First operand 392 states and 654 transitions. Second operand 3 states. [2019-09-09 05:49:26,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:26,289 INFO L93 Difference]: Finished difference Result 546 states and 903 transitions. [2019-09-09 05:49:26,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:26,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-09 05:49:26,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:26,293 INFO L225 Difference]: With dead ends: 546 [2019-09-09 05:49:26,293 INFO L226 Difference]: Without dead ends: 546 [2019-09-09 05:49:26,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-09-09 05:49:26,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2019-09-09 05:49:26,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-09-09 05:49:26,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 902 transitions. [2019-09-09 05:49:26,309 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 902 transitions. Word has length 24 [2019-09-09 05:49:26,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:26,310 INFO L475 AbstractCegarLoop]: Abstraction has 544 states and 902 transitions. [2019-09-09 05:49:26,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:26,310 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 902 transitions. [2019-09-09 05:49:26,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-09 05:49:26,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:26,313 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:26,314 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:26,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:26,314 INFO L82 PathProgramCache]: Analyzing trace with hash -968887806, now seen corresponding path program 1 times [2019-09-09 05:49:26,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:26,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:26,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:26,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:26,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:26,346 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:26,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:26,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:26,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,347 INFO L87 Difference]: Start difference. First operand 544 states and 902 transitions. Second operand 3 states. [2019-09-09 05:49:26,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:26,362 INFO L93 Difference]: Finished difference Result 554 states and 903 transitions. [2019-09-09 05:49:26,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:26,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-09 05:49:26,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:26,366 INFO L225 Difference]: With dead ends: 554 [2019-09-09 05:49:26,366 INFO L226 Difference]: Without dead ends: 554 [2019-09-09 05:49:26,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-09-09 05:49:26,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2019-09-09 05:49:26,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-09-09 05:49:26,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 902 transitions. [2019-09-09 05:49:26,382 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 902 transitions. Word has length 25 [2019-09-09 05:49:26,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:26,382 INFO L475 AbstractCegarLoop]: Abstraction has 552 states and 902 transitions. [2019-09-09 05:49:26,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:26,382 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 902 transitions. [2019-09-09 05:49:26,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-09 05:49:26,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:26,383 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:26,384 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:26,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:26,384 INFO L82 PathProgramCache]: Analyzing trace with hash 2046215812, now seen corresponding path program 1 times [2019-09-09 05:49:26,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:26,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:26,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:26,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:26,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:26,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:26,405 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:26,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:26,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:26,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,406 INFO L87 Difference]: Start difference. First operand 552 states and 902 transitions. Second operand 3 states. [2019-09-09 05:49:26,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:26,425 INFO L93 Difference]: Finished difference Result 1002 states and 1655 transitions. [2019-09-09 05:49:26,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:26,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-09 05:49:26,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:26,431 INFO L225 Difference]: With dead ends: 1002 [2019-09-09 05:49:26,431 INFO L226 Difference]: Without dead ends: 1002 [2019-09-09 05:49:26,432 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-09-09 05:49:26,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 776. [2019-09-09 05:49:26,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-09-09 05:49:26,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1238 transitions. [2019-09-09 05:49:26,453 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1238 transitions. Word has length 25 [2019-09-09 05:49:26,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:26,453 INFO L475 AbstractCegarLoop]: Abstraction has 776 states and 1238 transitions. [2019-09-09 05:49:26,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:26,453 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1238 transitions. [2019-09-09 05:49:26,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-09 05:49:26,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:26,455 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:26,455 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:26,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:26,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1035098562, now seen corresponding path program 1 times [2019-09-09 05:49:26,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:26,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:26,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:26,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:26,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:26,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:26,482 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:26,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:26,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:26,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,483 INFO L87 Difference]: Start difference. First operand 776 states and 1238 transitions. Second operand 3 states. [2019-09-09 05:49:26,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:26,503 INFO L93 Difference]: Finished difference Result 1066 states and 1687 transitions. [2019-09-09 05:49:26,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:26,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-09 05:49:26,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:26,509 INFO L225 Difference]: With dead ends: 1066 [2019-09-09 05:49:26,509 INFO L226 Difference]: Without dead ends: 1066 [2019-09-09 05:49:26,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2019-09-09 05:49:26,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1064. [2019-09-09 05:49:26,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2019-09-09 05:49:26,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1686 transitions. [2019-09-09 05:49:26,536 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1686 transitions. Word has length 25 [2019-09-09 05:49:26,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:26,537 INFO L475 AbstractCegarLoop]: Abstraction has 1064 states and 1686 transitions. [2019-09-09 05:49:26,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:26,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1686 transitions. [2019-09-09 05:49:26,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-09 05:49:26,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:26,540 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:26,540 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:26,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:26,540 INFO L82 PathProgramCache]: Analyzing trace with hash -991604848, now seen corresponding path program 1 times [2019-09-09 05:49:26,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:26,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:26,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:26,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:26,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:26,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:26,564 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:26,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:26,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:26,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,565 INFO L87 Difference]: Start difference. First operand 1064 states and 1686 transitions. Second operand 3 states. [2019-09-09 05:49:26,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:26,583 INFO L93 Difference]: Finished difference Result 1082 states and 1687 transitions. [2019-09-09 05:49:26,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:26,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-09 05:49:26,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:26,589 INFO L225 Difference]: With dead ends: 1082 [2019-09-09 05:49:26,589 INFO L226 Difference]: Without dead ends: 1082 [2019-09-09 05:49:26,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2019-09-09 05:49:26,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1080. [2019-09-09 05:49:26,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2019-09-09 05:49:26,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1686 transitions. [2019-09-09 05:49:26,620 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1686 transitions. Word has length 26 [2019-09-09 05:49:26,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:26,622 INFO L475 AbstractCegarLoop]: Abstraction has 1080 states and 1686 transitions. [2019-09-09 05:49:26,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:26,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1686 transitions. [2019-09-09 05:49:26,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-09 05:49:26,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:26,624 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:26,624 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:26,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:26,625 INFO L82 PathProgramCache]: Analyzing trace with hash 2023498770, now seen corresponding path program 1 times [2019-09-09 05:49:26,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:26,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:26,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:26,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:26,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:26,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:26,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:26,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:26,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:26,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,658 INFO L87 Difference]: Start difference. First operand 1080 states and 1686 transitions. Second operand 3 states. [2019-09-09 05:49:26,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:26,682 INFO L93 Difference]: Finished difference Result 1930 states and 3047 transitions. [2019-09-09 05:49:26,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:26,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-09 05:49:26,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:26,692 INFO L225 Difference]: With dead ends: 1930 [2019-09-09 05:49:26,693 INFO L226 Difference]: Without dead ends: 1930 [2019-09-09 05:49:26,693 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2019-09-09 05:49:26,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1544. [2019-09-09 05:49:26,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-09-09 05:49:26,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2342 transitions. [2019-09-09 05:49:26,755 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2342 transitions. Word has length 26 [2019-09-09 05:49:26,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:26,755 INFO L475 AbstractCegarLoop]: Abstraction has 1544 states and 2342 transitions. [2019-09-09 05:49:26,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:26,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2342 transitions. [2019-09-09 05:49:26,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-09 05:49:26,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:26,758 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:26,759 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:26,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:26,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1012381520, now seen corresponding path program 1 times [2019-09-09 05:49:26,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:26,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:26,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:26,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:26,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:26,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:26,790 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:26,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:26,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:26,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,791 INFO L87 Difference]: Start difference. First operand 1544 states and 2342 transitions. Second operand 3 states. [2019-09-09 05:49:26,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:26,823 INFO L93 Difference]: Finished difference Result 2090 states and 3143 transitions. [2019-09-09 05:49:26,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:26,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-09 05:49:26,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:26,837 INFO L225 Difference]: With dead ends: 2090 [2019-09-09 05:49:26,838 INFO L226 Difference]: Without dead ends: 2090 [2019-09-09 05:49:26,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2019-09-09 05:49:26,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2088. [2019-09-09 05:49:26,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2019-09-09 05:49:26,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 3142 transitions. [2019-09-09 05:49:26,907 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 3142 transitions. Word has length 26 [2019-09-09 05:49:26,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:26,908 INFO L475 AbstractCegarLoop]: Abstraction has 2088 states and 3142 transitions. [2019-09-09 05:49:26,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:26,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3142 transitions. [2019-09-09 05:49:26,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-09 05:49:26,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:26,912 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:26,912 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:26,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:26,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1695832809, now seen corresponding path program 1 times [2019-09-09 05:49:26,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:26,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:26,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:26,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:26,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:26,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:26,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:26,933 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:26,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:26,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:26,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,934 INFO L87 Difference]: Start difference. First operand 2088 states and 3142 transitions. Second operand 3 states. [2019-09-09 05:49:26,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:26,970 INFO L93 Difference]: Finished difference Result 2122 states and 3143 transitions. [2019-09-09 05:49:26,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:26,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-09 05:49:26,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:26,981 INFO L225 Difference]: With dead ends: 2122 [2019-09-09 05:49:26,982 INFO L226 Difference]: Without dead ends: 2122 [2019-09-09 05:49:26,982 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:26,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2019-09-09 05:49:27,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2120. [2019-09-09 05:49:27,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2120 states. [2019-09-09 05:49:27,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 3142 transitions. [2019-09-09 05:49:27,051 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 3142 transitions. Word has length 27 [2019-09-09 05:49:27,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:27,052 INFO L475 AbstractCegarLoop]: Abstraction has 2120 states and 3142 transitions. [2019-09-09 05:49:27,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:27,052 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 3142 transitions. [2019-09-09 05:49:27,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-09 05:49:27,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:27,057 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:27,057 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:27,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:27,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1319270809, now seen corresponding path program 1 times [2019-09-09 05:49:27,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:27,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:27,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:27,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:27,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:27,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:27,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:27,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:27,099 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:27,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:27,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:27,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:27,101 INFO L87 Difference]: Start difference. First operand 2120 states and 3142 transitions. Second operand 3 states. [2019-09-09 05:49:27,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:27,145 INFO L93 Difference]: Finished difference Result 3722 states and 5575 transitions. [2019-09-09 05:49:27,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:27,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-09 05:49:27,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:27,169 INFO L225 Difference]: With dead ends: 3722 [2019-09-09 05:49:27,169 INFO L226 Difference]: Without dead ends: 3722 [2019-09-09 05:49:27,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:27,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2019-09-09 05:49:27,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3080. [2019-09-09 05:49:27,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2019-09-09 05:49:27,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 4422 transitions. [2019-09-09 05:49:27,263 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 4422 transitions. Word has length 27 [2019-09-09 05:49:27,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:27,263 INFO L475 AbstractCegarLoop]: Abstraction has 3080 states and 4422 transitions. [2019-09-09 05:49:27,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:27,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 4422 transitions. [2019-09-09 05:49:27,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-09 05:49:27,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:27,271 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:27,272 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:27,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:27,273 INFO L82 PathProgramCache]: Analyzing trace with hash 308153559, now seen corresponding path program 1 times [2019-09-09 05:49:27,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:27,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:27,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:27,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:27,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:27,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:27,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:27,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:27,294 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:27,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:27,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:27,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:27,295 INFO L87 Difference]: Start difference. First operand 3080 states and 4422 transitions. Second operand 3 states. [2019-09-09 05:49:27,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:27,328 INFO L93 Difference]: Finished difference Result 4106 states and 5831 transitions. [2019-09-09 05:49:27,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:27,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-09 05:49:27,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:27,345 INFO L225 Difference]: With dead ends: 4106 [2019-09-09 05:49:27,346 INFO L226 Difference]: Without dead ends: 4106 [2019-09-09 05:49:27,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:27,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2019-09-09 05:49:27,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4104. [2019-09-09 05:49:27,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2019-09-09 05:49:27,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 5830 transitions. [2019-09-09 05:49:27,428 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 5830 transitions. Word has length 27 [2019-09-09 05:49:27,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:27,428 INFO L475 AbstractCegarLoop]: Abstraction has 4104 states and 5830 transitions. [2019-09-09 05:49:27,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:27,429 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 5830 transitions. [2019-09-09 05:49:27,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-09 05:49:27,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:27,435 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:27,435 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:27,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:27,436 INFO L82 PathProgramCache]: Analyzing trace with hash -2052062779, now seen corresponding path program 1 times [2019-09-09 05:49:27,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:27,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:27,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:27,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:27,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:27,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:27,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:27,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:27,487 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:27,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:27,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:27,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:27,488 INFO L87 Difference]: Start difference. First operand 4104 states and 5830 transitions. Second operand 3 states. [2019-09-09 05:49:27,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:27,517 INFO L93 Difference]: Finished difference Result 4170 states and 5831 transitions. [2019-09-09 05:49:27,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:27,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-09 05:49:27,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:27,559 INFO L225 Difference]: With dead ends: 4170 [2019-09-09 05:49:27,559 INFO L226 Difference]: Without dead ends: 4170 [2019-09-09 05:49:27,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:27,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2019-09-09 05:49:27,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4168. [2019-09-09 05:49:27,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4168 states. [2019-09-09 05:49:27,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5830 transitions. [2019-09-09 05:49:27,644 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5830 transitions. Word has length 28 [2019-09-09 05:49:27,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:27,645 INFO L475 AbstractCegarLoop]: Abstraction has 4168 states and 5830 transitions. [2019-09-09 05:49:27,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:27,645 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5830 transitions. [2019-09-09 05:49:27,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-09 05:49:27,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:27,650 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:27,650 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:27,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:27,651 INFO L82 PathProgramCache]: Analyzing trace with hash 963040839, now seen corresponding path program 1 times [2019-09-09 05:49:27,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:27,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:27,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:27,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:27,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:27,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:27,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:27,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:27,671 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:27,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:27,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:27,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:27,672 INFO L87 Difference]: Start difference. First operand 4168 states and 5830 transitions. Second operand 3 states. [2019-09-09 05:49:27,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:27,717 INFO L93 Difference]: Finished difference Result 8074 states and 10887 transitions. [2019-09-09 05:49:27,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:27,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-09 05:49:27,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:27,736 INFO L225 Difference]: With dead ends: 8074 [2019-09-09 05:49:27,736 INFO L226 Difference]: Without dead ends: 8074 [2019-09-09 05:49:27,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:27,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2019-09-09 05:49:27,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 8072. [2019-09-09 05:49:27,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2019-09-09 05:49:27,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10886 transitions. [2019-09-09 05:49:27,918 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10886 transitions. Word has length 28 [2019-09-09 05:49:27,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:27,919 INFO L475 AbstractCegarLoop]: Abstraction has 8072 states and 10886 transitions. [2019-09-09 05:49:27,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:27,919 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10886 transitions. [2019-09-09 05:49:27,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-09 05:49:27,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:27,931 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:27,931 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:27,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:27,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1974158089, now seen corresponding path program 1 times [2019-09-09 05:49:27,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:27,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:27,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:27,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:27,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:27,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:27,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:27,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:27,953 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:27,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:27,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:27,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:27,954 INFO L87 Difference]: Start difference. First operand 8072 states and 10886 transitions. Second operand 3 states. [2019-09-09 05:49:28,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:28,067 INFO L93 Difference]: Finished difference Result 9098 states and 12551 transitions. [2019-09-09 05:49:28,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:28,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-09 05:49:28,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:28,084 INFO L225 Difference]: With dead ends: 9098 [2019-09-09 05:49:28,085 INFO L226 Difference]: Without dead ends: 9098 [2019-09-09 05:49:28,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:28,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9098 states. [2019-09-09 05:49:28,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9098 to 8072. [2019-09-09 05:49:28,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2019-09-09 05:49:28,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10758 transitions. [2019-09-09 05:49:28,242 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10758 transitions. Word has length 28 [2019-09-09 05:49:28,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:28,242 INFO L475 AbstractCegarLoop]: Abstraction has 8072 states and 10758 transitions. [2019-09-09 05:49:28,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:28,242 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10758 transitions. [2019-09-09 05:49:28,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-09 05:49:28,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:28,260 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:28,260 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:28,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:28,261 INFO L82 PathProgramCache]: Analyzing trace with hash -210289620, now seen corresponding path program 1 times [2019-09-09 05:49:28,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:28,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:28,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:28,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:28,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:28,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:28,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:28,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:28,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:28,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:28,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:28,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:28,289 INFO L87 Difference]: Start difference. First operand 8072 states and 10758 transitions. Second operand 3 states. [2019-09-09 05:49:28,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:28,343 INFO L93 Difference]: Finished difference Result 13706 states and 18311 transitions. [2019-09-09 05:49:28,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:28,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-09 05:49:28,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:28,371 INFO L225 Difference]: With dead ends: 13706 [2019-09-09 05:49:28,371 INFO L226 Difference]: Without dead ends: 13706 [2019-09-09 05:49:28,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:28,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13706 states. [2019-09-09 05:49:28,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13706 to 12168. [2019-09-09 05:49:28,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12168 states. [2019-09-09 05:49:28,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12168 states to 12168 states and 15750 transitions. [2019-09-09 05:49:28,613 INFO L78 Accepts]: Start accepts. Automaton has 12168 states and 15750 transitions. Word has length 29 [2019-09-09 05:49:28,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:28,613 INFO L475 AbstractCegarLoop]: Abstraction has 12168 states and 15750 transitions. [2019-09-09 05:49:28,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:28,613 INFO L276 IsEmpty]: Start isEmpty. Operand 12168 states and 15750 transitions. [2019-09-09 05:49:28,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-09 05:49:28,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:28,636 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:28,636 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:28,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:28,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1221406870, now seen corresponding path program 1 times [2019-09-09 05:49:28,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:28,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:28,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:28,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:28,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:28,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:28,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:28,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:28,718 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:28,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:28,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:28,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:28,719 INFO L87 Difference]: Start difference. First operand 12168 states and 15750 transitions. Second operand 3 states. [2019-09-09 05:49:28,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:28,775 INFO L93 Difference]: Finished difference Result 15754 states and 19975 transitions. [2019-09-09 05:49:28,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:28,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-09 05:49:28,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:28,809 INFO L225 Difference]: With dead ends: 15754 [2019-09-09 05:49:28,810 INFO L226 Difference]: Without dead ends: 15754 [2019-09-09 05:49:28,810 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:28,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15754 states. [2019-09-09 05:49:29,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15754 to 15752. [2019-09-09 05:49:29,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15752 states. [2019-09-09 05:49:29,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15752 states to 15752 states and 19974 transitions. [2019-09-09 05:49:29,090 INFO L78 Accepts]: Start accepts. Automaton has 15752 states and 19974 transitions. Word has length 29 [2019-09-09 05:49:29,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:29,090 INFO L475 AbstractCegarLoop]: Abstraction has 15752 states and 19974 transitions. [2019-09-09 05:49:29,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:29,090 INFO L276 IsEmpty]: Start isEmpty. Operand 15752 states and 19974 transitions. [2019-09-09 05:49:29,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-09 05:49:29,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:29,112 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:29,113 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:29,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:29,113 INFO L82 PathProgramCache]: Analyzing trace with hash 2071172156, now seen corresponding path program 1 times [2019-09-09 05:49:29,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:29,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:29,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:29,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:29,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:29,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:29,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:29,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:29,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:29,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:29,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:29,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:29,137 INFO L87 Difference]: Start difference. First operand 15752 states and 19974 transitions. Second operand 3 states. [2019-09-09 05:49:29,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:29,192 INFO L93 Difference]: Finished difference Result 16138 states and 20231 transitions. [2019-09-09 05:49:29,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:29,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-09 05:49:29,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:29,221 INFO L225 Difference]: With dead ends: 16138 [2019-09-09 05:49:29,221 INFO L226 Difference]: Without dead ends: 16138 [2019-09-09 05:49:29,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:29,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16138 states. [2019-09-09 05:49:29,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16138 to 16136. [2019-09-09 05:49:29,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16136 states. [2019-09-09 05:49:29,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16136 states to 16136 states and 20230 transitions. [2019-09-09 05:49:29,507 INFO L78 Accepts]: Start accepts. Automaton has 16136 states and 20230 transitions. Word has length 30 [2019-09-09 05:49:29,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:29,507 INFO L475 AbstractCegarLoop]: Abstraction has 16136 states and 20230 transitions. [2019-09-09 05:49:29,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:29,507 INFO L276 IsEmpty]: Start isEmpty. Operand 16136 states and 20230 transitions. [2019-09-09 05:49:29,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-09 05:49:29,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:29,529 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:29,529 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:29,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:29,533 INFO L82 PathProgramCache]: Analyzing trace with hash 791308478, now seen corresponding path program 1 times [2019-09-09 05:49:29,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:29,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:29,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:29,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:29,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:29,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:29,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:29,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:29,554 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:29,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:29,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:29,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:29,555 INFO L87 Difference]: Start difference. First operand 16136 states and 20230 transitions. Second operand 3 states. [2019-09-09 05:49:29,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:29,629 INFO L93 Difference]: Finished difference Result 26634 states and 33031 transitions. [2019-09-09 05:49:29,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:29,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-09 05:49:29,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:29,680 INFO L225 Difference]: With dead ends: 26634 [2019-09-09 05:49:29,681 INFO L226 Difference]: Without dead ends: 26634 [2019-09-09 05:49:29,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:29,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26634 states. [2019-09-09 05:49:30,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26634 to 24584. [2019-09-09 05:49:30,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24584 states. [2019-09-09 05:49:30,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24584 states to 24584 states and 29958 transitions. [2019-09-09 05:49:30,562 INFO L78 Accepts]: Start accepts. Automaton has 24584 states and 29958 transitions. Word has length 30 [2019-09-09 05:49:30,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:30,563 INFO L475 AbstractCegarLoop]: Abstraction has 24584 states and 29958 transitions. [2019-09-09 05:49:30,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:30,563 INFO L276 IsEmpty]: Start isEmpty. Operand 24584 states and 29958 transitions. [2019-09-09 05:49:30,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-09 05:49:30,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:30,602 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:30,603 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:30,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:30,603 INFO L82 PathProgramCache]: Analyzing trace with hash -219808772, now seen corresponding path program 1 times [2019-09-09 05:49:30,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:30,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:30,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:30,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:30,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:30,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:30,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:30,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:30,623 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:30,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:30,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:30,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:30,624 INFO L87 Difference]: Start difference. First operand 24584 states and 29958 transitions. Second operand 3 states. [2019-09-09 05:49:30,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:30,713 INFO L93 Difference]: Finished difference Result 31242 states and 36871 transitions. [2019-09-09 05:49:30,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:30,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-09 05:49:30,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:30,766 INFO L225 Difference]: With dead ends: 31242 [2019-09-09 05:49:30,767 INFO L226 Difference]: Without dead ends: 31242 [2019-09-09 05:49:30,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:30,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31242 states. [2019-09-09 05:49:31,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31242 to 31240. [2019-09-09 05:49:31,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31240 states. [2019-09-09 05:49:31,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31240 states to 31240 states and 36870 transitions. [2019-09-09 05:49:31,261 INFO L78 Accepts]: Start accepts. Automaton has 31240 states and 36870 transitions. Word has length 30 [2019-09-09 05:49:31,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:31,261 INFO L475 AbstractCegarLoop]: Abstraction has 31240 states and 36870 transitions. [2019-09-09 05:49:31,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:31,262 INFO L276 IsEmpty]: Start isEmpty. Operand 31240 states and 36870 transitions. [2019-09-09 05:49:31,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-09 05:49:31,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:31,295 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:31,296 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:31,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:31,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1239024833, now seen corresponding path program 1 times [2019-09-09 05:49:31,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:31,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:31,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:31,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:31,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:31,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:31,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:31,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:31,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:31,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:31,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:31,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:31,318 INFO L87 Difference]: Start difference. First operand 31240 states and 36870 transitions. Second operand 3 states. [2019-09-09 05:49:31,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:31,404 INFO L93 Difference]: Finished difference Result 31754 states and 36871 transitions. [2019-09-09 05:49:31,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:31,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-09 05:49:31,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:31,457 INFO L225 Difference]: With dead ends: 31754 [2019-09-09 05:49:31,457 INFO L226 Difference]: Without dead ends: 31754 [2019-09-09 05:49:31,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:31,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31754 states. [2019-09-09 05:49:31,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31754 to 31752. [2019-09-09 05:49:31,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31752 states. [2019-09-09 05:49:31,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31752 states to 31752 states and 36870 transitions. [2019-09-09 05:49:31,833 INFO L78 Accepts]: Start accepts. Automaton has 31752 states and 36870 transitions. Word has length 31 [2019-09-09 05:49:31,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:31,834 INFO L475 AbstractCegarLoop]: Abstraction has 31752 states and 36870 transitions. [2019-09-09 05:49:31,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:31,834 INFO L276 IsEmpty]: Start isEmpty. Operand 31752 states and 36870 transitions. [2019-09-09 05:49:31,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-09 05:49:31,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:31,881 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:31,881 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:31,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:31,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1776078785, now seen corresponding path program 1 times [2019-09-09 05:49:31,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:31,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:31,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:31,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:31,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:31,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:31,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:31,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:31,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:31,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:31,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:31,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:31,909 INFO L87 Difference]: Start difference. First operand 31752 states and 36870 transitions. Second operand 3 states. [2019-09-09 05:49:32,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:32,174 INFO L93 Difference]: Finished difference Result 51208 states and 57862 transitions. [2019-09-09 05:49:32,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:32,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-09 05:49:32,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:32,265 INFO L225 Difference]: With dead ends: 51208 [2019-09-09 05:49:32,265 INFO L226 Difference]: Without dead ends: 51208 [2019-09-09 05:49:32,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:32,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51208 states. [2019-09-09 05:49:32,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51208 to 49160. [2019-09-09 05:49:32,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49160 states. [2019-09-09 05:49:33,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49160 states to 49160 states and 55814 transitions. [2019-09-09 05:49:33,756 INFO L78 Accepts]: Start accepts. Automaton has 49160 states and 55814 transitions. Word has length 31 [2019-09-09 05:49:33,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:33,756 INFO L475 AbstractCegarLoop]: Abstraction has 49160 states and 55814 transitions. [2019-09-09 05:49:33,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:33,756 INFO L276 IsEmpty]: Start isEmpty. Operand 49160 states and 55814 transitions. [2019-09-09 05:49:33,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-09 05:49:33,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:49:33,810 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:49:33,811 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:49:33,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:49:33,811 INFO L82 PathProgramCache]: Analyzing trace with hash 764961535, now seen corresponding path program 1 times [2019-09-09 05:49:33,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:49:33,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:33,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:49:33,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:49:33,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:49:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:49:33,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:49:33,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:49:33,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:49:33,832 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:49:33,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:49:33,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:49:33,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:33,833 INFO L87 Difference]: Start difference. First operand 49160 states and 55814 transitions. Second operand 3 states. [2019-09-09 05:49:33,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:49:33,967 INFO L93 Difference]: Finished difference Result 61446 states and 66565 transitions. [2019-09-09 05:49:33,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:49:33,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-09 05:49:33,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:49:33,968 INFO L225 Difference]: With dead ends: 61446 [2019-09-09 05:49:33,968 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:49:33,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:49:33,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:49:33,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:49:33,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:49:33,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:49:33,970 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-09-09 05:49:33,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:49:33,970 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:49:33,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:49:33,970 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:49:33,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:49:33,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:49:33 BoogieIcfgContainer [2019-09-09 05:49:33,979 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:49:33,982 INFO L168 Benchmark]: Toolchain (without parser) took 9894.10 ms. Allocated memory was 135.3 MB in the beginning and 865.6 MB in the end (delta: 730.3 MB). Free memory was 89.8 MB in the beginning and 573.9 MB in the end (delta: -484.1 MB). Peak memory consumption was 246.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:33,984 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 135.3 MB. Free memory was 108.5 MB in the beginning and 108.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:49:33,989 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.25 ms. Allocated memory was 135.3 MB in the beginning and 201.3 MB in the end (delta: 66.1 MB). Free memory was 89.6 MB in the beginning and 178.7 MB in the end (delta: -89.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:33,990 INFO L168 Benchmark]: Boogie Preprocessor took 39.74 ms. Allocated memory is still 201.3 MB. Free memory was 178.7 MB in the beginning and 176.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:33,991 INFO L168 Benchmark]: RCFGBuilder took 398.00 ms. Allocated memory is still 201.3 MB. Free memory was 176.4 MB in the beginning and 156.8 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:33,991 INFO L168 Benchmark]: TraceAbstraction took 9119.50 ms. Allocated memory was 201.3 MB in the beginning and 865.6 MB in the end (delta: 664.3 MB). Free memory was 156.8 MB in the beginning and 573.9 MB in the end (delta: -417.0 MB). Peak memory consumption was 247.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:49:33,994 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.20 ms. Allocated memory is still 135.3 MB. Free memory was 108.5 MB in the beginning and 108.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 332.25 ms. Allocated memory was 135.3 MB in the beginning and 201.3 MB in the end (delta: 66.1 MB). Free memory was 89.6 MB in the beginning and 178.7 MB in the end (delta: -89.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.74 ms. Allocated memory is still 201.3 MB. Free memory was 178.7 MB in the beginning and 176.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 398.00 ms. Allocated memory is still 201.3 MB. Free memory was 176.4 MB in the beginning and 156.8 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9119.50 ms. Allocated memory was 201.3 MB in the beginning and 865.6 MB in the end (delta: 664.3 MB). Free memory was 156.8 MB in the beginning and 573.9 MB in the end (delta: -417.0 MB). Peak memory consumption was 247.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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, 47 locations, 1 error locations. SAFE Result, 9.0s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2877 SDtfs, 1405 SDslu, 1967 SDs, 0 SdLazy, 165 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49160occurred in iteration=30, 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: 5.0s AutomataMinimizationTime, 31 MinimizatonAttempts, 8224 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 808 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 777 ConstructedInterpolants, 0 QuantifiedInterpolants, 39912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...