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.5.2.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:04:46,057 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:04:46,059 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:04:46,071 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:04:46,071 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:04:46,072 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:04:46,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:04:46,075 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:04:46,077 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:04:46,078 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:04:46,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:04:46,080 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:04:46,080 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:04:46,081 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:04:46,082 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:04:46,083 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:04:46,084 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:04:46,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:04:46,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:04:46,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:04:46,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:04:46,091 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:04:46,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:04:46,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:04:46,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:04:46,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:04:46,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:04:46,096 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:04:46,096 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:04:46,097 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:04:46,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:04:46,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:04:46,099 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:04:46,100 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:04:46,101 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:04:46,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:04:46,102 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:04:46,102 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:04:46,102 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:04:46,103 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:04:46,104 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:04:46,104 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 04:04:46,119 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:04:46,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:04:46,120 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:04:46,120 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:04:46,120 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:04:46,121 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:04:46,121 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:04:46,121 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:04:46,121 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:04:46,121 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:04:46,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:04:46,122 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:04:46,123 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:04:46,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:04:46,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:04:46,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:04:46,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:04:46,123 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:04:46,124 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:04:46,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:04:46,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:04:46,124 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:04:46,124 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:04:46,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:04:46,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:04:46,125 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:04:46,125 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:04:46,125 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:04:46,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:04:46,126 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:04:46,154 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:04:46,166 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:04:46,169 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:04:46,171 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:04:46,171 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:04:46,172 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_floodmax.5.2.ufo.UNBOUNDED.pals.c [2019-09-10 04:04:46,229 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c42b3aaa/313a8ab76a734a20b7671d6b39e73677/FLAGe1a225a26 [2019-09-10 04:04:46,801 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:04:46,802 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_floodmax.5.2.ufo.UNBOUNDED.pals.c [2019-09-10 04:04:46,836 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c42b3aaa/313a8ab76a734a20b7671d6b39e73677/FLAGe1a225a26 [2019-09-10 04:04:47,054 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c42b3aaa/313a8ab76a734a20b7671d6b39e73677 [2019-09-10 04:04:47,066 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:04:47,068 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:04:47,069 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:04:47,070 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:04:47,075 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:04:47,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:04:47" (1/1) ... [2019-09-10 04:04:47,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74340391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:47, skipping insertion in model container [2019-09-10 04:04:47,079 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:04:47" (1/1) ... [2019-09-10 04:04:47,087 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:04:47,171 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:04:47,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:04:47,743 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:04:47,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:04:47,967 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:04:47,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:47 WrapperNode [2019-09-10 04:04:47,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:04:47,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:04:47,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:04:47,969 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:04:47,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:47" (1/1) ... [2019-09-10 04:04:47,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:47" (1/1) ... [2019-09-10 04:04:48,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:47" (1/1) ... [2019-09-10 04:04:48,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:47" (1/1) ... [2019-09-10 04:04:48,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:47" (1/1) ... [2019-09-10 04:04:48,109 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:47" (1/1) ... [2019-09-10 04:04:48,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:47" (1/1) ... [2019-09-10 04:04:48,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:04:48,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:04:48,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:04:48,140 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:04:48,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:47" (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 04:04:48,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:04:48,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:04:48,212 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:04:48,212 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:04:48,212 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:04:48,212 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:04:48,212 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-10 04:04:48,213 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:04:48,213 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:04:48,214 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:04:48,214 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:04:48,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:04:48,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:04:48,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 04:04:48,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:04:48,216 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:04:48,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:04:48,217 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:04:48,217 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:04:48,217 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:04:48,217 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:04:48,217 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:04:48,218 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:04:48,218 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 04:04:48,218 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:04:48,219 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:04:48,219 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:04:48,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:04:48,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:04:50,524 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:04:50,524 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:04:50,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:04:50 BoogieIcfgContainer [2019-09-10 04:04:50,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:04:50,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:04:50,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:04:50,532 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:04:50,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:04:47" (1/3) ... [2019-09-10 04:04:50,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3798f572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:04:50, skipping insertion in model container [2019-09-10 04:04:50,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:04:47" (2/3) ... [2019-09-10 04:04:50,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3798f572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:04:50, skipping insertion in model container [2019-09-10 04:04:50,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:04:50" (3/3) ... [2019-09-10 04:04:50,539 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.2.ufo.UNBOUNDED.pals.c [2019-09-10 04:04:50,552 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:04:50,564 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:04:50,586 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:04:50,625 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:04:50,625 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:04:50,626 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:04:50,626 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:04:50,626 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:04:50,626 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:04:50,626 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:04:50,626 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:04:50,674 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states. [2019-09-10 04:04:50,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 04:04:50,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:04:50,715 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:50,717 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:04:50,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:04:50,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1909906807, now seen corresponding path program 1 times [2019-09-10 04:04:50,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:04:50,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:50,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:04:50,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:50,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:04:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:04:51,493 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:04:51,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:04:51,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:04:51,496 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:04:51,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:04:51,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:04:51,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:04:51,521 INFO L87 Difference]: Start difference. First operand 741 states. Second operand 5 states. [2019-09-10 04:04:51,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:04:51,781 INFO L93 Difference]: Finished difference Result 740 states and 1338 transitions. [2019-09-10 04:04:51,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:04:51,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 04:04:51,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:04:51,809 INFO L225 Difference]: With dead ends: 740 [2019-09-10 04:04:51,810 INFO L226 Difference]: Without dead ends: 736 [2019-09-10 04:04:51,812 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 04:04:51,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-09-10 04:04:51,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736. [2019-09-10 04:04:51,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-09-10 04:04:51,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1275 transitions. [2019-09-10 04:04:51,969 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1275 transitions. Word has length 176 [2019-09-10 04:04:51,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:04:51,972 INFO L475 AbstractCegarLoop]: Abstraction has 736 states and 1275 transitions. [2019-09-10 04:04:51,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:04:51,972 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1275 transitions. [2019-09-10 04:04:51,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-10 04:04:51,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:04:51,984 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:51,984 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:04:51,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:04:51,986 INFO L82 PathProgramCache]: Analyzing trace with hash -268525100, now seen corresponding path program 1 times [2019-09-10 04:04:51,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:04:51,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:51,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:04:51,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:04:51,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:04:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:04:52,674 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:04:52,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:04:52,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:04:52,675 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:04:52,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:04:52,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:04:52,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:04:52,678 INFO L87 Difference]: Start difference. First operand 736 states and 1275 transitions. Second operand 13 states. [2019-09-10 04:05:06,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:05:06,534 INFO L93 Difference]: Finished difference Result 2822 states and 4739 transitions. [2019-09-10 04:05:06,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 04:05:06,535 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 235 [2019-09-10 04:05:06,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:05:06,564 INFO L225 Difference]: With dead ends: 2822 [2019-09-10 04:05:06,564 INFO L226 Difference]: Without dead ends: 2822 [2019-09-10 04:05:06,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=631, Invalid=2125, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 04:05:06,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822 states. [2019-09-10 04:05:06,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 2030. [2019-09-10 04:05:06,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2030 states. [2019-09-10 04:05:06,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 3422 transitions. [2019-09-10 04:05:06,687 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 3422 transitions. Word has length 235 [2019-09-10 04:05:06,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:05:06,689 INFO L475 AbstractCegarLoop]: Abstraction has 2030 states and 3422 transitions. [2019-09-10 04:05:06,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:05:06,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 3422 transitions. [2019-09-10 04:05:06,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-10 04:05:06,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:05:06,697 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:06,697 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:05:06,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:05:06,697 INFO L82 PathProgramCache]: Analyzing trace with hash -699503355, now seen corresponding path program 1 times [2019-09-10 04:05:06,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:05:06,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:06,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:05:06,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:06,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:05:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:05:07,075 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:05:07,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:05:07,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:05:07,085 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:05:07,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:05:07,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:05:07,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:05:07,088 INFO L87 Difference]: Start difference. First operand 2030 states and 3422 transitions. Second operand 6 states. [2019-09-10 04:05:10,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:05:10,799 INFO L93 Difference]: Finished difference Result 3536 states and 5901 transitions. [2019-09-10 04:05:10,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:05:10,800 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 236 [2019-09-10 04:05:10,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:05:10,819 INFO L225 Difference]: With dead ends: 3536 [2019-09-10 04:05:10,819 INFO L226 Difference]: Without dead ends: 3536 [2019-09-10 04:05:10,819 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 04:05:10,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3536 states. [2019-09-10 04:05:10,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3536 to 3345. [2019-09-10 04:05:10,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3345 states. [2019-09-10 04:05:10,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3345 states to 3345 states and 5590 transitions. [2019-09-10 04:05:10,905 INFO L78 Accepts]: Start accepts. Automaton has 3345 states and 5590 transitions. Word has length 236 [2019-09-10 04:05:10,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:05:10,906 INFO L475 AbstractCegarLoop]: Abstraction has 3345 states and 5590 transitions. [2019-09-10 04:05:10,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:05:10,906 INFO L276 IsEmpty]: Start isEmpty. Operand 3345 states and 5590 transitions. [2019-09-10 04:05:10,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 04:05:10,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:05:10,912 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:10,912 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:05:10,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:05:10,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1226612309, now seen corresponding path program 1 times [2019-09-10 04:05:10,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:05:10,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:10,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:05:10,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:10,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:05:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:05:11,312 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:05:11,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:05:11,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:05:11,313 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:05:11,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:05:11,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:05:11,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:05:11,314 INFO L87 Difference]: Start difference. First operand 3345 states and 5590 transitions. Second operand 6 states. [2019-09-10 04:05:15,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:05:15,627 INFO L93 Difference]: Finished difference Result 6581 states and 10898 transitions. [2019-09-10 04:05:15,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:05:15,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 237 [2019-09-10 04:05:15,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:05:15,660 INFO L225 Difference]: With dead ends: 6581 [2019-09-10 04:05:15,660 INFO L226 Difference]: Without dead ends: 6581 [2019-09-10 04:05:15,660 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 04:05:15,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6581 states. [2019-09-10 04:05:15,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6581 to 5617. [2019-09-10 04:05:15,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5617 states. [2019-09-10 04:05:15,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5617 states to 5617 states and 9313 transitions. [2019-09-10 04:05:15,813 INFO L78 Accepts]: Start accepts. Automaton has 5617 states and 9313 transitions. Word has length 237 [2019-09-10 04:05:15,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:05:15,814 INFO L475 AbstractCegarLoop]: Abstraction has 5617 states and 9313 transitions. [2019-09-10 04:05:15,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:05:15,814 INFO L276 IsEmpty]: Start isEmpty. Operand 5617 states and 9313 transitions. [2019-09-10 04:05:15,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-10 04:05:15,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:05:15,821 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:15,821 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:05:15,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:05:15,822 INFO L82 PathProgramCache]: Analyzing trace with hash -438805636, now seen corresponding path program 1 times [2019-09-10 04:05:15,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:05:15,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:15,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:05:15,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:15,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:05:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:05:16,105 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:05:16,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:05:16,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:05:16,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:05:16,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:05:16,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:05:16,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:05:16,108 INFO L87 Difference]: Start difference. First operand 5617 states and 9313 transitions. Second operand 6 states. [2019-09-10 04:05:19,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:05:19,821 INFO L93 Difference]: Finished difference Result 16870 states and 27741 transitions. [2019-09-10 04:05:19,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:05:19,824 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 238 [2019-09-10 04:05:19,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:05:19,896 INFO L225 Difference]: With dead ends: 16870 [2019-09-10 04:05:19,897 INFO L226 Difference]: Without dead ends: 16870 [2019-09-10 04:05:19,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 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 04:05:19,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16870 states. [2019-09-10 04:05:20,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16870 to 13926. [2019-09-10 04:05:20,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13926 states. [2019-09-10 04:05:20,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13926 states to 13926 states and 22887 transitions. [2019-09-10 04:05:20,361 INFO L78 Accepts]: Start accepts. Automaton has 13926 states and 22887 transitions. Word has length 238 [2019-09-10 04:05:20,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:05:20,362 INFO L475 AbstractCegarLoop]: Abstraction has 13926 states and 22887 transitions. [2019-09-10 04:05:20,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:05:20,362 INFO L276 IsEmpty]: Start isEmpty. Operand 13926 states and 22887 transitions. [2019-09-10 04:05:20,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 04:05:20,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:05:20,375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:20,375 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:05:20,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:05:20,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1838287486, now seen corresponding path program 1 times [2019-09-10 04:05:20,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:05:20,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:20,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:05:20,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:20,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:05:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:05:20,625 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:05:20,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:05:20,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:05:20,626 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:05:20,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:05:20,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:05:20,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:05:20,627 INFO L87 Difference]: Start difference. First operand 13926 states and 22887 transitions. Second operand 6 states. [2019-09-10 04:05:25,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:05:25,430 INFO L93 Difference]: Finished difference Result 66864 states and 109446 transitions. [2019-09-10 04:05:25,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 04:05:25,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 239 [2019-09-10 04:05:25,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:05:25,674 INFO L225 Difference]: With dead ends: 66864 [2019-09-10 04:05:25,676 INFO L226 Difference]: Without dead ends: 66864 [2019-09-10 04:05:25,680 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 04:05:25,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66864 states. [2019-09-10 04:05:27,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66864 to 66712. [2019-09-10 04:05:27,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66712 states. [2019-09-10 04:05:27,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66712 states to 66712 states and 109154 transitions. [2019-09-10 04:05:27,904 INFO L78 Accepts]: Start accepts. Automaton has 66712 states and 109154 transitions. Word has length 239 [2019-09-10 04:05:27,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:05:27,906 INFO L475 AbstractCegarLoop]: Abstraction has 66712 states and 109154 transitions. [2019-09-10 04:05:27,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:05:27,906 INFO L276 IsEmpty]: Start isEmpty. Operand 66712 states and 109154 transitions. [2019-09-10 04:05:27,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 04:05:27,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:05:27,917 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:27,917 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:05:27,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:05:27,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1970730483, now seen corresponding path program 1 times [2019-09-10 04:05:27,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:05:27,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:27,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:05:27,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:27,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:05:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:05:29,195 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:05:29,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:05:29,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 04:05:29,196 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:05:29,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 04:05:29,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 04:05:29,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:05:29,198 INFO L87 Difference]: Start difference. First operand 66712 states and 109154 transitions. Second operand 6 states. [2019-09-10 04:05:34,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:05:34,216 INFO L93 Difference]: Finished difference Result 236460 states and 386388 transitions. [2019-09-10 04:05:34,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:05:34,216 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-10 04:05:34,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:05:35,097 INFO L225 Difference]: With dead ends: 236460 [2019-09-10 04:05:35,097 INFO L226 Difference]: Without dead ends: 236460 [2019-09-10 04:05:35,098 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 04:05:35,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236460 states. [2019-09-10 04:05:38,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236460 to 169720. [2019-09-10 04:05:38,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169720 states. [2019-09-10 04:05:42,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169720 states to 169720 states and 276953 transitions. [2019-09-10 04:05:42,355 INFO L78 Accepts]: Start accepts. Automaton has 169720 states and 276953 transitions. Word has length 240 [2019-09-10 04:05:42,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:05:42,356 INFO L475 AbstractCegarLoop]: Abstraction has 169720 states and 276953 transitions. [2019-09-10 04:05:42,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 04:05:42,356 INFO L276 IsEmpty]: Start isEmpty. Operand 169720 states and 276953 transitions. [2019-09-10 04:05:42,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-10 04:05:42,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:05:42,366 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:42,367 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:05:42,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:05:42,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1025117066, now seen corresponding path program 1 times [2019-09-10 04:05:42,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:05:42,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:42,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:05:42,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:05:42,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:05:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:05:42,773 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:05:42,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:05:42,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:05:42,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:05:42,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:05:42,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:05:42,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:05:42,775 INFO L87 Difference]: Start difference. First operand 169720 states and 276953 transitions. Second operand 13 states. [2019-09-10 04:06:00,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:06:00,043 INFO L93 Difference]: Finished difference Result 256896 states and 419846 transitions. [2019-09-10 04:06:00,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-10 04:06:00,044 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 242 [2019-09-10 04:06:00,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:06:00,752 INFO L225 Difference]: With dead ends: 256896 [2019-09-10 04:06:00,753 INFO L226 Difference]: Without dead ends: 256896 [2019-09-10 04:06:00,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1819 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1002, Invalid=4254, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 04:06:00,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256896 states. [2019-09-10 04:06:04,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256896 to 233854. [2019-09-10 04:06:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233854 states. [2019-09-10 04:06:04,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233854 states to 233854 states and 382326 transitions. [2019-09-10 04:06:04,794 INFO L78 Accepts]: Start accepts. Automaton has 233854 states and 382326 transitions. Word has length 242 [2019-09-10 04:06:04,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:06:04,795 INFO L475 AbstractCegarLoop]: Abstraction has 233854 states and 382326 transitions. [2019-09-10 04:06:04,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:06:04,795 INFO L276 IsEmpty]: Start isEmpty. Operand 233854 states and 382326 transitions. [2019-09-10 04:06:04,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-10 04:06:04,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:06:04,812 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:04,813 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:06:04,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:06:04,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1376652368, now seen corresponding path program 1 times [2019-09-10 04:06:04,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:06:04,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:04,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:06:04,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:04,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:06:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:06:09,256 WARN L188 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2019-09-10 04:06:09,341 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:06:09,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:06:09,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:06:09,341 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:06:09,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:06:09,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:06:09,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:06:09,344 INFO L87 Difference]: Start difference. First operand 233854 states and 382326 transitions. Second operand 13 states. [2019-09-10 04:06:24,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:06:24,763 INFO L93 Difference]: Finished difference Result 307446 states and 504139 transitions. [2019-09-10 04:06:24,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-10 04:06:24,764 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 242 [2019-09-10 04:06:24,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:06:25,466 INFO L225 Difference]: With dead ends: 307446 [2019-09-10 04:06:25,466 INFO L226 Difference]: Without dead ends: 307446 [2019-09-10 04:06:25,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1002, Invalid=4254, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 04:06:25,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307446 states. [2019-09-10 04:06:29,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307446 to 265306. [2019-09-10 04:06:29,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265306 states. [2019-09-10 04:06:30,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265306 states to 265306 states and 434221 transitions. [2019-09-10 04:06:30,179 INFO L78 Accepts]: Start accepts. Automaton has 265306 states and 434221 transitions. Word has length 242 [2019-09-10 04:06:30,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:06:30,179 INFO L475 AbstractCegarLoop]: Abstraction has 265306 states and 434221 transitions. [2019-09-10 04:06:30,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:06:30,180 INFO L276 IsEmpty]: Start isEmpty. Operand 265306 states and 434221 transitions. [2019-09-10 04:06:30,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-10 04:06:30,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:06:30,186 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:30,186 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:06:30,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:06:30,187 INFO L82 PathProgramCache]: Analyzing trace with hash -694496930, now seen corresponding path program 1 times [2019-09-10 04:06:30,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:06:30,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:30,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:06:30,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:30,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:06:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:06:30,499 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:06:30,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:06:30,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:06:30,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:06:30,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:06:30,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:06:30,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:06:30,501 INFO L87 Difference]: Start difference. First operand 265306 states and 434221 transitions. Second operand 13 states. [2019-09-10 04:06:37,438 WARN L188 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 13 [2019-09-10 04:06:49,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:06:49,645 INFO L93 Difference]: Finished difference Result 332291 states and 544822 transitions. [2019-09-10 04:06:49,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-10 04:06:49,645 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 242 [2019-09-10 04:06:49,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:06:50,410 INFO L225 Difference]: With dead ends: 332291 [2019-09-10 04:06:50,410 INFO L226 Difference]: Without dead ends: 332291 [2019-09-10 04:06:50,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2105 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1095, Invalid=4757, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 04:06:50,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332291 states. [2019-09-10 04:06:58,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332291 to 287769. [2019-09-10 04:06:58,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287769 states. [2019-09-10 04:06:59,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287769 states to 287769 states and 471387 transitions. [2019-09-10 04:06:59,464 INFO L78 Accepts]: Start accepts. Automaton has 287769 states and 471387 transitions. Word has length 242 [2019-09-10 04:06:59,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:06:59,464 INFO L475 AbstractCegarLoop]: Abstraction has 287769 states and 471387 transitions. [2019-09-10 04:06:59,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:06:59,464 INFO L276 IsEmpty]: Start isEmpty. Operand 287769 states and 471387 transitions. [2019-09-10 04:06:59,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-10 04:06:59,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:06:59,474 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:59,475 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:06:59,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:06:59,476 INFO L82 PathProgramCache]: Analyzing trace with hash 2014276523, now seen corresponding path program 1 times [2019-09-10 04:06:59,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:06:59,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:59,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:06:59,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:06:59,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:06:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:07:00,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 04:07:00,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:07:00,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 04:07:00,542 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:07:00,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 04:07:00,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 04:07:00,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 04:07:00,543 INFO L87 Difference]: Start difference. First operand 287769 states and 471387 transitions. Second operand 4 states. [2019-09-10 04:07:09,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:07:09,386 INFO L93 Difference]: Finished difference Result 758329 states and 1236153 transitions. [2019-09-10 04:07:09,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 04:07:09,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2019-09-10 04:07:09,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:07:11,033 INFO L225 Difference]: With dead ends: 758329 [2019-09-10 04:07:11,033 INFO L226 Difference]: Without dead ends: 758329 [2019-09-10 04:07:11,033 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:07:11,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758329 states. [2019-09-10 04:07:24,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758329 to 754041. [2019-09-10 04:07:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754041 states. [2019-09-10 04:07:38,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754041 states to 754041 states and 1230443 transitions. [2019-09-10 04:07:38,183 INFO L78 Accepts]: Start accepts. Automaton has 754041 states and 1230443 transitions. Word has length 242 [2019-09-10 04:07:38,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:07:38,184 INFO L475 AbstractCegarLoop]: Abstraction has 754041 states and 1230443 transitions. [2019-09-10 04:07:38,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 04:07:38,184 INFO L276 IsEmpty]: Start isEmpty. Operand 754041 states and 1230443 transitions. [2019-09-10 04:07:38,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-10 04:07:38,195 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:07:38,195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:38,196 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:07:38,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:07:38,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1607107123, now seen corresponding path program 1 times [2019-09-10 04:07:38,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:07:38,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:07:38,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:07:38,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:07:38,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:07:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:07:38,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:07:38,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:07:38,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-10 04:07:38,541 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:07:38,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-10 04:07:38,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-10 04:07:38,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-09-10 04:07:38,542 INFO L87 Difference]: Start difference. First operand 754041 states and 1230443 transitions. Second operand 14 states. [2019-09-10 04:08:14,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:08:14,858 INFO L93 Difference]: Finished difference Result 1878891 states and 3162662 transitions. [2019-09-10 04:08:14,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-10 04:08:14,859 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 243 [2019-09-10 04:08:14,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:08:35,072 INFO L225 Difference]: With dead ends: 1878891 [2019-09-10 04:08:35,072 INFO L226 Difference]: Without dead ends: 1878891 [2019-09-10 04:08:35,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2613 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1420, Invalid=5720, Unknown=0, NotChecked=0, Total=7140 [2019-09-10 04:08:36,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878891 states. [2019-09-10 04:09:27,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878891 to 1740798. [2019-09-10 04:09:27,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1740798 states.