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/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:55:11,151 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:55:11,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:55:11,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:55:11,167 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:55:11,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:55:11,170 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:55:11,172 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:55:11,174 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:55:11,175 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:55:11,176 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:55:11,177 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:55:11,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:55:11,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:55:11,180 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:55:11,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:55:11,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:55:11,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:55:11,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:55:11,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:55:11,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:55:11,192 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:55:11,194 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:55:11,195 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:55:11,200 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:55:11,201 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:55:11,201 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:55:11,205 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:55:11,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:55:11,207 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:55:11,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:55:11,208 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:55:11,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:55:11,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:55:11,213 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:55:11,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:55:11,216 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:55:11,216 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:55:11,216 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:55:11,219 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:55:11,220 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:55:11,222 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-10 03:55:11,248 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:55:11,248 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:55:11,249 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:55:11,250 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:55:11,250 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:55:11,251 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:55:11,251 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:55:11,251 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:55:11,251 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:55:11,252 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:55:11,254 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:55:11,254 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:55:11,255 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:55:11,255 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:55:11,255 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:55:11,256 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:55:11,256 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:55:11,256 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:55:11,256 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:55:11,257 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:55:11,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:55:11,257 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:55:11,257 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:55:11,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:55:11,258 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:55:11,258 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:55:11,259 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:55:11,259 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:55:11,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:55:11,259 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:55:11,311 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:55:11,324 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:55:11,328 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:55:11,329 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:55:11,331 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:55:11,332 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c [2019-09-10 03:55:11,406 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3cf25856/fc623b0629e64485a843d630c6e89ffc/FLAG9901f9a57 [2019-09-10 03:55:11,895 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:55:11,896 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c [2019-09-10 03:55:11,909 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3cf25856/fc623b0629e64485a843d630c6e89ffc/FLAG9901f9a57 [2019-09-10 03:55:12,207 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3cf25856/fc623b0629e64485a843d630c6e89ffc [2019-09-10 03:55:12,217 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:55:12,219 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:55:12,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:55:12,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:55:12,226 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:55:12,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:55:12" (1/1) ... [2019-09-10 03:55:12,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bc6461a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:55:12, skipping insertion in model container [2019-09-10 03:55:12,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:55:12" (1/1) ... [2019-09-10 03:55:12,239 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:55:12,293 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:55:12,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:55:12,686 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:55:12,750 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:55:12,769 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:55:12,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:55:12 WrapperNode [2019-09-10 03:55:12,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:55:12,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:55:12,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:55:12,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:55:12,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:55:12" (1/1) ... [2019-09-10 03:55:12,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:55:12" (1/1) ... [2019-09-10 03:55:12,797 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:55:12" (1/1) ... [2019-09-10 03:55:12,798 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:55:12" (1/1) ... [2019-09-10 03:55:12,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:55:12" (1/1) ... [2019-09-10 03:55:12,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:55:12" (1/1) ... [2019-09-10 03:55:12,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:55:12" (1/1) ... [2019-09-10 03:55:12,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:55:12,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:55:12,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:55:12,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:55:12,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:55:12" (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-10 03:55:12,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:55:12,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:55:12,908 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 03:55:12,908 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 03:55:12,909 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 03:55:12,909 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 03:55:12,909 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 03:55:12,909 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:55:12,909 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 03:55:12,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:55:12,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 03:55:12,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 03:55:12,911 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 03:55:12,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 03:55:12,912 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 03:55:12,915 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 03:55:12,915 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 03:55:12,915 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 03:55:12,915 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 03:55:12,915 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 03:55:12,916 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 03:55:12,916 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:55:12,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:55:12,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:55:13,745 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:55:13,745 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 03:55:13,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:55:13 BoogieIcfgContainer [2019-09-10 03:55:13,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:55:13,748 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:55:13,748 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:55:13,752 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:55:13,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:55:12" (1/3) ... [2019-09-10 03:55:13,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76df91f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:55:13, skipping insertion in model container [2019-09-10 03:55:13,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:55:12" (2/3) ... [2019-09-10 03:55:13,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76df91f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:55:13, skipping insertion in model container [2019-09-10 03:55:13,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:55:13" (3/3) ... [2019-09-10 03:55:13,756 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c [2019-09-10 03:55:13,767 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:55:13,775 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:55:13,792 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:55:13,821 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:55:13,821 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:55:13,821 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:55:13,821 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:55:13,822 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:55:13,822 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:55:13,822 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:55:13,822 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:55:13,843 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2019-09-10 03:55:13,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 03:55:13,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:13,858 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, 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-10 03:55:13,860 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:13,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:13,865 INFO L82 PathProgramCache]: Analyzing trace with hash -184592063, now seen corresponding path program 1 times [2019-09-10 03:55:13,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:13,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:13,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:13,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:13,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:14,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:55:14,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:14,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:55:14,310 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:14,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:55:14,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:55:14,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:55:14,337 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 5 states. [2019-09-10 03:55:14,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:14,505 INFO L93 Difference]: Finished difference Result 157 states and 249 transitions. [2019-09-10 03:55:14,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:55:14,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-09-10 03:55:14,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:14,520 INFO L225 Difference]: With dead ends: 157 [2019-09-10 03:55:14,520 INFO L226 Difference]: Without dead ends: 148 [2019-09-10 03:55:14,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:55:14,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-09-10 03:55:14,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-09-10 03:55:14,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-10 03:55:14,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 214 transitions. [2019-09-10 03:55:14,571 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 214 transitions. Word has length 56 [2019-09-10 03:55:14,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:14,572 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 214 transitions. [2019-09-10 03:55:14,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:55:14,572 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 214 transitions. [2019-09-10 03:55:14,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 03:55:14,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:14,576 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:55:14,576 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:14,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:14,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1678809448, now seen corresponding path program 1 times [2019-09-10 03:55:14,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:14,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:14,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:14,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:14,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:14,810 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-10 03:55:14,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:14,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:55:14,811 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:14,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:55:14,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:55:14,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:55:14,815 INFO L87 Difference]: Start difference. First operand 148 states and 214 transitions. Second operand 5 states. [2019-09-10 03:55:15,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:15,519 INFO L93 Difference]: Finished difference Result 235 states and 337 transitions. [2019-09-10 03:55:15,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:55:15,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-10 03:55:15,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:15,525 INFO L225 Difference]: With dead ends: 235 [2019-09-10 03:55:15,526 INFO L226 Difference]: Without dead ends: 235 [2019-09-10 03:55:15,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:55:15,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-09-10 03:55:15,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 227. [2019-09-10 03:55:15,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-09-10 03:55:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 330 transitions. [2019-09-10 03:55:15,553 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 330 transitions. Word has length 82 [2019-09-10 03:55:15,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:15,554 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 330 transitions. [2019-09-10 03:55:15,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:55:15,555 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 330 transitions. [2019-09-10 03:55:15,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 03:55:15,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:15,559 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:55:15,559 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:15,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:15,560 INFO L82 PathProgramCache]: Analyzing trace with hash 648323325, now seen corresponding path program 1 times [2019-09-10 03:55:15,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:15,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:15,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:15,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:15,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:15,705 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-10 03:55:15,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:15,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:55:15,709 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:15,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:55:15,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:55:15,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:55:15,712 INFO L87 Difference]: Start difference. First operand 227 states and 330 transitions. Second operand 5 states. [2019-09-10 03:55:16,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:16,257 INFO L93 Difference]: Finished difference Result 387 states and 563 transitions. [2019-09-10 03:55:16,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:55:16,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-09-10 03:55:16,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:16,263 INFO L225 Difference]: With dead ends: 387 [2019-09-10 03:55:16,263 INFO L226 Difference]: Without dead ends: 387 [2019-09-10 03:55:16,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:55:16,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-09-10 03:55:16,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 379. [2019-09-10 03:55:16,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-09-10 03:55:16,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 556 transitions. [2019-09-10 03:55:16,298 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 556 transitions. Word has length 84 [2019-09-10 03:55:16,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:16,299 INFO L475 AbstractCegarLoop]: Abstraction has 379 states and 556 transitions. [2019-09-10 03:55:16,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:55:16,299 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 556 transitions. [2019-09-10 03:55:16,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 03:55:16,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:16,302 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, 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, 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-10 03:55:16,303 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:16,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:16,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1070567230, now seen corresponding path program 1 times [2019-09-10 03:55:16,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:16,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:16,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:16,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:16,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:16,403 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-10 03:55:16,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:16,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:55:16,404 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:16,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:55:16,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:55:16,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:55:16,406 INFO L87 Difference]: Start difference. First operand 379 states and 556 transitions. Second operand 5 states. [2019-09-10 03:55:17,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:17,035 INFO L93 Difference]: Finished difference Result 687 states and 999 transitions. [2019-09-10 03:55:17,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:55:17,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-10 03:55:17,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:17,041 INFO L225 Difference]: With dead ends: 687 [2019-09-10 03:55:17,041 INFO L226 Difference]: Without dead ends: 687 [2019-09-10 03:55:17,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:55:17,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-09-10 03:55:17,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 673. [2019-09-10 03:55:17,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-09-10 03:55:17,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 986 transitions. [2019-09-10 03:55:17,082 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 986 transitions. Word has length 86 [2019-09-10 03:55:17,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:17,082 INFO L475 AbstractCegarLoop]: Abstraction has 673 states and 986 transitions. [2019-09-10 03:55:17,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:55:17,083 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 986 transitions. [2019-09-10 03:55:17,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-10 03:55:17,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:17,086 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, 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, 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-10 03:55:17,086 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:17,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:17,086 INFO L82 PathProgramCache]: Analyzing trace with hash 219817383, now seen corresponding path program 1 times [2019-09-10 03:55:17,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:17,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:17,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:17,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:17,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:17,311 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-10 03:55:17,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:17,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 03:55:17,311 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:17,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 03:55:17,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 03:55:17,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:55:17,313 INFO L87 Difference]: Start difference. First operand 673 states and 986 transitions. Second operand 9 states. [2019-09-10 03:55:19,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:19,929 INFO L93 Difference]: Finished difference Result 3152 states and 4714 transitions. [2019-09-10 03:55:19,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 03:55:19,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-10 03:55:19,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:19,955 INFO L225 Difference]: With dead ends: 3152 [2019-09-10 03:55:19,956 INFO L226 Difference]: Without dead ends: 3152 [2019-09-10 03:55:19,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2019-09-10 03:55:19,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3152 states. [2019-09-10 03:55:20,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3152 to 3072. [2019-09-10 03:55:20,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3072 states. [2019-09-10 03:55:20,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 4642 transitions. [2019-09-10 03:55:20,118 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 4642 transitions. Word has length 88 [2019-09-10 03:55:20,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:20,118 INFO L475 AbstractCegarLoop]: Abstraction has 3072 states and 4642 transitions. [2019-09-10 03:55:20,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 03:55:20,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 4642 transitions. [2019-09-10 03:55:20,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 03:55:20,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:20,123 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, 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, 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-10 03:55:20,123 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:20,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:20,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1409570439, now seen corresponding path program 1 times [2019-09-10 03:55:20,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:20,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:20,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:20,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:20,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:20,328 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-10 03:55:20,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:20,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 03:55:20,329 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:20,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 03:55:20,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 03:55:20,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:55:20,330 INFO L87 Difference]: Start difference. First operand 3072 states and 4642 transitions. Second operand 9 states. [2019-09-10 03:55:23,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:23,107 INFO L93 Difference]: Finished difference Result 5547 states and 8414 transitions. [2019-09-10 03:55:23,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 03:55:23,108 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-10 03:55:23,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:23,148 INFO L225 Difference]: With dead ends: 5547 [2019-09-10 03:55:23,149 INFO L226 Difference]: Without dead ends: 5547 [2019-09-10 03:55:23,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 03:55:23,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5547 states. [2019-09-10 03:55:23,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5547 to 4570. [2019-09-10 03:55:23,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4570 states. [2019-09-10 03:55:23,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4570 states to 4570 states and 6937 transitions. [2019-09-10 03:55:23,430 INFO L78 Accepts]: Start accepts. Automaton has 4570 states and 6937 transitions. Word has length 89 [2019-09-10 03:55:23,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:23,431 INFO L475 AbstractCegarLoop]: Abstraction has 4570 states and 6937 transitions. [2019-09-10 03:55:23,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 03:55:23,431 INFO L276 IsEmpty]: Start isEmpty. Operand 4570 states and 6937 transitions. [2019-09-10 03:55:23,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 03:55:23,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:23,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, 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, 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-10 03:55:23,435 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:23,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:23,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1824580059, now seen corresponding path program 1 times [2019-09-10 03:55:23,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:23,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:23,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:23,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:23,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:23,607 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-10 03:55:23,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:23,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:55:23,608 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:23,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:55:23,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:55:23,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:55:23,609 INFO L87 Difference]: Start difference. First operand 4570 states and 6937 transitions. Second operand 6 states. [2019-09-10 03:55:24,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:24,619 INFO L93 Difference]: Finished difference Result 7808 states and 11877 transitions. [2019-09-10 03:55:24,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 03:55:24,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-09-10 03:55:24,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:24,687 INFO L225 Difference]: With dead ends: 7808 [2019-09-10 03:55:24,687 INFO L226 Difference]: Without dead ends: 7808 [2019-09-10 03:55:24,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 03:55:24,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7808 states. [2019-09-10 03:55:24,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7808 to 6263. [2019-09-10 03:55:24,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6263 states. [2019-09-10 03:55:24,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6263 states to 6263 states and 9505 transitions. [2019-09-10 03:55:24,969 INFO L78 Accepts]: Start accepts. Automaton has 6263 states and 9505 transitions. Word has length 89 [2019-09-10 03:55:24,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:24,970 INFO L475 AbstractCegarLoop]: Abstraction has 6263 states and 9505 transitions. [2019-09-10 03:55:24,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:55:24,970 INFO L276 IsEmpty]: Start isEmpty. Operand 6263 states and 9505 transitions. [2019-09-10 03:55:24,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 03:55:24,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:24,974 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1] [2019-09-10 03:55:24,975 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:24,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:24,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1229618911, now seen corresponding path program 1 times [2019-09-10 03:55:24,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:24,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:24,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:24,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:24,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:25,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:55:25,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:25,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 03:55:25,102 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:25,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 03:55:25,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 03:55:25,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:55:25,104 INFO L87 Difference]: Start difference. First operand 6263 states and 9505 transitions. Second operand 9 states. [2019-09-10 03:55:27,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:27,885 INFO L93 Difference]: Finished difference Result 9696 states and 14753 transitions. [2019-09-10 03:55:27,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 03:55:27,885 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-10 03:55:27,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:27,950 INFO L225 Difference]: With dead ends: 9696 [2019-09-10 03:55:27,950 INFO L226 Difference]: Without dead ends: 9696 [2019-09-10 03:55:27,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=238, Invalid=884, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 03:55:27,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9696 states. [2019-09-10 03:55:28,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9696 to 7480. [2019-09-10 03:55:28,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7480 states. [2019-09-10 03:55:28,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7480 states to 7480 states and 11374 transitions. [2019-09-10 03:55:28,229 INFO L78 Accepts]: Start accepts. Automaton has 7480 states and 11374 transitions. Word has length 89 [2019-09-10 03:55:28,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:28,229 INFO L475 AbstractCegarLoop]: Abstraction has 7480 states and 11374 transitions. [2019-09-10 03:55:28,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 03:55:28,230 INFO L276 IsEmpty]: Start isEmpty. Operand 7480 states and 11374 transitions. [2019-09-10 03:55:28,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-10 03:55:28,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:28,237 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, 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, 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-10 03:55:28,238 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:28,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:28,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2057730764, now seen corresponding path program 1 times [2019-09-10 03:55:28,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:28,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:28,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:28,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:28,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:28,454 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-10 03:55:28,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:28,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 03:55:28,455 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:28,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 03:55:28,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 03:55:28,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:55:28,456 INFO L87 Difference]: Start difference. First operand 7480 states and 11374 transitions. Second operand 9 states. [2019-09-10 03:55:31,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:31,212 INFO L93 Difference]: Finished difference Result 8638 states and 13142 transitions. [2019-09-10 03:55:31,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 03:55:31,213 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 89 [2019-09-10 03:55:31,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:31,249 INFO L225 Difference]: With dead ends: 8638 [2019-09-10 03:55:31,249 INFO L226 Difference]: Without dead ends: 8638 [2019-09-10 03:55:31,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 03:55:31,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8638 states. [2019-09-10 03:55:31,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8638 to 6326. [2019-09-10 03:55:31,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6326 states. [2019-09-10 03:55:31,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6326 states to 6326 states and 9607 transitions. [2019-09-10 03:55:31,416 INFO L78 Accepts]: Start accepts. Automaton has 6326 states and 9607 transitions. Word has length 89 [2019-09-10 03:55:31,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:31,417 INFO L475 AbstractCegarLoop]: Abstraction has 6326 states and 9607 transitions. [2019-09-10 03:55:31,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 03:55:31,417 INFO L276 IsEmpty]: Start isEmpty. Operand 6326 states and 9607 transitions. [2019-09-10 03:55:31,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 03:55:31,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:31,421 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, 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, 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-10 03:55:31,422 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:31,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:31,422 INFO L82 PathProgramCache]: Analyzing trace with hash 52219131, now seen corresponding path program 1 times [2019-09-10 03:55:31,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:31,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:31,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:31,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:31,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:31,607 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-10 03:55:31,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:31,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 03:55:31,608 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:31,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 03:55:31,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 03:55:31,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 03:55:31,620 INFO L87 Difference]: Start difference. First operand 6326 states and 9607 transitions. Second operand 10 states. [2019-09-10 03:55:33,933 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-09-10 03:55:36,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:36,457 INFO L93 Difference]: Finished difference Result 12295 states and 19071 transitions. [2019-09-10 03:55:36,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-10 03:55:36,459 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2019-09-10 03:55:36,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:36,561 INFO L225 Difference]: With dead ends: 12295 [2019-09-10 03:55:36,562 INFO L226 Difference]: Without dead ends: 12295 [2019-09-10 03:55:36,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=479, Invalid=1683, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 03:55:36,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12295 states. [2019-09-10 03:55:36,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12295 to 9964. [2019-09-10 03:55:36,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9964 states. [2019-09-10 03:55:37,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9964 states to 9964 states and 15237 transitions. [2019-09-10 03:55:37,004 INFO L78 Accepts]: Start accepts. Automaton has 9964 states and 15237 transitions. Word has length 90 [2019-09-10 03:55:37,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:37,004 INFO L475 AbstractCegarLoop]: Abstraction has 9964 states and 15237 transitions. [2019-09-10 03:55:37,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 03:55:37,004 INFO L276 IsEmpty]: Start isEmpty. Operand 9964 states and 15237 transitions. [2019-09-10 03:55:37,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 03:55:37,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:37,011 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, 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, 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-10 03:55:37,011 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:37,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:37,012 INFO L82 PathProgramCache]: Analyzing trace with hash -542742017, now seen corresponding path program 1 times [2019-09-10 03:55:37,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:37,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:37,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:37,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:37,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:37,224 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-10 03:55:37,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:37,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:55:37,225 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:37,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:55:37,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:55:37,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:55:37,227 INFO L87 Difference]: Start difference. First operand 9964 states and 15237 transitions. Second operand 6 states. [2019-09-10 03:55:37,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:37,891 INFO L93 Difference]: Finished difference Result 10714 states and 16242 transitions. [2019-09-10 03:55:37,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:55:37,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-09-10 03:55:37,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:37,933 INFO L225 Difference]: With dead ends: 10714 [2019-09-10 03:55:37,933 INFO L226 Difference]: Without dead ends: 10690 [2019-09-10 03:55:37,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 03:55:37,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10690 states. [2019-09-10 03:55:38,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10690 to 9982. [2019-09-10 03:55:38,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9982 states. [2019-09-10 03:55:38,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9982 states to 9982 states and 15213 transitions. [2019-09-10 03:55:38,164 INFO L78 Accepts]: Start accepts. Automaton has 9982 states and 15213 transitions. Word has length 90 [2019-09-10 03:55:38,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:38,165 INFO L475 AbstractCegarLoop]: Abstraction has 9982 states and 15213 transitions. [2019-09-10 03:55:38,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:55:38,165 INFO L276 IsEmpty]: Start isEmpty. Operand 9982 states and 15213 transitions. [2019-09-10 03:55:38,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 03:55:38,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:38,169 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, 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, 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-10 03:55:38,169 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:38,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:38,169 INFO L82 PathProgramCache]: Analyzing trace with hash 464875604, now seen corresponding path program 1 times [2019-09-10 03:55:38,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:38,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:38,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:38,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:38,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:38,298 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-10 03:55:38,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:38,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:55:38,298 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:38,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:55:38,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:55:38,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:55:38,299 INFO L87 Difference]: Start difference. First operand 9982 states and 15213 transitions. Second operand 6 states. [2019-09-10 03:55:38,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:38,973 INFO L93 Difference]: Finished difference Result 10669 states and 16211 transitions. [2019-09-10 03:55:38,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:55:38,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-09-10 03:55:38,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:39,020 INFO L225 Difference]: With dead ends: 10669 [2019-09-10 03:55:39,021 INFO L226 Difference]: Without dead ends: 10657 [2019-09-10 03:55:39,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 03:55:39,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10657 states. [2019-09-10 03:55:39,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10657 to 10011. [2019-09-10 03:55:39,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10011 states. [2019-09-10 03:55:39,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10011 states to 10011 states and 15201 transitions. [2019-09-10 03:55:39,738 INFO L78 Accepts]: Start accepts. Automaton has 10011 states and 15201 transitions. Word has length 90 [2019-09-10 03:55:39,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:39,738 INFO L475 AbstractCegarLoop]: Abstraction has 10011 states and 15201 transitions. [2019-09-10 03:55:39,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:55:39,738 INFO L276 IsEmpty]: Start isEmpty. Operand 10011 states and 15201 transitions. [2019-09-10 03:55:39,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 03:55:39,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:39,742 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, 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, 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-10 03:55:39,742 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:39,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:39,742 INFO L82 PathProgramCache]: Analyzing trace with hash -20167427, now seen corresponding path program 1 times [2019-09-10 03:55:39,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:39,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:39,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:39,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:39,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:39,806 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-10 03:55:39,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:39,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:55:39,806 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:39,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:55:39,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:55:39,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:55:39,808 INFO L87 Difference]: Start difference. First operand 10011 states and 15201 transitions. Second operand 5 states. [2019-09-10 03:55:40,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:40,326 INFO L93 Difference]: Finished difference Result 16154 states and 24663 transitions. [2019-09-10 03:55:40,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:55:40,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-10 03:55:40,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:40,394 INFO L225 Difference]: With dead ends: 16154 [2019-09-10 03:55:40,395 INFO L226 Difference]: Without dead ends: 16154 [2019-09-10 03:55:40,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:55:40,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16154 states. [2019-09-10 03:55:40,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16154 to 15831. [2019-09-10 03:55:40,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15831 states. [2019-09-10 03:55:40,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15831 states to 15831 states and 24230 transitions. [2019-09-10 03:55:40,702 INFO L78 Accepts]: Start accepts. Automaton has 15831 states and 24230 transitions. Word has length 90 [2019-09-10 03:55:40,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:40,704 INFO L475 AbstractCegarLoop]: Abstraction has 15831 states and 24230 transitions. [2019-09-10 03:55:40,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:55:40,704 INFO L276 IsEmpty]: Start isEmpty. Operand 15831 states and 24230 transitions. [2019-09-10 03:55:40,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 03:55:40,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:40,707 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, 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, 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-10 03:55:40,708 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:40,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:40,708 INFO L82 PathProgramCache]: Analyzing trace with hash -19069474, now seen corresponding path program 1 times [2019-09-10 03:55:40,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:40,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:40,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:40,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:40,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:40,817 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-10 03:55:40,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:40,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:55:40,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:40,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:55:40,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:55:40,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:55:40,819 INFO L87 Difference]: Start difference. First operand 15831 states and 24230 transitions. Second operand 6 states. [2019-09-10 03:55:41,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:41,932 INFO L93 Difference]: Finished difference Result 27628 states and 42406 transitions. [2019-09-10 03:55:41,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 03:55:41,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-09-10 03:55:41,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:42,056 INFO L225 Difference]: With dead ends: 27628 [2019-09-10 03:55:42,057 INFO L226 Difference]: Without dead ends: 27628 [2019-09-10 03:55:42,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-10 03:55:42,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27628 states. [2019-09-10 03:55:42,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27628 to 27431. [2019-09-10 03:55:42,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27431 states. [2019-09-10 03:55:42,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27431 states to 27431 states and 42121 transitions. [2019-09-10 03:55:42,656 INFO L78 Accepts]: Start accepts. Automaton has 27431 states and 42121 transitions. Word has length 90 [2019-09-10 03:55:42,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:42,656 INFO L475 AbstractCegarLoop]: Abstraction has 27431 states and 42121 transitions. [2019-09-10 03:55:42,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:55:42,657 INFO L276 IsEmpty]: Start isEmpty. Operand 27431 states and 42121 transitions. [2019-09-10 03:55:42,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 03:55:42,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:42,660 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, 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, 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-10 03:55:42,661 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:42,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:42,661 INFO L82 PathProgramCache]: Analyzing trace with hash 636752311, now seen corresponding path program 1 times [2019-09-10 03:55:42,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:42,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:42,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:42,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:42,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:42,822 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-10 03:55:42,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:42,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 03:55:42,823 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:42,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 03:55:42,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 03:55:42,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 03:55:42,824 INFO L87 Difference]: Start difference. First operand 27431 states and 42121 transitions. Second operand 11 states. [2019-09-10 03:55:44,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:44,567 INFO L93 Difference]: Finished difference Result 44230 states and 68540 transitions. [2019-09-10 03:55:44,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 03:55:44,567 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2019-09-10 03:55:44,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:44,706 INFO L225 Difference]: With dead ends: 44230 [2019-09-10 03:55:44,706 INFO L226 Difference]: Without dead ends: 44222 [2019-09-10 03:55:44,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-10 03:55:44,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44222 states. [2019-09-10 03:55:45,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44222 to 27445. [2019-09-10 03:55:45,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27445 states. [2019-09-10 03:55:46,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27445 states to 27445 states and 42142 transitions. [2019-09-10 03:55:46,665 INFO L78 Accepts]: Start accepts. Automaton has 27445 states and 42142 transitions. Word has length 91 [2019-09-10 03:55:46,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:46,665 INFO L475 AbstractCegarLoop]: Abstraction has 27445 states and 42142 transitions. [2019-09-10 03:55:46,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 03:55:46,666 INFO L276 IsEmpty]: Start isEmpty. Operand 27445 states and 42142 transitions. [2019-09-10 03:55:46,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 03:55:46,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:46,669 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, 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, 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-10 03:55:46,669 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:46,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:46,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1389315086, now seen corresponding path program 1 times [2019-09-10 03:55:46,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:46,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:46,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:46,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:46,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:46,752 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-10 03:55:46,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:46,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:55:46,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:46,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:55:46,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:55:46,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:55:46,755 INFO L87 Difference]: Start difference. First operand 27445 states and 42142 transitions. Second operand 6 states. [2019-09-10 03:55:48,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:48,172 INFO L93 Difference]: Finished difference Result 54318 states and 83367 transitions. [2019-09-10 03:55:48,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 03:55:48,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-09-10 03:55:48,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:48,364 INFO L225 Difference]: With dead ends: 54318 [2019-09-10 03:55:48,365 INFO L226 Difference]: Without dead ends: 54318 [2019-09-10 03:55:48,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-10 03:55:48,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54318 states. [2019-09-10 03:55:49,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54318 to 53755. [2019-09-10 03:55:49,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53755 states. [2019-09-10 03:55:49,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53755 states to 53755 states and 82525 transitions. [2019-09-10 03:55:49,589 INFO L78 Accepts]: Start accepts. Automaton has 53755 states and 82525 transitions. Word has length 91 [2019-09-10 03:55:49,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:49,589 INFO L475 AbstractCegarLoop]: Abstraction has 53755 states and 82525 transitions. [2019-09-10 03:55:49,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:55:49,589 INFO L276 IsEmpty]: Start isEmpty. Operand 53755 states and 82525 transitions. [2019-09-10 03:55:49,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 03:55:49,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:49,593 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, 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, 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-10 03:55:49,593 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:49,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:49,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1958230301, now seen corresponding path program 1 times [2019-09-10 03:55:49,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:49,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:49,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:49,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:49,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:55:49,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:49,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 03:55:49,742 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:49,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 03:55:49,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 03:55:49,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-10 03:55:49,743 INFO L87 Difference]: Start difference. First operand 53755 states and 82525 transitions. Second operand 11 states. [2019-09-10 03:55:52,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:52,032 INFO L93 Difference]: Finished difference Result 91303 states and 141812 transitions. [2019-09-10 03:55:52,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 03:55:52,032 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2019-09-10 03:55:52,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:52,294 INFO L225 Difference]: With dead ends: 91303 [2019-09-10 03:55:52,294 INFO L226 Difference]: Without dead ends: 91293 [2019-09-10 03:55:52,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-10 03:55:52,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91293 states. [2019-09-10 03:55:53,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91293 to 53629. [2019-09-10 03:55:53,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53629 states. [2019-09-10 03:55:55,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53629 states to 53629 states and 82343 transitions. [2019-09-10 03:55:55,462 INFO L78 Accepts]: Start accepts. Automaton has 53629 states and 82343 transitions. Word has length 91 [2019-09-10 03:55:55,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:55,462 INFO L475 AbstractCegarLoop]: Abstraction has 53629 states and 82343 transitions. [2019-09-10 03:55:55,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 03:55:55,462 INFO L276 IsEmpty]: Start isEmpty. Operand 53629 states and 82343 transitions. [2019-09-10 03:55:55,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 03:55:55,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:55,465 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, 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, 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-10 03:55:55,466 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:55,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:55,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1900611914, now seen corresponding path program 1 times [2019-09-10 03:55:55,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:55,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:55,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:55,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:55,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:55,572 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-10 03:55:55,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:55,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:55:55,573 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:55,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:55:55,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:55:55,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:55:55,574 INFO L87 Difference]: Start difference. First operand 53629 states and 82343 transitions. Second operand 5 states. [2019-09-10 03:55:56,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:56,438 INFO L93 Difference]: Finished difference Result 88193 states and 133512 transitions. [2019-09-10 03:55:56,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:55:56,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-10 03:55:56,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:56,713 INFO L225 Difference]: With dead ends: 88193 [2019-09-10 03:55:56,713 INFO L226 Difference]: Without dead ends: 88193 [2019-09-10 03:55:56,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 03:55:56,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88193 states. [2019-09-10 03:55:58,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88193 to 88180. [2019-09-10 03:55:58,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88180 states. [2019-09-10 03:55:58,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88180 states to 88180 states and 133491 transitions. [2019-09-10 03:55:58,216 INFO L78 Accepts]: Start accepts. Automaton has 88180 states and 133491 transitions. Word has length 93 [2019-09-10 03:55:58,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:58,216 INFO L475 AbstractCegarLoop]: Abstraction has 88180 states and 133491 transitions. [2019-09-10 03:55:58,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:55:58,216 INFO L276 IsEmpty]: Start isEmpty. Operand 88180 states and 133491 transitions. [2019-09-10 03:55:58,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 03:55:58,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:58,218 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, 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, 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-10 03:55:58,219 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:58,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:58,219 INFO L82 PathProgramCache]: Analyzing trace with hash 815188096, now seen corresponding path program 1 times [2019-09-10 03:55:58,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:58,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:58,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:58,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:58,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:58,322 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-10 03:55:58,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:55:58,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:55:58,323 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:58,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:55:58,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:55:58,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:55:58,324 INFO L87 Difference]: Start difference. First operand 88180 states and 133491 transitions. Second operand 5 states. [2019-09-10 03:55:58,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:58,953 INFO L93 Difference]: Finished difference Result 174221 states and 260161 transitions. [2019-09-10 03:55:58,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:55:58,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-10 03:55:58,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:56:00,054 INFO L225 Difference]: With dead ends: 174221 [2019-09-10 03:56:00,054 INFO L226 Difference]: Without dead ends: 174221 [2019-09-10 03:56:00,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:56:00,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174221 states. [2019-09-10 03:56:04,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174221 to 174219. [2019-09-10 03:56:04,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174219 states. [2019-09-10 03:56:04,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174219 states to 174219 states and 260160 transitions. [2019-09-10 03:56:04,916 INFO L78 Accepts]: Start accepts. Automaton has 174219 states and 260160 transitions. Word has length 93 [2019-09-10 03:56:04,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:56:04,917 INFO L475 AbstractCegarLoop]: Abstraction has 174219 states and 260160 transitions. [2019-09-10 03:56:04,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:56:04,917 INFO L276 IsEmpty]: Start isEmpty. Operand 174219 states and 260160 transitions. [2019-09-10 03:56:04,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 03:56:04,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:56:04,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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:56:04,919 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:56:04,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:56:04,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1780635836, now seen corresponding path program 1 times [2019-09-10 03:56:04,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:56:04,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:56:04,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:56:04,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:56:04,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:56:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:56:04,957 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-10 03:56:04,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:56:04,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:56:04,958 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:56:04,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:56:04,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:56:04,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:56:04,959 INFO L87 Difference]: Start difference. First operand 174219 states and 260160 transitions. Second operand 3 states. [2019-09-10 03:56:06,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:56:06,286 INFO L93 Difference]: Finished difference Result 174315 states and 260278 transitions. [2019-09-10 03:56:06,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:56:06,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-10 03:56:06,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:56:06,684 INFO L225 Difference]: With dead ends: 174315 [2019-09-10 03:56:06,684 INFO L226 Difference]: Without dead ends: 174315 [2019-09-10 03:56:06,684 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-10 03:56:06,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174315 states. [2019-09-10 03:56:12,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174315 to 174221. [2019-09-10 03:56:12,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174221 states. [2019-09-10 03:56:12,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174221 states to 174221 states and 260162 transitions. [2019-09-10 03:56:12,710 INFO L78 Accepts]: Start accepts. Automaton has 174221 states and 260162 transitions. Word has length 94 [2019-09-10 03:56:12,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:56:12,710 INFO L475 AbstractCegarLoop]: Abstraction has 174221 states and 260162 transitions. [2019-09-10 03:56:12,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:56:12,711 INFO L276 IsEmpty]: Start isEmpty. Operand 174221 states and 260162 transitions. [2019-09-10 03:56:12,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 03:56:12,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:56:12,712 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, 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, 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, 1, 1] [2019-09-10 03:56:12,712 INFO L418 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:56:12,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:56:12,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1870900251, now seen corresponding path program 1 times [2019-09-10 03:56:12,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:56:12,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:56:12,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:56:12,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:56:12,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:56:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:56:13,498 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-10 03:56:13,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:56:13,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:56:13,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:56:13,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:56:13,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:56:13,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:56:13,501 INFO L87 Difference]: Start difference. First operand 174221 states and 260162 transitions. Second operand 5 states. [2019-09-10 03:56:14,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:56:14,694 INFO L93 Difference]: Finished difference Result 343860 states and 505459 transitions. [2019-09-10 03:56:14,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:56:14,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-10 03:56:14,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:56:15,604 INFO L225 Difference]: With dead ends: 343860 [2019-09-10 03:56:15,604 INFO L226 Difference]: Without dead ends: 343860 [2019-09-10 03:56:15,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:56:15,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343860 states. [2019-09-10 03:56:25,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343860 to 343858. [2019-09-10 03:56:25,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343858 states. [2019-09-10 03:56:26,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343858 states to 343858 states and 505458 transitions. [2019-09-10 03:56:26,624 INFO L78 Accepts]: Start accepts. Automaton has 343858 states and 505458 transitions. Word has length 95 [2019-09-10 03:56:26,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:56:26,624 INFO L475 AbstractCegarLoop]: Abstraction has 343858 states and 505458 transitions. [2019-09-10 03:56:26,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:56:26,624 INFO L276 IsEmpty]: Start isEmpty. Operand 343858 states and 505458 transitions. [2019-09-10 03:56:26,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 03:56:26,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:56:26,627 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, 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, 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, 1, 1] [2019-09-10 03:56:26,627 INFO L418 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:56:26,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:56:26,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1487938196, now seen corresponding path program 1 times [2019-09-10 03:56:26,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:56:26,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:56:26,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:56:26,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:56:26,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:56:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:56:26,714 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-10 03:56:26,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:56:26,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:56:26,714 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:56:26,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:56:26,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:56:26,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:56:26,715 INFO L87 Difference]: Start difference. First operand 343858 states and 505458 transitions. Second operand 4 states. [2019-09-10 03:56:27,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:56:27,706 INFO L93 Difference]: Finished difference Result 260159 states and 383013 transitions. [2019-09-10 03:56:27,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:56:27,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-09-10 03:56:27,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:56:28,399 INFO L225 Difference]: With dead ends: 260159 [2019-09-10 03:56:28,399 INFO L226 Difference]: Without dead ends: 260100 [2019-09-10 03:56:28,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:56:28,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260100 states. [2019-09-10 03:56:37,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260100 to 260100. [2019-09-10 03:56:37,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260100 states. [2019-09-10 03:56:38,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260100 states to 260100 states and 382934 transitions. [2019-09-10 03:56:38,439 INFO L78 Accepts]: Start accepts. Automaton has 260100 states and 382934 transitions. Word has length 95 [2019-09-10 03:56:38,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:56:38,439 INFO L475 AbstractCegarLoop]: Abstraction has 260100 states and 382934 transitions. [2019-09-10 03:56:38,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:56:38,440 INFO L276 IsEmpty]: Start isEmpty. Operand 260100 states and 382934 transitions. [2019-09-10 03:56:38,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 03:56:38,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:56:38,441 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, 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, 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, 1, 1, 1, 1] [2019-09-10 03:56:38,442 INFO L418 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:56:38,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:56:38,442 INFO L82 PathProgramCache]: Analyzing trace with hash -22996116, now seen corresponding path program 1 times [2019-09-10 03:56:38,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:56:38,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:56:38,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:56:38,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:56:38,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:56:38,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:56:38,541 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-10 03:56:38,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:56:38,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:56:38,542 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:56:38,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:56:38,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:56:38,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:56:38,543 INFO L87 Difference]: Start difference. First operand 260100 states and 382934 transitions. Second operand 5 states. [2019-09-10 03:56:42,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:56:42,116 INFO L93 Difference]: Finished difference Result 509866 states and 738677 transitions. [2019-09-10 03:56:42,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:56:42,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 03:56:42,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:56:43,442 INFO L225 Difference]: With dead ends: 509866 [2019-09-10 03:56:43,442 INFO L226 Difference]: Without dead ends: 509866 [2019-09-10 03:56:43,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:56:43,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509866 states. [2019-09-10 03:56:58,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509866 to 509864. [2019-09-10 03:56:58,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509864 states. [2019-09-10 03:57:00,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509864 states to 509864 states and 738676 transitions. [2019-09-10 03:57:00,090 INFO L78 Accepts]: Start accepts. Automaton has 509864 states and 738676 transitions. Word has length 97 [2019-09-10 03:57:00,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:57:00,090 INFO L475 AbstractCegarLoop]: Abstraction has 509864 states and 738676 transitions. [2019-09-10 03:57:00,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:57:00,090 INFO L276 IsEmpty]: Start isEmpty. Operand 509864 states and 738676 transitions. [2019-09-10 03:57:00,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 03:57:00,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:57:00,093 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, 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, 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, 1, 1, 1, 1] [2019-09-10 03:57:00,093 INFO L418 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:57:00,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:57:00,093 INFO L82 PathProgramCache]: Analyzing trace with hash -185353578, now seen corresponding path program 1 times [2019-09-10 03:57:00,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:57:00,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:57:00,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:57:00,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:57:00,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:57:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:57:00,160 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-10 03:57:00,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:57:00,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:57:00,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:57:00,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:57:00,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:57:00,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:57:00,164 INFO L87 Difference]: Start difference. First operand 509864 states and 738676 transitions. Second operand 4 states. [2019-09-10 03:57:12,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:57:12,898 INFO L93 Difference]: Finished difference Result 1039457 states and 1475585 transitions. [2019-09-10 03:57:12,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:57:12,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-10 03:57:12,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:57:17,441 INFO L225 Difference]: With dead ends: 1039457 [2019-09-10 03:57:17,441 INFO L226 Difference]: Without dead ends: 1039457 [2019-09-10 03:57:17,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:57:18,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039457 states. [2019-09-10 03:57:56,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039457 to 1039269. [2019-09-10 03:57:56,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039269 states. [2019-09-10 03:58:12,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039269 states to 1039269 states and 1475399 transitions. [2019-09-10 03:58:12,645 INFO L78 Accepts]: Start accepts. Automaton has 1039269 states and 1475399 transitions. Word has length 97 [2019-09-10 03:58:12,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:58:12,646 INFO L475 AbstractCegarLoop]: Abstraction has 1039269 states and 1475399 transitions. [2019-09-10 03:58:12,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:58:12,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1039269 states and 1475399 transitions. [2019-09-10 03:58:12,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 03:58:12,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:58:12,649 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, 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, 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, 1, 1, 1, 1] [2019-09-10 03:58:12,650 INFO L418 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:58:12,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:58:12,650 INFO L82 PathProgramCache]: Analyzing trace with hash -771629800, now seen corresponding path program 1 times [2019-09-10 03:58:12,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:58:12,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:58:12,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:58:12,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:58:12,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:58:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:58:12,733 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-10 03:58:12,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:58:12,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:58:12,734 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:58:12,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:58:12,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:58:12,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:58:12,735 INFO L87 Difference]: Start difference. First operand 1039269 states and 1475399 transitions. Second operand 4 states. [2019-09-10 03:58:29,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:58:29,008 INFO L93 Difference]: Finished difference Result 877751 states and 1247602 transitions. [2019-09-10 03:58:29,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:58:29,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-10 03:58:29,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:58:32,018 INFO L225 Difference]: With dead ends: 877751 [2019-09-10 03:58:32,019 INFO L226 Difference]: Without dead ends: 877700 [2019-09-10 03:58:32,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:58:32,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877700 states. [2019-09-10 03:58:46,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877700 to 877700. [2019-09-10 03:58:46,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877700 states. [2019-09-10 03:59:18,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877700 states to 877700 states and 1247539 transitions. [2019-09-10 03:59:18,013 INFO L78 Accepts]: Start accepts. Automaton has 877700 states and 1247539 transitions. Word has length 97 [2019-09-10 03:59:18,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:59:18,013 INFO L475 AbstractCegarLoop]: Abstraction has 877700 states and 1247539 transitions. [2019-09-10 03:59:18,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:59:18,013 INFO L276 IsEmpty]: Start isEmpty. Operand 877700 states and 1247539 transitions. [2019-09-10 03:59:18,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 03:59:18,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:59:18,017 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, 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, 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, 1, 1, 1, 1, 1] [2019-09-10 03:59:18,017 INFO L418 AbstractCegarLoop]: === Iteration 26 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:59:18,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:59:18,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1745954525, now seen corresponding path program 1 times [2019-09-10 03:59:18,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:59:18,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:59:18,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:59:18,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:59:18,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:59:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:59:18,146 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-10 03:59:18,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:59:18,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 03:59:18,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:59:18,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 03:59:18,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 03:59:18,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 03:59:18,148 INFO L87 Difference]: Start difference. First operand 877700 states and 1247539 transitions. Second operand 10 states. [2019-09-10 03:59:35,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:59:35,355 INFO L93 Difference]: Finished difference Result 1125692 states and 1603383 transitions. [2019-09-10 03:59:35,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 03:59:35,356 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2019-09-10 03:59:35,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:59:38,479 INFO L225 Difference]: With dead ends: 1125692 [2019-09-10 03:59:38,480 INFO L226 Difference]: Without dead ends: 1125652 [2019-09-10 03:59:38,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-09-10 03:59:39,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125652 states. [2019-09-10 04:00:13,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125652 to 906444. [2019-09-10 04:00:13,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906444 states. [2019-09-10 04:00:18,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906444 states to 906444 states and 1289023 transitions. [2019-09-10 04:00:18,228 INFO L78 Accepts]: Start accepts. Automaton has 906444 states and 1289023 transitions. Word has length 98 [2019-09-10 04:00:18,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:00:18,228 INFO L475 AbstractCegarLoop]: Abstraction has 906444 states and 1289023 transitions. [2019-09-10 04:00:18,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 04:00:18,229 INFO L276 IsEmpty]: Start isEmpty. Operand 906444 states and 1289023 transitions. [2019-09-10 04:00:18,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 04:00:18,232 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:00:18,232 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, 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, 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, 1, 1, 1, 1, 1] [2019-09-10 04:00:18,232 INFO L418 AbstractCegarLoop]: === Iteration 27 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:00:18,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:00:18,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1847412897, now seen corresponding path program 1 times [2019-09-10 04:00:18,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:00:18,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:00:18,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:00:18,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:00:18,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:00:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:00:18,319 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-10 04:00:18,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:00:18,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:00:18,319 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:00:18,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:00:18,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:00:18,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:00:18,320 INFO L87 Difference]: Start difference. First operand 906444 states and 1289023 transitions. Second operand 5 states. [2019-09-10 04:00:23,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:00:23,579 INFO L93 Difference]: Finished difference Result 947848 states and 1344700 transitions. [2019-09-10 04:00:23,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:00:23,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-10 04:00:23,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:00:38,803 INFO L225 Difference]: With dead ends: 947848 [2019-09-10 04:00:38,804 INFO L226 Difference]: Without dead ends: 947848 [2019-09-10 04:00:38,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:00:39,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947848 states. [2019-09-10 04:00:54,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947848 to 939054. [2019-09-10 04:00:54,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 939054 states. [2019-09-10 04:01:14,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939054 states to 939054 states and 1332139 transitions. [2019-09-10 04:01:14,624 INFO L78 Accepts]: Start accepts. Automaton has 939054 states and 1332139 transitions. Word has length 98 [2019-09-10 04:01:14,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:01:14,625 INFO L475 AbstractCegarLoop]: Abstraction has 939054 states and 1332139 transitions. [2019-09-10 04:01:14,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:01:14,625 INFO L276 IsEmpty]: Start isEmpty. Operand 939054 states and 1332139 transitions. [2019-09-10 04:01:14,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 04:01:14,629 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:14,629 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, 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, 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, 1, 1, 1, 1, 1] [2019-09-10 04:01:14,629 INFO L418 AbstractCegarLoop]: === Iteration 28 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:14,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:14,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1635309586, now seen corresponding path program 1 times [2019-09-10 04:01:14,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:14,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:14,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:14,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:14,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:01:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:01:14,680 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-10 04:01:14,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:01:14,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 04:01:14,681 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:01:14,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 04:01:14,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 04:01:14,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 04:01:14,682 INFO L87 Difference]: Start difference. First operand 939054 states and 1332139 transitions. Second operand 3 states. [2019-09-10 04:01:19,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:01:19,517 INFO L93 Difference]: Finished difference Result 939430 states and 1332533 transitions. [2019-09-10 04:01:19,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 04:01:19,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-10 04:01:19,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:01:33,733 INFO L225 Difference]: With dead ends: 939430 [2019-09-10 04:01:33,733 INFO L226 Difference]: Without dead ends: 939430 [2019-09-10 04:01:33,734 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-10 04:01:34,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939430 states. [2019-09-10 04:01:48,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939430 to 939060. [2019-09-10 04:01:48,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 939060 states. [2019-09-10 04:01:53,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939060 states to 939060 states and 1332145 transitions. [2019-09-10 04:01:53,540 INFO L78 Accepts]: Start accepts. Automaton has 939060 states and 1332145 transitions. Word has length 98 [2019-09-10 04:01:53,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:01:53,541 INFO L475 AbstractCegarLoop]: Abstraction has 939060 states and 1332145 transitions. [2019-09-10 04:01:53,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 04:01:53,541 INFO L276 IsEmpty]: Start isEmpty. Operand 939060 states and 1332145 transitions. [2019-09-10 04:01:53,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 04:01:53,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:01:53,546 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, 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, 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, 1, 1, 1, 1, 1, 1] [2019-09-10 04:01:53,546 INFO L418 AbstractCegarLoop]: === Iteration 29 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:01:53,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:01:53,547 INFO L82 PathProgramCache]: Analyzing trace with hash 654198911, now seen corresponding path program 1 times [2019-09-10 04:01:53,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:01:53,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:53,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:01:53,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:01:53,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:01:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:01:53,585 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-10 04:01:53,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:01:53,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 04:01:53,585 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:01:53,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 04:01:53,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 04:01:53,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 04:01:53,586 INFO L87 Difference]: Start difference. First operand 939060 states and 1332145 transitions. Second operand 3 states. [2019-09-10 04:02:09,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:02:09,045 INFO L93 Difference]: Finished difference Result 939378 states and 1332463 transitions. [2019-09-10 04:02:09,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 04:02:09,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 04:02:09,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:02:11,514 INFO L225 Difference]: With dead ends: 939378 [2019-09-10 04:02:11,514 INFO L226 Difference]: Without dead ends: 939378 [2019-09-10 04:02:11,515 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-10 04:02:13,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939378 states. [2019-09-10 04:02:43,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939378 to 939064. [2019-09-10 04:02:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 939064 states. [2019-09-10 04:02:48,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939064 states to 939064 states and 1332149 transitions. [2019-09-10 04:02:48,125 INFO L78 Accepts]: Start accepts. Automaton has 939064 states and 1332149 transitions. Word has length 99 [2019-09-10 04:02:48,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:02:48,126 INFO L475 AbstractCegarLoop]: Abstraction has 939064 states and 1332149 transitions. [2019-09-10 04:02:48,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 04:02:48,126 INFO L276 IsEmpty]: Start isEmpty. Operand 939064 states and 1332149 transitions. [2019-09-10 04:02:48,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 04:02:48,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:02:48,129 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, 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, 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, 1, 1, 1, 1, 1, 1] [2019-09-10 04:02:48,129 INFO L418 AbstractCegarLoop]: === Iteration 30 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:02:48,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:02:48,130 INFO L82 PathProgramCache]: Analyzing trace with hash 2136825966, now seen corresponding path program 1 times [2019-09-10 04:02:48,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:02:48,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:48,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:02:48,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:02:48,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:02:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:02:48,194 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-10 04:02:48,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:02:48,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 04:02:48,194 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:02:48,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 04:02:48,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 04:02:48,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:02:48,195 INFO L87 Difference]: Start difference. First operand 939064 states and 1332149 transitions. Second operand 4 states. [2019-09-10 04:03:08,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:03:08,613 INFO L93 Difference]: Finished difference Result 1521074 states and 2112765 transitions. [2019-09-10 04:03:08,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 04:03:08,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-09-10 04:03:08,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:03:13,970 INFO L225 Difference]: With dead ends: 1521074 [2019-09-10 04:03:13,970 INFO L226 Difference]: Without dead ends: 1521074 [2019-09-10 04:03:13,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:03:14,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521074 states. [2019-09-10 04:04:02,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521074 to 1520794. [2019-09-10 04:04:02,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1520794 states.