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-reduced/pals_floodmax.4.3.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:21:49,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:21:49,070 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:21:49,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:21:49,082 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:21:49,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:21:49,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:21:49,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:21:49,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:21:49,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:21:49,090 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:21:49,091 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:21:49,091 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:21:49,092 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:21:49,093 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:21:49,094 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:21:49,095 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:21:49,096 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:21:49,098 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:21:49,099 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:21:49,101 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:21:49,102 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:21:49,103 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:21:49,104 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:21:49,106 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:21:49,106 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:21:49,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:21:49,107 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:21:49,108 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:21:49,109 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:21:49,109 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:21:49,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:21:49,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:21:49,111 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:21:49,112 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:21:49,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:21:49,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:21:49,113 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:21:49,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:21:49,115 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:21:49,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:21:49,116 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 06:21:49,133 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:21:49,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:21:49,133 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:21:49,133 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:21:49,134 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:21:49,134 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:21:49,135 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:21:49,135 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:21:49,135 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:21:49,137 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:21:49,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:21:49,138 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:21:49,139 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:21:49,139 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:21:49,139 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:21:49,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:21:49,140 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:21:49,140 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:21:49,140 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:21:49,140 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:21:49,140 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:21:49,141 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:21:49,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:21:49,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:21:49,142 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:21:49,142 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:21:49,142 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:21:49,142 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:21:49,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:21:49,143 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:21:49,189 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:21:49,206 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:21:49,212 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:21:49,216 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:21:49,216 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:21:49,217 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 06:21:49,286 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6c44656e/706feea89f8a45fdba188a046617fb12/FLAGeedcaaa6b [2019-09-10 06:21:49,969 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:21:49,971 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.3.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 06:21:49,985 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6c44656e/706feea89f8a45fdba188a046617fb12/FLAGeedcaaa6b [2019-09-10 06:21:50,182 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6c44656e/706feea89f8a45fdba188a046617fb12 [2019-09-10 06:21:50,191 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:21:50,193 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:21:50,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:21:50,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:21:50,198 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:21:50,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:21:50" (1/1) ... [2019-09-10 06:21:50,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e80a95e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:50, skipping insertion in model container [2019-09-10 06:21:50,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:21:50" (1/1) ... [2019-09-10 06:21:50,211 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:21:50,323 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:21:51,432 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:21:51,463 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:21:51,860 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:21:51,881 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:21:51,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:51 WrapperNode [2019-09-10 06:21:51,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:21:51,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:21:51,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:21:51,883 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:21:51,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:51" (1/1) ... [2019-09-10 06:21:51,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:51" (1/1) ... [2019-09-10 06:21:51,923 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:51" (1/1) ... [2019-09-10 06:21:51,923 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:51" (1/1) ... [2019-09-10 06:21:51,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:51" (1/1) ... [2019-09-10 06:21:52,005 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:51" (1/1) ... [2019-09-10 06:21:52,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:51" (1/1) ... [2019-09-10 06:21:52,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:21:52,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:21:52,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:21:52,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:21:52,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:51" (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 06:21:52,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:21:52,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:21:52,094 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:21:52,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:21:52,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:21:52,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:21:52,095 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:21:52,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:21:52,095 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:21:52,095 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:21:52,095 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:21:52,096 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:21:52,096 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:21:52,096 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:21:52,096 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:21:52,096 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:21:52,097 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:21:52,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:21:52,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:21:54,305 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:21:54,306 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:21:54,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:21:54 BoogieIcfgContainer [2019-09-10 06:21:54,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:21:54,308 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:21:54,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:21:54,312 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:21:54,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:21:50" (1/3) ... [2019-09-10 06:21:54,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a6d812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:21:54, skipping insertion in model container [2019-09-10 06:21:54,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:21:51" (2/3) ... [2019-09-10 06:21:54,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a6d812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:21:54, skipping insertion in model container [2019-09-10 06:21:54,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:21:54" (3/3) ... [2019-09-10 06:21:54,316 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.3.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2019-09-10 06:21:54,325 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:21:54,333 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:21:54,350 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:21:54,376 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:21:54,376 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:21:54,376 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:21:54,376 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:21:54,376 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:21:54,376 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:21:54,377 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:21:54,377 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:21:54,405 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states. [2019-09-10 06:21:54,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 06:21:54,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:54,439 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:21:54,441 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:54,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:54,446 INFO L82 PathProgramCache]: Analyzing trace with hash 858579338, now seen corresponding path program 1 times [2019-09-10 06:21:54,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:54,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:54,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:54,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:54,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:55,469 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 06:21:55,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:55,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:21:55,472 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:55,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:21:55,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:21:55,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:55,499 INFO L87 Difference]: Start difference. First operand 724 states. Second operand 3 states. [2019-09-10 06:21:55,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:55,873 INFO L93 Difference]: Finished difference Result 1166 states and 2064 transitions. [2019-09-10 06:21:55,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:21:55,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-09-10 06:21:55,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:55,935 INFO L225 Difference]: With dead ends: 1166 [2019-09-10 06:21:55,938 INFO L226 Difference]: Without dead ends: 1158 [2019-09-10 06:21:55,940 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 06:21:55,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-09-10 06:21:56,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1156. [2019-09-10 06:21:56,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2019-09-10 06:21:56,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1795 transitions. [2019-09-10 06:21:56,116 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1795 transitions. Word has length 308 [2019-09-10 06:21:56,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:56,118 INFO L475 AbstractCegarLoop]: Abstraction has 1156 states and 1795 transitions. [2019-09-10 06:21:56,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:21:56,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1795 transitions. [2019-09-10 06:21:56,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 06:21:56,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:56,127 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:21:56,128 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:56,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:56,128 INFO L82 PathProgramCache]: Analyzing trace with hash 165879038, now seen corresponding path program 1 times [2019-09-10 06:21:56,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:56,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:56,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:56,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:56,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:56,639 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 06:21:56,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:56,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:21:56,640 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:56,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:21:56,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:21:56,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:56,647 INFO L87 Difference]: Start difference. First operand 1156 states and 1795 transitions. Second operand 3 states. [2019-09-10 06:21:56,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:56,882 INFO L93 Difference]: Finished difference Result 2014 states and 3118 transitions. [2019-09-10 06:21:56,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:21:56,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-09-10 06:21:56,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:56,900 INFO L225 Difference]: With dead ends: 2014 [2019-09-10 06:21:56,901 INFO L226 Difference]: Without dead ends: 2014 [2019-09-10 06:21:56,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:56,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2019-09-10 06:21:56,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 2012. [2019-09-10 06:21:56,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-09-10 06:21:56,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 3117 transitions. [2019-09-10 06:21:56,990 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 3117 transitions. Word has length 308 [2019-09-10 06:21:56,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:56,992 INFO L475 AbstractCegarLoop]: Abstraction has 2012 states and 3117 transitions. [2019-09-10 06:21:56,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:21:56,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 3117 transitions. [2019-09-10 06:21:57,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 06:21:57,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:57,004 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:21:57,004 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:57,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:57,006 INFO L82 PathProgramCache]: Analyzing trace with hash 853287994, now seen corresponding path program 1 times [2019-09-10 06:21:57,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:57,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:57,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:57,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:57,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:57,464 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 06:21:57,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:57,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:21:57,465 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:57,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:21:57,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:21:57,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:57,469 INFO L87 Difference]: Start difference. First operand 2012 states and 3117 transitions. Second operand 3 states. [2019-09-10 06:21:57,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:57,665 INFO L93 Difference]: Finished difference Result 3694 states and 5702 transitions. [2019-09-10 06:21:57,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:21:57,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-09-10 06:21:57,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:57,689 INFO L225 Difference]: With dead ends: 3694 [2019-09-10 06:21:57,690 INFO L226 Difference]: Without dead ends: 3694 [2019-09-10 06:21:57,690 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 06:21:57,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3694 states. [2019-09-10 06:21:57,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3694 to 3692. [2019-09-10 06:21:57,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3692 states. [2019-09-10 06:21:57,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3692 states to 3692 states and 5701 transitions. [2019-09-10 06:21:57,818 INFO L78 Accepts]: Start accepts. Automaton has 3692 states and 5701 transitions. Word has length 308 [2019-09-10 06:21:57,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:57,819 INFO L475 AbstractCegarLoop]: Abstraction has 3692 states and 5701 transitions. [2019-09-10 06:21:57,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:21:57,819 INFO L276 IsEmpty]: Start isEmpty. Operand 3692 states and 5701 transitions. [2019-09-10 06:21:57,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 06:21:57,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:57,830 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:21:57,831 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:57,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:57,831 INFO L82 PathProgramCache]: Analyzing trace with hash -485468594, now seen corresponding path program 1 times [2019-09-10 06:21:57,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:57,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:57,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:57,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:57,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:58,321 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 06:21:58,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:58,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:21:58,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:58,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:21:58,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:21:58,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:21:58,324 INFO L87 Difference]: Start difference. First operand 3692 states and 5701 transitions. Second operand 3 states. [2019-09-10 06:21:58,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:58,553 INFO L93 Difference]: Finished difference Result 6990 states and 10750 transitions. [2019-09-10 06:21:58,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:21:58,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-09-10 06:21:58,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:58,587 INFO L225 Difference]: With dead ends: 6990 [2019-09-10 06:21:58,587 INFO L226 Difference]: Without dead ends: 6990 [2019-09-10 06:21:58,588 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 06:21:58,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6990 states. [2019-09-10 06:21:58,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6990 to 6988. [2019-09-10 06:21:58,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6988 states. [2019-09-10 06:21:58,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6988 states to 6988 states and 10749 transitions. [2019-09-10 06:21:58,781 INFO L78 Accepts]: Start accepts. Automaton has 6988 states and 10749 transitions. Word has length 308 [2019-09-10 06:21:58,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:21:58,781 INFO L475 AbstractCegarLoop]: Abstraction has 6988 states and 10749 transitions. [2019-09-10 06:21:58,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:21:58,782 INFO L276 IsEmpty]: Start isEmpty. Operand 6988 states and 10749 transitions. [2019-09-10 06:21:58,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 06:21:58,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:21:58,799 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:21:58,799 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:21:58,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:21:58,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1823125226, now seen corresponding path program 1 times [2019-09-10 06:21:58,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:21:58,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:58,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:21:58,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:21:58,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:21:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:21:59,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 06:21:59,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:21:59,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:21:59,681 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:21:59,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:21:59,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:21:59,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:21:59,682 INFO L87 Difference]: Start difference. First operand 6988 states and 10749 transitions. Second operand 4 states. [2019-09-10 06:21:59,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:21:59,892 INFO L93 Difference]: Finished difference Result 13713 states and 20971 transitions. [2019-09-10 06:21:59,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:21:59,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-09-10 06:21:59,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:21:59,955 INFO L225 Difference]: With dead ends: 13713 [2019-09-10 06:21:59,955 INFO L226 Difference]: Without dead ends: 13713 [2019-09-10 06:21:59,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 06:21:59,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13713 states. [2019-09-10 06:22:00,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13713 to 13711. [2019-09-10 06:22:00,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13711 states. [2019-09-10 06:22:00,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13711 states to 13711 states and 20970 transitions. [2019-09-10 06:22:00,381 INFO L78 Accepts]: Start accepts. Automaton has 13711 states and 20970 transitions. Word has length 308 [2019-09-10 06:22:00,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:00,381 INFO L475 AbstractCegarLoop]: Abstraction has 13711 states and 20970 transitions. [2019-09-10 06:22:00,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:22:00,381 INFO L276 IsEmpty]: Start isEmpty. Operand 13711 states and 20970 transitions. [2019-09-10 06:22:00,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-10 06:22:00,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:00,420 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:00,420 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:00,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:00,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1863537621, now seen corresponding path program 1 times [2019-09-10 06:22:00,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:00,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:00,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:00,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:00,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:00,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:00,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:00,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:00,581 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:00,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:00,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:00,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:00,582 INFO L87 Difference]: Start difference. First operand 13711 states and 20970 transitions. Second operand 3 states. [2019-09-10 06:22:00,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:00,725 INFO L93 Difference]: Finished difference Result 27402 states and 41905 transitions. [2019-09-10 06:22:00,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:00,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-10 06:22:00,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:00,784 INFO L225 Difference]: With dead ends: 27402 [2019-09-10 06:22:00,784 INFO L226 Difference]: Without dead ends: 27402 [2019-09-10 06:22:00,785 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 06:22:00,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27402 states. [2019-09-10 06:22:01,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27402 to 13724. [2019-09-10 06:22:01,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13724 states. [2019-09-10 06:22:01,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13724 states to 13724 states and 20989 transitions. [2019-09-10 06:22:01,223 INFO L78 Accepts]: Start accepts. Automaton has 13724 states and 20989 transitions. Word has length 310 [2019-09-10 06:22:01,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:01,224 INFO L475 AbstractCegarLoop]: Abstraction has 13724 states and 20989 transitions. [2019-09-10 06:22:01,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:01,224 INFO L276 IsEmpty]: Start isEmpty. Operand 13724 states and 20989 transitions. [2019-09-10 06:22:01,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-10 06:22:01,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:01,258 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:01,259 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:01,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:01,259 INFO L82 PathProgramCache]: Analyzing trace with hash -978100656, now seen corresponding path program 1 times [2019-09-10 06:22:01,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:01,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:01,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:01,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:01,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:01,491 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 06:22:01,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:01,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:01,492 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:01,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:01,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:01,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:01,493 INFO L87 Difference]: Start difference. First operand 13724 states and 20989 transitions. Second operand 3 states. [2019-09-10 06:22:01,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:01,672 INFO L93 Difference]: Finished difference Result 26929 states and 40942 transitions. [2019-09-10 06:22:01,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:01,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-10 06:22:01,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:01,735 INFO L225 Difference]: With dead ends: 26929 [2019-09-10 06:22:01,735 INFO L226 Difference]: Without dead ends: 26929 [2019-09-10 06:22:01,736 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 06:22:01,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26929 states. [2019-09-10 06:22:02,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26929 to 26927. [2019-09-10 06:22:02,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26927 states. [2019-09-10 06:22:02,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26927 states to 26927 states and 40941 transitions. [2019-09-10 06:22:02,278 INFO L78 Accepts]: Start accepts. Automaton has 26927 states and 40941 transitions. Word has length 310 [2019-09-10 06:22:02,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:02,278 INFO L475 AbstractCegarLoop]: Abstraction has 26927 states and 40941 transitions. [2019-09-10 06:22:02,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:02,279 INFO L276 IsEmpty]: Start isEmpty. Operand 26927 states and 40941 transitions. [2019-09-10 06:22:02,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-10 06:22:02,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:02,332 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:02,333 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:02,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:02,333 INFO L82 PathProgramCache]: Analyzing trace with hash 683032688, now seen corresponding path program 1 times [2019-09-10 06:22:02,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:02,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:02,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:02,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:02,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:02,479 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 06:22:02,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:02,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:02,480 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:02,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:02,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:02,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:02,481 INFO L87 Difference]: Start difference. First operand 26927 states and 40941 transitions. Second operand 3 states. [2019-09-10 06:22:02,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:02,670 INFO L93 Difference]: Finished difference Result 53801 states and 81787 transitions. [2019-09-10 06:22:02,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:02,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-09-10 06:22:02,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:02,822 INFO L225 Difference]: With dead ends: 53801 [2019-09-10 06:22:02,822 INFO L226 Difference]: Without dead ends: 53801 [2019-09-10 06:22:02,823 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 06:22:02,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53801 states. [2019-09-10 06:22:04,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53801 to 26945. [2019-09-10 06:22:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26945 states. [2019-09-10 06:22:04,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26945 states to 26945 states and 40962 transitions. [2019-09-10 06:22:04,405 INFO L78 Accepts]: Start accepts. Automaton has 26945 states and 40962 transitions. Word has length 311 [2019-09-10 06:22:04,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:04,405 INFO L475 AbstractCegarLoop]: Abstraction has 26945 states and 40962 transitions. [2019-09-10 06:22:04,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:04,405 INFO L276 IsEmpty]: Start isEmpty. Operand 26945 states and 40962 transitions. [2019-09-10 06:22:04,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-10 06:22:04,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:04,446 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:04,447 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:04,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:04,447 INFO L82 PathProgramCache]: Analyzing trace with hash 51576747, now seen corresponding path program 1 times [2019-09-10 06:22:04,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:04,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:04,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:04,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:04,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:04,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:04,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:04,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:04,720 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:04,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:04,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:04,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:04,722 INFO L87 Difference]: Start difference. First operand 26945 states and 40962 transitions. Second operand 3 states. [2019-09-10 06:22:04,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:04,950 INFO L93 Difference]: Finished difference Result 49806 states and 75171 transitions. [2019-09-10 06:22:04,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:04,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-10 06:22:04,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:05,051 INFO L225 Difference]: With dead ends: 49806 [2019-09-10 06:22:05,052 INFO L226 Difference]: Without dead ends: 49806 [2019-09-10 06:22:05,053 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 06:22:05,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49806 states. [2019-09-10 06:22:05,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49806 to 49804. [2019-09-10 06:22:05,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49804 states. [2019-09-10 06:22:05,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49804 states to 49804 states and 75170 transitions. [2019-09-10 06:22:05,966 INFO L78 Accepts]: Start accepts. Automaton has 49804 states and 75170 transitions. Word has length 312 [2019-09-10 06:22:05,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:05,968 INFO L475 AbstractCegarLoop]: Abstraction has 49804 states and 75170 transitions. [2019-09-10 06:22:05,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:05,968 INFO L276 IsEmpty]: Start isEmpty. Operand 49804 states and 75170 transitions. [2019-09-10 06:22:06,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-10 06:22:06,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:06,005 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:06,005 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:06,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:06,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1088157560, now seen corresponding path program 1 times [2019-09-10 06:22:06,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:06,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:06,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:06,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:06,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:06,394 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 06:22:06,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:06,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:22:06,395 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:06,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:22:06,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:22:06,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:22:06,396 INFO L87 Difference]: Start difference. First operand 49804 states and 75170 transitions. Second operand 4 states. [2019-09-10 06:22:06,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:06,732 INFO L93 Difference]: Finished difference Result 96052 states and 144821 transitions. [2019-09-10 06:22:06,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:22:06,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2019-09-10 06:22:06,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:08,104 INFO L225 Difference]: With dead ends: 96052 [2019-09-10 06:22:08,104 INFO L226 Difference]: Without dead ends: 96052 [2019-09-10 06:22:08,104 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 06:22:08,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96052 states. [2019-09-10 06:22:08,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96052 to 50039. [2019-09-10 06:22:08,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50039 states. [2019-09-10 06:22:08,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50039 states to 50039 states and 75558 transitions. [2019-09-10 06:22:08,921 INFO L78 Accepts]: Start accepts. Automaton has 50039 states and 75558 transitions. Word has length 312 [2019-09-10 06:22:08,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:08,921 INFO L475 AbstractCegarLoop]: Abstraction has 50039 states and 75558 transitions. [2019-09-10 06:22:08,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:22:08,922 INFO L276 IsEmpty]: Start isEmpty. Operand 50039 states and 75558 transitions. [2019-09-10 06:22:08,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:22:08,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:08,967 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:08,968 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:08,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:08,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1553161009, now seen corresponding path program 1 times [2019-09-10 06:22:08,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:08,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:08,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:08,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:08,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:09,158 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 06:22:09,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:09,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:09,159 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:09,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:09,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:09,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:09,161 INFO L87 Difference]: Start difference. First operand 50039 states and 75558 transitions. Second operand 3 states. [2019-09-10 06:22:09,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:09,716 INFO L93 Difference]: Finished difference Result 99311 states and 149760 transitions. [2019-09-10 06:22:09,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:09,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-10 06:22:09,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:09,848 INFO L225 Difference]: With dead ends: 99311 [2019-09-10 06:22:09,848 INFO L226 Difference]: Without dead ends: 99311 [2019-09-10 06:22:09,851 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 06:22:09,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99311 states. [2019-09-10 06:22:10,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99311 to 50143. [2019-09-10 06:22:10,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50143 states. [2019-09-10 06:22:10,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50143 states to 50143 states and 75701 transitions. [2019-09-10 06:22:10,605 INFO L78 Accepts]: Start accepts. Automaton has 50143 states and 75701 transitions. Word has length 314 [2019-09-10 06:22:10,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:10,605 INFO L475 AbstractCegarLoop]: Abstraction has 50143 states and 75701 transitions. [2019-09-10 06:22:10,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:10,606 INFO L276 IsEmpty]: Start isEmpty. Operand 50143 states and 75701 transitions. [2019-09-10 06:22:10,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-09-10 06:22:10,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:10,649 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:10,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:10,650 INFO L82 PathProgramCache]: Analyzing trace with hash 300170270, now seen corresponding path program 1 times [2019-09-10 06:22:10,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:10,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:10,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:10,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:10,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:11,906 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 06:22:11,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:11,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:11,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:11,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:11,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:11,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:11,911 INFO L87 Difference]: Start difference. First operand 50143 states and 75701 transitions. Second operand 3 states. [2019-09-10 06:22:12,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:12,223 INFO L93 Difference]: Finished difference Result 99436 states and 149906 transitions. [2019-09-10 06:22:12,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:12,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-09-10 06:22:12,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:12,357 INFO L225 Difference]: With dead ends: 99436 [2019-09-10 06:22:12,357 INFO L226 Difference]: Without dead ends: 99436 [2019-09-10 06:22:12,358 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 06:22:12,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99436 states. [2019-09-10 06:22:13,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99436 to 50268. [2019-09-10 06:22:13,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50268 states. [2019-09-10 06:22:13,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50268 states to 50268 states and 75847 transitions. [2019-09-10 06:22:13,229 INFO L78 Accepts]: Start accepts. Automaton has 50268 states and 75847 transitions. Word has length 315 [2019-09-10 06:22:13,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:13,229 INFO L475 AbstractCegarLoop]: Abstraction has 50268 states and 75847 transitions. [2019-09-10 06:22:13,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:13,229 INFO L276 IsEmpty]: Start isEmpty. Operand 50268 states and 75847 transitions. [2019-09-10 06:22:13,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-10 06:22:13,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:13,261 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:13,261 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:13,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:13,262 INFO L82 PathProgramCache]: Analyzing trace with hash 2110241026, now seen corresponding path program 1 times [2019-09-10 06:22:13,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:13,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:13,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:13,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:13,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:13,807 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 06:22:13,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:13,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:22:13,808 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:13,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:22:13,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:22:13,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:22:13,809 INFO L87 Difference]: Start difference. First operand 50268 states and 75847 transitions. Second operand 4 states. [2019-09-10 06:22:13,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:13,969 INFO L93 Difference]: Finished difference Result 47758 states and 72067 transitions. [2019-09-10 06:22:13,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:22:13,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 316 [2019-09-10 06:22:13,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:14,019 INFO L225 Difference]: With dead ends: 47758 [2019-09-10 06:22:14,019 INFO L226 Difference]: Without dead ends: 46961 [2019-09-10 06:22:14,020 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 06:22:14,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46961 states. [2019-09-10 06:22:14,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46961 to 46941. [2019-09-10 06:22:14,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46941 states. [2019-09-10 06:22:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46941 states to 46941 states and 70800 transitions. [2019-09-10 06:22:14,464 INFO L78 Accepts]: Start accepts. Automaton has 46941 states and 70800 transitions. Word has length 316 [2019-09-10 06:22:14,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:14,464 INFO L475 AbstractCegarLoop]: Abstraction has 46941 states and 70800 transitions. [2019-09-10 06:22:14,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:22:14,464 INFO L276 IsEmpty]: Start isEmpty. Operand 46941 states and 70800 transitions. [2019-09-10 06:22:14,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 06:22:14,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:14,504 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:14,505 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:14,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:14,505 INFO L82 PathProgramCache]: Analyzing trace with hash 497333146, now seen corresponding path program 1 times [2019-09-10 06:22:14,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:14,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:14,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:14,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:14,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:14,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:22:14,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:14,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:14,720 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:14,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:14,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:14,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:14,721 INFO L87 Difference]: Start difference. First operand 46941 states and 70800 transitions. Second operand 3 states. [2019-09-10 06:22:15,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:15,746 INFO L93 Difference]: Finished difference Result 89708 states and 134207 transitions. [2019-09-10 06:22:15,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:15,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 320 [2019-09-10 06:22:15,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:15,836 INFO L225 Difference]: With dead ends: 89708 [2019-09-10 06:22:15,836 INFO L226 Difference]: Without dead ends: 89708 [2019-09-10 06:22:15,837 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 06:22:15,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89708 states. [2019-09-10 06:22:16,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89708 to 89706. [2019-09-10 06:22:16,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89706 states. [2019-09-10 06:22:16,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89706 states to 89706 states and 134206 transitions. [2019-09-10 06:22:16,566 INFO L78 Accepts]: Start accepts. Automaton has 89706 states and 134206 transitions. Word has length 320 [2019-09-10 06:22:16,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:16,566 INFO L475 AbstractCegarLoop]: Abstraction has 89706 states and 134206 transitions. [2019-09-10 06:22:16,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:16,567 INFO L276 IsEmpty]: Start isEmpty. Operand 89706 states and 134206 transitions. [2019-09-10 06:22:16,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 06:22:16,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:16,622 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:16,622 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:16,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:16,622 INFO L82 PathProgramCache]: Analyzing trace with hash -709286529, now seen corresponding path program 1 times [2019-09-10 06:22:16,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:16,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:16,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:16,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:16,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:16,954 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 06:22:16,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:16,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:22:16,955 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:16,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:22:16,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:22:16,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:22:16,957 INFO L87 Difference]: Start difference. First operand 89706 states and 134206 transitions. Second operand 5 states. [2019-09-10 06:22:18,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:18,128 INFO L93 Difference]: Finished difference Result 75775 states and 114519 transitions. [2019-09-10 06:22:18,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:22:18,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 320 [2019-09-10 06:22:18,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:18,231 INFO L225 Difference]: With dead ends: 75775 [2019-09-10 06:22:18,231 INFO L226 Difference]: Without dead ends: 75663 [2019-09-10 06:22:18,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:22:18,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75663 states. [2019-09-10 06:22:18,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75663 to 75661. [2019-09-10 06:22:18,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75661 states. [2019-09-10 06:22:18,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75661 states to 75661 states and 114382 transitions. [2019-09-10 06:22:18,848 INFO L78 Accepts]: Start accepts. Automaton has 75661 states and 114382 transitions. Word has length 320 [2019-09-10 06:22:18,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:18,849 INFO L475 AbstractCegarLoop]: Abstraction has 75661 states and 114382 transitions. [2019-09-10 06:22:18,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:22:18,849 INFO L276 IsEmpty]: Start isEmpty. Operand 75661 states and 114382 transitions. [2019-09-10 06:22:18,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-09-10 06:22:18,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:18,886 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:18,887 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:18,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:18,887 INFO L82 PathProgramCache]: Analyzing trace with hash 184767120, now seen corresponding path program 1 times [2019-09-10 06:22:18,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:18,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:18,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:18,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:18,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:19,644 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 06:22:19,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:19,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:22:19,645 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:19,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:22:19,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:22:19,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:22:19,646 INFO L87 Difference]: Start difference. First operand 75661 states and 114382 transitions. Second operand 4 states. [2019-09-10 06:22:20,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:20,441 INFO L93 Difference]: Finished difference Result 148388 states and 223188 transitions. [2019-09-10 06:22:20,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:22:20,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2019-09-10 06:22:20,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:20,631 INFO L225 Difference]: With dead ends: 148388 [2019-09-10 06:22:20,631 INFO L226 Difference]: Without dead ends: 148340 [2019-09-10 06:22:20,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 06:22:20,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148340 states. [2019-09-10 06:22:21,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148340 to 148338. [2019-09-10 06:22:21,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148338 states. [2019-09-10 06:22:21,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148338 states to 148338 states and 223139 transitions. [2019-09-10 06:22:21,889 INFO L78 Accepts]: Start accepts. Automaton has 148338 states and 223139 transitions. Word has length 320 [2019-09-10 06:22:21,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:21,890 INFO L475 AbstractCegarLoop]: Abstraction has 148338 states and 223139 transitions. [2019-09-10 06:22:21,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:22:21,890 INFO L276 IsEmpty]: Start isEmpty. Operand 148338 states and 223139 transitions. [2019-09-10 06:22:21,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-10 06:22:21,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:21,972 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:21,972 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:21,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:21,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1622551629, now seen corresponding path program 1 times [2019-09-10 06:22:21,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:21,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:21,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:21,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:21,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:24,529 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 06:22:24,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:24,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:24,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:24,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:24,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:24,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:24,531 INFO L87 Difference]: Start difference. First operand 148338 states and 223139 transitions. Second operand 3 states. [2019-09-10 06:22:25,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:25,186 INFO L93 Difference]: Finished difference Result 290197 states and 433247 transitions. [2019-09-10 06:22:25,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:25,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-09-10 06:22:25,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:25,490 INFO L225 Difference]: With dead ends: 290197 [2019-09-10 06:22:25,490 INFO L226 Difference]: Without dead ends: 290197 [2019-09-10 06:22:25,491 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 06:22:25,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290197 states. [2019-09-10 06:22:27,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290197 to 290195. [2019-09-10 06:22:27,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290195 states. [2019-09-10 06:22:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290195 states to 290195 states and 433246 transitions. [2019-09-10 06:22:28,141 INFO L78 Accepts]: Start accepts. Automaton has 290195 states and 433246 transitions. Word has length 322 [2019-09-10 06:22:28,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:28,141 INFO L475 AbstractCegarLoop]: Abstraction has 290195 states and 433246 transitions. [2019-09-10 06:22:28,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:28,141 INFO L276 IsEmpty]: Start isEmpty. Operand 290195 states and 433246 transitions. [2019-09-10 06:22:28,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 06:22:28,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:28,318 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:28,318 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:28,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:28,318 INFO L82 PathProgramCache]: Analyzing trace with hash -383714354, now seen corresponding path program 1 times [2019-09-10 06:22:28,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:28,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:28,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:28,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:28,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:32,219 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 06:22:32,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:32,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:22:32,220 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:32,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:22:32,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:22:32,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:22:32,221 INFO L87 Difference]: Start difference. First operand 290195 states and 433246 transitions. Second operand 3 states. [2019-09-10 06:22:33,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:33,507 INFO L93 Difference]: Finished difference Result 535892 states and 793128 transitions. [2019-09-10 06:22:33,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:22:33,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-09-10 06:22:33,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:34,244 INFO L225 Difference]: With dead ends: 535892 [2019-09-10 06:22:34,244 INFO L226 Difference]: Without dead ends: 535892 [2019-09-10 06:22:34,245 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 06:22:34,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535892 states. [2019-09-10 06:22:44,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535892 to 535890. [2019-09-10 06:22:44,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535890 states. [2019-09-10 06:22:45,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535890 states to 535890 states and 793127 transitions. [2019-09-10 06:22:45,000 INFO L78 Accepts]: Start accepts. Automaton has 535890 states and 793127 transitions. Word has length 324 [2019-09-10 06:22:45,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:22:45,000 INFO L475 AbstractCegarLoop]: Abstraction has 535890 states and 793127 transitions. [2019-09-10 06:22:45,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:22:45,001 INFO L276 IsEmpty]: Start isEmpty. Operand 535890 states and 793127 transitions. [2019-09-10 06:22:51,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-09-10 06:22:51,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:22:51,783 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:22:51,783 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:22:51,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:22:51,784 INFO L82 PathProgramCache]: Analyzing trace with hash 855004267, now seen corresponding path program 1 times [2019-09-10 06:22:51,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:22:51,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:51,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:22:51,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:22:51,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:22:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:22:52,163 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 06:22:52,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:22:52,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:22:52,164 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:22:52,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:22:52,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:22:52,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:22:52,167 INFO L87 Difference]: Start difference. First operand 535890 states and 793127 transitions. Second operand 4 states. [2019-09-10 06:22:55,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:22:55,299 INFO L93 Difference]: Finished difference Result 931517 states and 1376258 transitions. [2019-09-10 06:22:55,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:22:55,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-09-10 06:22:55,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:22:56,457 INFO L225 Difference]: With dead ends: 931517 [2019-09-10 06:22:56,457 INFO L226 Difference]: Without dead ends: 931517 [2019-09-10 06:22:56,458 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 06:22:56,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931517 states. [2019-09-10 06:23:11,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931517 to 521977. [2019-09-10 06:23:11,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521977 states. [2019-09-10 06:23:13,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521977 states to 521977 states and 772252 transitions. [2019-09-10 06:23:13,296 INFO L78 Accepts]: Start accepts. Automaton has 521977 states and 772252 transitions. Word has length 324 [2019-09-10 06:23:13,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:13,297 INFO L475 AbstractCegarLoop]: Abstraction has 521977 states and 772252 transitions. [2019-09-10 06:23:13,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:23:13,297 INFO L276 IsEmpty]: Start isEmpty. Operand 521977 states and 772252 transitions. [2019-09-10 06:23:13,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-10 06:23:13,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:13,578 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:23:13,578 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:13,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:13,578 INFO L82 PathProgramCache]: Analyzing trace with hash 110421403, now seen corresponding path program 1 times [2019-09-10 06:23:13,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:13,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:13,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:13,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:13,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:13,715 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 06:23:13,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:13,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:23:13,716 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:13,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:23:13,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:23:13,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:23:13,717 INFO L87 Difference]: Start difference. First operand 521977 states and 772252 transitions. Second operand 3 states. [2019-09-10 06:23:22,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:22,530 INFO L93 Difference]: Finished difference Result 941366 states and 1391229 transitions. [2019-09-10 06:23:22,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:23:22,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-09-10 06:23:22,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:23,643 INFO L225 Difference]: With dead ends: 941366 [2019-09-10 06:23:23,644 INFO L226 Difference]: Without dead ends: 941366 [2019-09-10 06:23:23,644 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 06:23:24,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941366 states. [2019-09-10 06:23:35,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941366 to 522458. [2019-09-10 06:23:35,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522458 states. [2019-09-10 06:23:37,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522458 states to 522458 states and 772850 transitions. [2019-09-10 06:23:37,664 INFO L78 Accepts]: Start accepts. Automaton has 522458 states and 772850 transitions. Word has length 327 [2019-09-10 06:23:37,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:37,665 INFO L475 AbstractCegarLoop]: Abstraction has 522458 states and 772850 transitions. [2019-09-10 06:23:37,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:23:37,665 INFO L276 IsEmpty]: Start isEmpty. Operand 522458 states and 772850 transitions. [2019-09-10 06:23:37,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-10 06:23:37,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:37,992 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:23:37,992 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:37,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:37,993 INFO L82 PathProgramCache]: Analyzing trace with hash 552929954, now seen corresponding path program 1 times [2019-09-10 06:23:37,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:37,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:37,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:37,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:37,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:38,334 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 06:23:38,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:38,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:23:38,335 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:38,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:23:38,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:23:38,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:23:38,337 INFO L87 Difference]: Start difference. First operand 522458 states and 772850 transitions. Second operand 4 states. [2019-09-10 06:23:41,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:41,124 INFO L93 Difference]: Finished difference Result 497039 states and 735007 transitions. [2019-09-10 06:23:41,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:23:41,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2019-09-10 06:23:41,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:23:41,633 INFO L225 Difference]: With dead ends: 497039 [2019-09-10 06:23:41,633 INFO L226 Difference]: Without dead ends: 492871 [2019-09-10 06:23:41,633 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 06:23:41,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492871 states. [2019-09-10 06:23:53,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492871 to 492544. [2019-09-10 06:23:53,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492544 states. [2019-09-10 06:23:54,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492544 states to 492544 states and 728142 transitions. [2019-09-10 06:23:54,886 INFO L78 Accepts]: Start accepts. Automaton has 492544 states and 728142 transitions. Word has length 328 [2019-09-10 06:23:54,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:23:54,886 INFO L475 AbstractCegarLoop]: Abstraction has 492544 states and 728142 transitions. [2019-09-10 06:23:54,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:23:54,886 INFO L276 IsEmpty]: Start isEmpty. Operand 492544 states and 728142 transitions. [2019-09-10 06:23:55,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 06:23:55,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:23:55,207 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:23:55,207 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:23:55,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:23:55,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1110038166, now seen corresponding path program 1 times [2019-09-10 06:23:55,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:23:55,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:55,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:23:55,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:23:55,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:23:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:23:55,684 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 06:23:55,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:23:55,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:23:55,685 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:23:55,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:23:55,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:23:55,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:23:55,687 INFO L87 Difference]: Start difference. First operand 492544 states and 728142 transitions. Second operand 6 states. [2019-09-10 06:24:03,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:03,494 INFO L93 Difference]: Finished difference Result 809232 states and 1247242 transitions. [2019-09-10 06:24:03,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:24:03,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 332 [2019-09-10 06:24:03,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:04,520 INFO L225 Difference]: With dead ends: 809232 [2019-09-10 06:24:04,520 INFO L226 Difference]: Without dead ends: 809232 [2019-09-10 06:24:04,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:24:04,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809232 states. [2019-09-10 06:24:17,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809232 to 555880. [2019-09-10 06:24:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555880 states. [2019-09-10 06:24:18,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555880 states to 555880 states and 832038 transitions. [2019-09-10 06:24:18,009 INFO L78 Accepts]: Start accepts. Automaton has 555880 states and 832038 transitions. Word has length 332 [2019-09-10 06:24:18,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:18,009 INFO L475 AbstractCegarLoop]: Abstraction has 555880 states and 832038 transitions. [2019-09-10 06:24:18,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:24:18,009 INFO L276 IsEmpty]: Start isEmpty. Operand 555880 states and 832038 transitions. [2019-09-10 06:24:18,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 06:24:18,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:18,322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:24:18,322 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:18,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:18,323 INFO L82 PathProgramCache]: Analyzing trace with hash -228718422, now seen corresponding path program 1 times [2019-09-10 06:24:18,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:18,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:18,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:18,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:18,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:25,780 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 06:24:25,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:25,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 06:24:25,780 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:25,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 06:24:25,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 06:24:25,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-10 06:24:25,781 INFO L87 Difference]: Start difference. First operand 555880 states and 832038 transitions. Second operand 10 states. [2019-09-10 06:24:29,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:29,268 INFO L93 Difference]: Finished difference Result 1103038 states and 1659405 transitions. [2019-09-10 06:24:29,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:24:29,269 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 332 [2019-09-10 06:24:29,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:31,810 INFO L225 Difference]: With dead ends: 1103038 [2019-09-10 06:24:31,810 INFO L226 Difference]: Without dead ends: 1103038 [2019-09-10 06:24:31,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:24:32,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103038 states. [2019-09-10 06:24:48,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103038 to 555880. [2019-09-10 06:24:48,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555880 states. [2019-09-10 06:24:50,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555880 states to 555880 states and 829926 transitions. [2019-09-10 06:24:50,592 INFO L78 Accepts]: Start accepts. Automaton has 555880 states and 829926 transitions. Word has length 332 [2019-09-10 06:24:50,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:24:50,592 INFO L475 AbstractCegarLoop]: Abstraction has 555880 states and 829926 transitions. [2019-09-10 06:24:50,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 06:24:50,592 INFO L276 IsEmpty]: Start isEmpty. Operand 555880 states and 829926 transitions. [2019-09-10 06:24:50,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 06:24:50,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:50,899 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:24:50,899 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:50,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:50,899 INFO L82 PathProgramCache]: Analyzing trace with hash 944879322, now seen corresponding path program 1 times [2019-09-10 06:24:50,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:50,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:50,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:50,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:50,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:24:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:24:51,268 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 06:24:51,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:24:51,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:24:51,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:24:51,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:24:51,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:24:51,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:24:51,270 INFO L87 Difference]: Start difference. First operand 555880 states and 829926 transitions. Second operand 8 states. [2019-09-10 06:24:54,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:24:54,061 INFO L93 Difference]: Finished difference Result 555882 states and 827815 transitions. [2019-09-10 06:24:54,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:24:54,062 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 332 [2019-09-10 06:24:54,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:24:54,640 INFO L225 Difference]: With dead ends: 555882 [2019-09-10 06:24:54,640 INFO L226 Difference]: Without dead ends: 555882 [2019-09-10 06:24:54,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:24:54,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555882 states. [2019-09-10 06:25:10,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555882 to 555880. [2019-09-10 06:25:10,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555880 states. [2019-09-10 06:25:12,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555880 states to 555880 states and 827814 transitions. [2019-09-10 06:25:12,169 INFO L78 Accepts]: Start accepts. Automaton has 555880 states and 827814 transitions. Word has length 332 [2019-09-10 06:25:12,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:12,169 INFO L475 AbstractCegarLoop]: Abstraction has 555880 states and 827814 transitions. [2019-09-10 06:25:12,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:25:12,169 INFO L276 IsEmpty]: Start isEmpty. Operand 555880 states and 827814 transitions. [2019-09-10 06:25:12,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 06:25:12,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:12,530 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:25:12,530 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:12,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:12,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1870267274, now seen corresponding path program 1 times [2019-09-10 06:25:12,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:12,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:12,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:12,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:12,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:20,888 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 06:25:20,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:20,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 06:25:20,889 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:20,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 06:25:20,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 06:25:20,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-09-10 06:25:20,890 INFO L87 Difference]: Start difference. First operand 555880 states and 827814 transitions. Second operand 21 states. [2019-09-10 06:25:21,071 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-09-10 06:25:22,742 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2019-09-10 06:25:23,059 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-09-10 06:25:23,240 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 35 [2019-09-10 06:25:23,932 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-09-10 06:25:24,120 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 35 [2019-09-10 06:25:35,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:35,148 INFO L93 Difference]: Finished difference Result 1725427 states and 2641514 transitions. [2019-09-10 06:25:35,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-10 06:25:35,149 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 332 [2019-09-10 06:25:35,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:38,658 INFO L225 Difference]: With dead ends: 1725427 [2019-09-10 06:25:38,659 INFO L226 Difference]: Without dead ends: 1725427 [2019-09-10 06:25:38,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1090, Invalid=2692, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 06:25:39,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1725427 states. [2019-09-10 06:26:04,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1725427 to 659500. [2019-09-10 06:26:04,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659500 states. [2019-09-10 06:26:07,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659500 states to 659500 states and 984346 transitions. [2019-09-10 06:26:07,137 INFO L78 Accepts]: Start accepts. Automaton has 659500 states and 984346 transitions. Word has length 332 [2019-09-10 06:26:07,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:07,137 INFO L475 AbstractCegarLoop]: Abstraction has 659500 states and 984346 transitions. [2019-09-10 06:26:07,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 06:26:07,137 INFO L276 IsEmpty]: Start isEmpty. Operand 659500 states and 984346 transitions. [2019-09-10 06:26:07,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 06:26:07,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:07,485 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:26:07,486 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:07,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:07,486 INFO L82 PathProgramCache]: Analyzing trace with hash -354600894, now seen corresponding path program 1 times [2019-09-10 06:26:07,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:07,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:07,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:07,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:07,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:10,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:26:10,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:10,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:26:10,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:10,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:26:10,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:26:10,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:26:10,094 INFO L87 Difference]: Start difference. First operand 659500 states and 984346 transitions. Second operand 16 states. [2019-09-10 06:26:27,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:27,303 INFO L93 Difference]: Finished difference Result 972868 states and 1471528 transitions. [2019-09-10 06:26:27,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 06:26:27,303 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 332 [2019-09-10 06:26:27,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:28,513 INFO L225 Difference]: With dead ends: 972868 [2019-09-10 06:26:28,513 INFO L226 Difference]: Without dead ends: 972868 [2019-09-10 06:26:28,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=331, Invalid=791, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 06:26:29,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972868 states. [2019-09-10 06:26:37,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972868 to 571188. [2019-09-10 06:26:37,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571188 states. [2019-09-10 06:26:39,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571188 states to 571188 states and 848614 transitions. [2019-09-10 06:26:39,477 INFO L78 Accepts]: Start accepts. Automaton has 571188 states and 848614 transitions. Word has length 332 [2019-09-10 06:26:39,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:39,477 INFO L475 AbstractCegarLoop]: Abstraction has 571188 states and 848614 transitions. [2019-09-10 06:26:39,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:26:39,477 INFO L276 IsEmpty]: Start isEmpty. Operand 571188 states and 848614 transitions. [2019-09-10 06:26:39,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 06:26:39,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:39,804 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:26:39,804 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:39,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:39,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1345762220, now seen corresponding path program 1 times [2019-09-10 06:26:39,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:39,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:39,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:39,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:39,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:40,959 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 06:26:40,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:40,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 06:26:40,960 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:40,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 06:26:40,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 06:26:40,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-10 06:26:40,968 INFO L87 Difference]: Start difference. First operand 571188 states and 848614 transitions. Second operand 16 states. [2019-09-10 06:26:46,879 WARN L188 SmtUtils]: Spent 5.23 s on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-09-10 06:26:51,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:51,895 INFO L93 Difference]: Finished difference Result 1013414 states and 1522458 transitions. [2019-09-10 06:26:51,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 06:26:51,895 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 332 [2019-09-10 06:26:51,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:54,250 INFO L225 Difference]: With dead ends: 1013414 [2019-09-10 06:26:54,250 INFO L226 Difference]: Without dead ends: 1013414 [2019-09-10 06:26:54,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=347, Invalid=985, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 06:26:54,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013414 states. [2019-09-10 06:27:02,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013414 to 596452. [2019-09-10 06:27:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596452 states. [2019-09-10 06:27:03,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596452 states to 596452 states and 883206 transitions. [2019-09-10 06:27:03,659 INFO L78 Accepts]: Start accepts. Automaton has 596452 states and 883206 transitions. Word has length 332 [2019-09-10 06:27:03,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:03,660 INFO L475 AbstractCegarLoop]: Abstraction has 596452 states and 883206 transitions. [2019-09-10 06:27:03,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 06:27:03,660 INFO L276 IsEmpty]: Start isEmpty. Operand 596452 states and 883206 transitions. [2019-09-10 06:27:03,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-10 06:27:03,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:03,977 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:27:03,977 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:03,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:03,977 INFO L82 PathProgramCache]: Analyzing trace with hash 169904160, now seen corresponding path program 1 times [2019-09-10 06:27:03,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:03,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:03,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:03,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:03,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:05,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:05,858 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 06:27:05,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:05,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:27:05,858 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:05,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:27:05,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:27:05,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:27:05,860 INFO L87 Difference]: Start difference. First operand 596452 states and 883206 transitions. Second operand 4 states. [2019-09-10 06:27:16,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:16,167 INFO L93 Difference]: Finished difference Result 1108682 states and 1629847 transitions. [2019-09-10 06:27:16,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:27:16,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 332 [2019-09-10 06:27:16,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:18,324 INFO L225 Difference]: With dead ends: 1108682 [2019-09-10 06:27:18,324 INFO L226 Difference]: Without dead ends: 1108418 [2019-09-10 06:27:18,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 06:27:18,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108418 states. [2019-09-10 06:27:29,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108418 to 1108416. [2019-09-10 06:27:29,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1108416 states. [2019-09-10 06:27:45,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108416 states to 1108416 states and 1629582 transitions. [2019-09-10 06:27:45,792 INFO L78 Accepts]: Start accepts. Automaton has 1108416 states and 1629582 transitions. Word has length 332 [2019-09-10 06:27:45,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:45,793 INFO L475 AbstractCegarLoop]: Abstraction has 1108416 states and 1629582 transitions. [2019-09-10 06:27:45,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:27:45,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1108416 states and 1629582 transitions. [2019-09-10 06:27:48,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-10 06:27:48,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:48,554 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:27:48,554 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:48,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:48,555 INFO L82 PathProgramCache]: Analyzing trace with hash -677813632, now seen corresponding path program 1 times [2019-09-10 06:27:48,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:48,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:48,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:48,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:48,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:48,728 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 06:27:48,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:48,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:27:48,728 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:48,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:27:48,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:27:48,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:27:48,729 INFO L87 Difference]: Start difference. First operand 1108416 states and 1629582 transitions. Second operand 3 states. [2019-09-10 06:28:05,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:28:05,117 INFO L93 Difference]: Finished difference Result 2167741 states and 3159668 transitions. [2019-09-10 06:28:05,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:28:05,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 334 [2019-09-10 06:28:05,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:28:09,221 INFO L225 Difference]: With dead ends: 2167741 [2019-09-10 06:28:09,221 INFO L226 Difference]: Without dead ends: 2167741 [2019-09-10 06:28:09,221 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 06:28:10,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167741 states.