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_opt-floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 09:03:54,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 09:03:54,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 09:03:54,064 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 09:03:54,065 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 09:03:54,066 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 09:03:54,067 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 09:03:54,069 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 09:03:54,070 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 09:03:54,071 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 09:03:54,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 09:03:54,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 09:03:54,073 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 09:03:54,074 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 09:03:54,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 09:03:54,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 09:03:54,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 09:03:54,078 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 09:03:54,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 09:03:54,082 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 09:03:54,083 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 09:03:54,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 09:03:54,086 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 09:03:54,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 09:03:54,089 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 09:03:54,089 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 09:03:54,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 09:03:54,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 09:03:54,091 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 09:03:54,092 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 09:03:54,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 09:03:54,093 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 09:03:54,093 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 09:03:54,094 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 09:03:54,095 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 09:03:54,095 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 09:03:54,096 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 09:03:54,096 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 09:03:54,097 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 09:03:54,097 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 09:03:54,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 09:03:54,099 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 09:03:54,114 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 09:03:54,114 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 09:03:54,115 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 09:03:54,115 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 09:03:54,116 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 09:03:54,116 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 09:03:54,116 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 09:03:54,116 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 09:03:54,116 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 09:03:54,117 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 09:03:54,117 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 09:03:54,117 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 09:03:54,118 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 09:03:54,118 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 09:03:54,118 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 09:03:54,118 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 09:03:54,118 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 09:03:54,119 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 09:03:54,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 09:03:54,119 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 09:03:54,119 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 09:03:54,119 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 09:03:54,120 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 09:03:54,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 09:03:54,120 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 09:03:54,120 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 09:03:54,120 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 09:03:54,121 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 09:03:54,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 09:03:54,121 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 09:03:54,148 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 09:03:54,161 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 09:03:54,164 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 09:03:54,166 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 09:03:54,166 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 09:03:54,167 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 09:03:54,228 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f85f3f043/b5cac459312a4385a26904158d6d54bf/FLAGac465f5d0 [2019-09-10 09:03:54,880 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 09:03:54,881 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 09:03:54,906 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f85f3f043/b5cac459312a4385a26904158d6d54bf/FLAGac465f5d0 [2019-09-10 09:03:55,051 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f85f3f043/b5cac459312a4385a26904158d6d54bf [2019-09-10 09:03:55,061 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 09:03:55,063 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 09:03:55,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 09:03:55,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 09:03:55,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 09:03:55,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:03:55" (1/1) ... [2019-09-10 09:03:55,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37de91cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:03:55, skipping insertion in model container [2019-09-10 09:03:55,074 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:03:55" (1/1) ... [2019-09-10 09:03:55,081 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 09:03:55,246 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 09:03:56,777 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:03:56,816 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 09:03:57,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:03:58,018 INFO L192 MainTranslator]: Completed translation [2019-09-10 09:03:58,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:03:58 WrapperNode [2019-09-10 09:03:58,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 09:03:58,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 09:03:58,020 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 09:03:58,020 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 09:03:58,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:03:58" (1/1) ... [2019-09-10 09:03:58,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:03:58" (1/1) ... [2019-09-10 09:03:58,090 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:03:58" (1/1) ... [2019-09-10 09:03:58,090 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:03:58" (1/1) ... [2019-09-10 09:03:58,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:03:58" (1/1) ... [2019-09-10 09:03:58,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:03:58" (1/1) ... [2019-09-10 09:03:58,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:03:58" (1/1) ... [2019-09-10 09:03:58,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 09:03:58,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 09:03:58,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 09:03:58,247 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 09:03:58,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:03:58" (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 09:03:58,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 09:03:58,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 09:03:58,324 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 09:03:58,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 09:03:58,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 09:03:58,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 09:03:58,325 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 09:03:58,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 09:03:58,326 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 09:03:58,326 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 09:03:58,326 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 09:03:58,326 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 09:03:58,327 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 09:03:58,327 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 09:03:58,327 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 09:03:58,327 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 09:03:58,327 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 09:03:58,328 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 09:03:58,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 09:03:58,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 09:04:02,026 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 09:04:02,026 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 09:04:02,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:04:02 BoogieIcfgContainer [2019-09-10 09:04:02,029 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 09:04:02,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 09:04:02,030 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 09:04:02,032 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 09:04:02,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 09:03:55" (1/3) ... [2019-09-10 09:04:02,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e215716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:04:02, skipping insertion in model container [2019-09-10 09:04:02,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:03:58" (2/3) ... [2019-09-10 09:04:02,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e215716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:04:02, skipping insertion in model container [2019-09-10 09:04:02,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:04:02" (3/3) ... [2019-09-10 09:04:02,036 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2019-09-10 09:04:02,045 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 09:04:02,054 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 09:04:02,070 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 09:04:02,093 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 09:04:02,093 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 09:04:02,093 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 09:04:02,093 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 09:04:02,093 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 09:04:02,093 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 09:04:02,094 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 09:04:02,094 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 09:04:02,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states. [2019-09-10 09:04:02,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2019-09-10 09:04:02,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:02,181 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:04:02,183 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:02,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:02,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1970233224, now seen corresponding path program 1 times [2019-09-10 09:04:02,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:02,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:02,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:02,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:02,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:04,834 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 09:04:04,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:04,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:04:04,836 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:04,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:04:04,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:04:04,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:04:04,855 INFO L87 Difference]: Start difference. First operand 1431 states. Second operand 4 states. [2019-09-10 09:04:05,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:05,234 INFO L93 Difference]: Finished difference Result 2822 states and 5062 transitions. [2019-09-10 09:04:05,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 09:04:05,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 487 [2019-09-10 09:04:05,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:05,278 INFO L225 Difference]: With dead ends: 2822 [2019-09-10 09:04:05,278 INFO L226 Difference]: Without dead ends: 2814 [2019-09-10 09:04:05,281 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 09:04:05,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2814 states. [2019-09-10 09:04:05,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2814 to 2812. [2019-09-10 09:04:05,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2812 states. [2019-09-10 09:04:05,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 4639 transitions. [2019-09-10 09:04:05,463 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 4639 transitions. Word has length 487 [2019-09-10 09:04:05,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:05,467 INFO L475 AbstractCegarLoop]: Abstraction has 2812 states and 4639 transitions. [2019-09-10 09:04:05,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:04:05,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 4639 transitions. [2019-09-10 09:04:05,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2019-09-10 09:04:05,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:05,484 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:04:05,485 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:05,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:05,486 INFO L82 PathProgramCache]: Analyzing trace with hash 556615448, now seen corresponding path program 1 times [2019-09-10 09:04:05,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:05,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:05,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:05,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:05,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:06,389 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 09:04:06,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:06,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:04:06,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:06,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:04:06,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:04:06,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:04:06,394 INFO L87 Difference]: Start difference. First operand 2812 states and 4639 transitions. Second operand 3 states. [2019-09-10 09:04:06,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:06,609 INFO L93 Difference]: Finished difference Result 5560 states and 9142 transitions. [2019-09-10 09:04:06,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:04:06,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 489 [2019-09-10 09:04:06,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:06,638 INFO L225 Difference]: With dead ends: 5560 [2019-09-10 09:04:06,638 INFO L226 Difference]: Without dead ends: 5560 [2019-09-10 09:04:06,639 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 09:04:06,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5560 states. [2019-09-10 09:04:06,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5560 to 5558. [2019-09-10 09:04:06,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5558 states. [2019-09-10 09:04:06,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5558 states to 5558 states and 9141 transitions. [2019-09-10 09:04:06,806 INFO L78 Accepts]: Start accepts. Automaton has 5558 states and 9141 transitions. Word has length 489 [2019-09-10 09:04:06,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:06,808 INFO L475 AbstractCegarLoop]: Abstraction has 5558 states and 9141 transitions. [2019-09-10 09:04:06,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:04:06,808 INFO L276 IsEmpty]: Start isEmpty. Operand 5558 states and 9141 transitions. [2019-09-10 09:04:06,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2019-09-10 09:04:06,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:06,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:04:06,831 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:06,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:06,832 INFO L82 PathProgramCache]: Analyzing trace with hash -2101011067, now seen corresponding path program 1 times [2019-09-10 09:04:06,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:06,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:06,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:06,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:06,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:07,217 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 09:04:07,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:07,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:04:07,218 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:07,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:04:07,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:04:07,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:04:07,220 INFO L87 Difference]: Start difference. First operand 5558 states and 9141 transitions. Second operand 3 states. [2019-09-10 09:04:07,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:07,329 INFO L93 Difference]: Finished difference Result 11071 states and 18194 transitions. [2019-09-10 09:04:07,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:04:07,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 490 [2019-09-10 09:04:07,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:07,378 INFO L225 Difference]: With dead ends: 11071 [2019-09-10 09:04:07,379 INFO L226 Difference]: Without dead ends: 11071 [2019-09-10 09:04:07,379 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 09:04:07,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11071 states. [2019-09-10 09:04:07,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11071 to 5605. [2019-09-10 09:04:07,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5605 states. [2019-09-10 09:04:07,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5605 states to 5605 states and 9215 transitions. [2019-09-10 09:04:07,546 INFO L78 Accepts]: Start accepts. Automaton has 5605 states and 9215 transitions. Word has length 490 [2019-09-10 09:04:07,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:07,547 INFO L475 AbstractCegarLoop]: Abstraction has 5605 states and 9215 transitions. [2019-09-10 09:04:07,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:04:07,547 INFO L276 IsEmpty]: Start isEmpty. Operand 5605 states and 9215 transitions. [2019-09-10 09:04:07,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2019-09-10 09:04:07,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:07,560 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:04:07,561 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:07,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:07,561 INFO L82 PathProgramCache]: Analyzing trace with hash 990807261, now seen corresponding path program 1 times [2019-09-10 09:04:07,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:07,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:07,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:07,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:07,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:08,243 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 09:04:08,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:08,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:04:08,244 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:08,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:04:08,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:04:08,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:04:08,246 INFO L87 Difference]: Start difference. First operand 5605 states and 9215 transitions. Second operand 3 states. [2019-09-10 09:04:08,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:08,492 INFO L93 Difference]: Finished difference Result 10934 states and 17886 transitions. [2019-09-10 09:04:08,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:04:08,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 491 [2019-09-10 09:04:08,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:08,546 INFO L225 Difference]: With dead ends: 10934 [2019-09-10 09:04:08,546 INFO L226 Difference]: Without dead ends: 10934 [2019-09-10 09:04:08,547 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 09:04:08,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10934 states. [2019-09-10 09:04:08,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10934 to 10932. [2019-09-10 09:04:08,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10932 states. [2019-09-10 09:04:08,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10932 states to 10932 states and 17885 transitions. [2019-09-10 09:04:08,770 INFO L78 Accepts]: Start accepts. Automaton has 10932 states and 17885 transitions. Word has length 491 [2019-09-10 09:04:08,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:08,771 INFO L475 AbstractCegarLoop]: Abstraction has 10932 states and 17885 transitions. [2019-09-10 09:04:08,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:04:08,771 INFO L276 IsEmpty]: Start isEmpty. Operand 10932 states and 17885 transitions. [2019-09-10 09:04:08,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2019-09-10 09:04:08,799 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:08,800 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:04:08,800 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:08,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:08,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1301541688, now seen corresponding path program 1 times [2019-09-10 09:04:08,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:08,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:08,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:08,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:08,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:08,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:09,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:04:09,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:09,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:04:09,543 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:09,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:04:09,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:04:09,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:04:09,545 INFO L87 Difference]: Start difference. First operand 10932 states and 17885 transitions. Second operand 3 states. [2019-09-10 09:04:09,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:09,678 INFO L93 Difference]: Finished difference Result 21752 states and 35560 transitions. [2019-09-10 09:04:09,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:04:09,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 491 [2019-09-10 09:04:09,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:09,727 INFO L225 Difference]: With dead ends: 21752 [2019-09-10 09:04:09,728 INFO L226 Difference]: Without dead ends: 21752 [2019-09-10 09:04:09,728 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 09:04:09,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21752 states. [2019-09-10 09:04:09,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21752 to 11030. [2019-09-10 09:04:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11030 states. [2019-09-10 09:04:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11030 states to 11030 states and 18036 transitions. [2019-09-10 09:04:10,007 INFO L78 Accepts]: Start accepts. Automaton has 11030 states and 18036 transitions. Word has length 491 [2019-09-10 09:04:10,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:10,007 INFO L475 AbstractCegarLoop]: Abstraction has 11030 states and 18036 transitions. [2019-09-10 09:04:10,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:04:10,008 INFO L276 IsEmpty]: Start isEmpty. Operand 11030 states and 18036 transitions. [2019-09-10 09:04:10,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2019-09-10 09:04:10,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:10,031 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:04:10,031 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:10,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:10,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1289156436, now seen corresponding path program 1 times [2019-09-10 09:04:10,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:10,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:10,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:10,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:10,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:10,275 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 09:04:10,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:10,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:04:10,276 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:10,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:04:10,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:04:10,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:04:10,277 INFO L87 Difference]: Start difference. First operand 11030 states and 18036 transitions. Second operand 3 states. [2019-09-10 09:04:10,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:10,407 INFO L93 Difference]: Finished difference Result 21869 states and 35706 transitions. [2019-09-10 09:04:10,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:04:10,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 492 [2019-09-10 09:04:10,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:10,455 INFO L225 Difference]: With dead ends: 21869 [2019-09-10 09:04:10,456 INFO L226 Difference]: Without dead ends: 21869 [2019-09-10 09:04:10,456 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 09:04:10,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21869 states. [2019-09-10 09:04:10,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21869 to 11147. [2019-09-10 09:04:10,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11147 states. [2019-09-10 09:04:10,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11147 states to 11147 states and 18182 transitions. [2019-09-10 09:04:10,881 INFO L78 Accepts]: Start accepts. Automaton has 11147 states and 18182 transitions. Word has length 492 [2019-09-10 09:04:10,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:10,882 INFO L475 AbstractCegarLoop]: Abstraction has 11147 states and 18182 transitions. [2019-09-10 09:04:10,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:04:10,882 INFO L276 IsEmpty]: Start isEmpty. Operand 11147 states and 18182 transitions. [2019-09-10 09:04:10,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-09-10 09:04:10,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:10,908 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:04:10,909 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:10,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:10,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1675893118, now seen corresponding path program 1 times [2019-09-10 09:04:10,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:10,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:10,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:10,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:10,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:11,393 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 09:04:11,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:11,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:04:11,394 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:11,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:04:11,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:04:11,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:04:11,396 INFO L87 Difference]: Start difference. First operand 11147 states and 18182 transitions. Second operand 3 states. [2019-09-10 09:04:11,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:11,558 INFO L93 Difference]: Finished difference Result 21548 states and 34988 transitions. [2019-09-10 09:04:11,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:04:11,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 493 [2019-09-10 09:04:11,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:11,611 INFO L225 Difference]: With dead ends: 21548 [2019-09-10 09:04:11,611 INFO L226 Difference]: Without dead ends: 21548 [2019-09-10 09:04:11,611 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 09:04:11,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21548 states. [2019-09-10 09:04:11,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21548 to 21546. [2019-09-10 09:04:11,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21546 states. [2019-09-10 09:04:12,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21546 states to 21546 states and 34987 transitions. [2019-09-10 09:04:12,615 INFO L78 Accepts]: Start accepts. Automaton has 21546 states and 34987 transitions. Word has length 493 [2019-09-10 09:04:12,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:12,616 INFO L475 AbstractCegarLoop]: Abstraction has 21546 states and 34987 transitions. [2019-09-10 09:04:12,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:04:12,616 INFO L276 IsEmpty]: Start isEmpty. Operand 21546 states and 34987 transitions. [2019-09-10 09:04:12,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-09-10 09:04:12,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:12,651 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:04:12,651 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:12,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:12,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1958212229, now seen corresponding path program 1 times [2019-09-10 09:04:12,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:12,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:12,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:12,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:12,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:13,351 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 09:04:13,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:13,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:04:13,352 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:13,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:04:13,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:04:13,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:04:13,354 INFO L87 Difference]: Start difference. First operand 21546 states and 34987 transitions. Second operand 4 states. [2019-09-10 09:04:13,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:13,554 INFO L93 Difference]: Finished difference Result 40649 states and 65798 transitions. [2019-09-10 09:04:13,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:04:13,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 493 [2019-09-10 09:04:13,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:13,645 INFO L225 Difference]: With dead ends: 40649 [2019-09-10 09:04:13,645 INFO L226 Difference]: Without dead ends: 40649 [2019-09-10 09:04:13,646 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 09:04:13,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40649 states. [2019-09-10 09:04:14,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40649 to 22839. [2019-09-10 09:04:14,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22839 states. [2019-09-10 09:04:14,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22839 states to 22839 states and 37266 transitions. [2019-09-10 09:04:14,177 INFO L78 Accepts]: Start accepts. Automaton has 22839 states and 37266 transitions. Word has length 493 [2019-09-10 09:04:14,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:14,178 INFO L475 AbstractCegarLoop]: Abstraction has 22839 states and 37266 transitions. [2019-09-10 09:04:14,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:04:14,178 INFO L276 IsEmpty]: Start isEmpty. Operand 22839 states and 37266 transitions. [2019-09-10 09:04:14,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-09-10 09:04:14,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:14,220 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:04:14,220 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:14,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:14,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1630869529, now seen corresponding path program 1 times [2019-09-10 09:04:14,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:14,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:14,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:14,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:14,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:14,768 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 09:04:14,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:14,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:04:14,769 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:14,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:04:14,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:04:14,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:04:14,771 INFO L87 Difference]: Start difference. First operand 22839 states and 37266 transitions. Second operand 3 states. [2019-09-10 09:04:14,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:14,958 INFO L93 Difference]: Finished difference Result 30041 states and 48691 transitions. [2019-09-10 09:04:14,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:04:14,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 493 [2019-09-10 09:04:14,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:15,009 INFO L225 Difference]: With dead ends: 30041 [2019-09-10 09:04:15,009 INFO L226 Difference]: Without dead ends: 30041 [2019-09-10 09:04:15,011 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 09:04:15,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30041 states. [2019-09-10 09:04:15,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30041 to 25879. [2019-09-10 09:04:15,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25879 states. [2019-09-10 09:04:15,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25879 states to 25879 states and 42290 transitions. [2019-09-10 09:04:15,414 INFO L78 Accepts]: Start accepts. Automaton has 25879 states and 42290 transitions. Word has length 493 [2019-09-10 09:04:15,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:15,414 INFO L475 AbstractCegarLoop]: Abstraction has 25879 states and 42290 transitions. [2019-09-10 09:04:15,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:04:15,415 INFO L276 IsEmpty]: Start isEmpty. Operand 25879 states and 42290 transitions. [2019-09-10 09:04:15,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2019-09-10 09:04:15,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:15,441 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:04:15,441 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:15,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:15,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1979667432, now seen corresponding path program 1 times [2019-09-10 09:04:15,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:15,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:15,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:15,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:15,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:15,914 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 09:04:15,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:15,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:04:15,915 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:15,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:04:15,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:04:15,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:04:15,918 INFO L87 Difference]: Start difference. First operand 25879 states and 42290 transitions. Second operand 3 states. [2019-09-10 09:04:16,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:16,100 INFO L93 Difference]: Finished difference Result 34729 states and 56563 transitions. [2019-09-10 09:04:16,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:04:16,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 495 [2019-09-10 09:04:16,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:16,147 INFO L225 Difference]: With dead ends: 34729 [2019-09-10 09:04:16,149 INFO L226 Difference]: Without dead ends: 34729 [2019-09-10 09:04:16,150 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 09:04:16,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34729 states. [2019-09-10 09:04:16,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34729 to 31399. [2019-09-10 09:04:16,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31399 states. [2019-09-10 09:04:16,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31399 states to 31399 states and 51426 transitions. [2019-09-10 09:04:16,609 INFO L78 Accepts]: Start accepts. Automaton has 31399 states and 51426 transitions. Word has length 495 [2019-09-10 09:04:16,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:16,610 INFO L475 AbstractCegarLoop]: Abstraction has 31399 states and 51426 transitions. [2019-09-10 09:04:16,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:04:16,610 INFO L276 IsEmpty]: Start isEmpty. Operand 31399 states and 51426 transitions. [2019-09-10 09:04:16,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-09-10 09:04:16,639 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:16,639 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:04:16,640 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:16,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:16,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1555470049, now seen corresponding path program 1 times [2019-09-10 09:04:16,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:16,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:16,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:16,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:16,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:16,902 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 09:04:16,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:16,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:04:16,902 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:16,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:04:16,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:04:16,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:04:16,904 INFO L87 Difference]: Start difference. First operand 31399 states and 51426 transitions. Second operand 3 states. [2019-09-10 09:04:17,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:17,077 INFO L93 Difference]: Finished difference Result 59320 states and 96574 transitions. [2019-09-10 09:04:17,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:04:17,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 496 [2019-09-10 09:04:17,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:17,147 INFO L225 Difference]: With dead ends: 59320 [2019-09-10 09:04:17,147 INFO L226 Difference]: Without dead ends: 59320 [2019-09-10 09:04:17,147 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 09:04:17,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59320 states. [2019-09-10 09:04:17,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59320 to 31846. [2019-09-10 09:04:17,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31846 states. [2019-09-10 09:04:17,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31846 states to 31846 states and 52101 transitions. [2019-09-10 09:04:17,792 INFO L78 Accepts]: Start accepts. Automaton has 31846 states and 52101 transitions. Word has length 496 [2019-09-10 09:04:17,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:17,792 INFO L475 AbstractCegarLoop]: Abstraction has 31846 states and 52101 transitions. [2019-09-10 09:04:17,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:04:17,792 INFO L276 IsEmpty]: Start isEmpty. Operand 31846 states and 52101 transitions. [2019-09-10 09:04:17,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-09-10 09:04:17,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:17,818 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:04:17,818 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:17,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:17,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1295618123, now seen corresponding path program 1 times [2019-09-10 09:04:17,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:17,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:17,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:17,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:17,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:18,510 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 09:04:18,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:18,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 09:04:18,510 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:18,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 09:04:18,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 09:04:18,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 09:04:18,512 INFO L87 Difference]: Start difference. First operand 31846 states and 52101 transitions. Second operand 9 states. [2019-09-10 09:04:27,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:27,296 INFO L93 Difference]: Finished difference Result 235256 states and 383903 transitions. [2019-09-10 09:04:27,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-10 09:04:27,297 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 496 [2019-09-10 09:04:27,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:27,551 INFO L225 Difference]: With dead ends: 235256 [2019-09-10 09:04:27,551 INFO L226 Difference]: Without dead ends: 235256 [2019-09-10 09:04:27,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=370, Invalid=1112, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 09:04:27,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235256 states. [2019-09-10 09:04:30,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235256 to 74450. [2019-09-10 09:04:30,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74450 states. [2019-09-10 09:04:30,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74450 states to 74450 states and 120697 transitions. [2019-09-10 09:04:30,713 INFO L78 Accepts]: Start accepts. Automaton has 74450 states and 120697 transitions. Word has length 496 [2019-09-10 09:04:30,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:30,713 INFO L475 AbstractCegarLoop]: Abstraction has 74450 states and 120697 transitions. [2019-09-10 09:04:30,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 09:04:30,713 INFO L276 IsEmpty]: Start isEmpty. Operand 74450 states and 120697 transitions. [2019-09-10 09:04:30,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-09-10 09:04:30,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:30,755 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:04:30,755 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:30,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:30,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1463680085, now seen corresponding path program 1 times [2019-09-10 09:04:30,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:30,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:30,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:30,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:30,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:32,038 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 09:04:32,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:32,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 09:04:32,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:32,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 09:04:32,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 09:04:32,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-10 09:04:32,040 INFO L87 Difference]: Start difference. First operand 74450 states and 120697 transitions. Second operand 10 states. [2019-09-10 09:04:35,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:35,648 INFO L93 Difference]: Finished difference Result 162220 states and 261458 transitions. [2019-09-10 09:04:35,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 09:04:35,649 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 496 [2019-09-10 09:04:35,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:35,804 INFO L225 Difference]: With dead ends: 162220 [2019-09-10 09:04:35,805 INFO L226 Difference]: Without dead ends: 162220 [2019-09-10 09:04:35,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-09-10 09:04:35,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162220 states. [2019-09-10 09:04:38,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162220 to 68262. [2019-09-10 09:04:38,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68262 states. [2019-09-10 09:04:38,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68262 states to 68262 states and 110052 transitions. [2019-09-10 09:04:38,853 INFO L78 Accepts]: Start accepts. Automaton has 68262 states and 110052 transitions. Word has length 496 [2019-09-10 09:04:38,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:38,854 INFO L475 AbstractCegarLoop]: Abstraction has 68262 states and 110052 transitions. [2019-09-10 09:04:38,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 09:04:38,854 INFO L276 IsEmpty]: Start isEmpty. Operand 68262 states and 110052 transitions. [2019-09-10 09:04:38,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-09-10 09:04:38,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:38,885 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:04:38,885 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:38,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:38,885 INFO L82 PathProgramCache]: Analyzing trace with hash -121005290, now seen corresponding path program 1 times [2019-09-10 09:04:38,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:38,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:38,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:38,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:38,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:40,259 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 09:04:40,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:40,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:04:40,259 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:40,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:04:40,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:04:40,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:04:40,261 INFO L87 Difference]: Start difference. First operand 68262 states and 110052 transitions. Second operand 4 states. [2019-09-10 09:04:40,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:40,626 INFO L93 Difference]: Finished difference Result 133733 states and 214949 transitions. [2019-09-10 09:04:40,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:04:40,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 496 [2019-09-10 09:04:40,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:40,750 INFO L225 Difference]: With dead ends: 133733 [2019-09-10 09:04:40,750 INFO L226 Difference]: Without dead ends: 133733 [2019-09-10 09:04:40,751 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 09:04:40,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133733 states. [2019-09-10 09:04:42,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133733 to 133731. [2019-09-10 09:04:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133731 states. [2019-09-10 09:04:42,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133731 states to 133731 states and 214948 transitions. [2019-09-10 09:04:42,294 INFO L78 Accepts]: Start accepts. Automaton has 133731 states and 214948 transitions. Word has length 496 [2019-09-10 09:04:42,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:42,295 INFO L475 AbstractCegarLoop]: Abstraction has 133731 states and 214948 transitions. [2019-09-10 09:04:42,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 09:04:42,295 INFO L276 IsEmpty]: Start isEmpty. Operand 133731 states and 214948 transitions. [2019-09-10 09:04:42,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2019-09-10 09:04:42,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:42,343 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:04:42,343 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:42,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:42,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1493698750, now seen corresponding path program 1 times [2019-09-10 09:04:42,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:42,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:42,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:42,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:42,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:42,787 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 09:04:42,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:42,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:04:42,788 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:42,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:04:42,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:04:42,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:04:42,789 INFO L87 Difference]: Start difference. First operand 133731 states and 214948 transitions. Second operand 3 states. [2019-09-10 09:04:46,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:46,178 INFO L93 Difference]: Finished difference Result 262770 states and 421271 transitions. [2019-09-10 09:04:46,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:04:46,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 498 [2019-09-10 09:04:46,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:46,421 INFO L225 Difference]: With dead ends: 262770 [2019-09-10 09:04:46,421 INFO L226 Difference]: Without dead ends: 262770 [2019-09-10 09:04:46,421 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 09:04:46,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262770 states. [2019-09-10 09:04:48,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262770 to 262768. [2019-09-10 09:04:48,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262768 states. [2019-09-10 09:04:48,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262768 states to 262768 states and 421270 transitions. [2019-09-10 09:04:48,958 INFO L78 Accepts]: Start accepts. Automaton has 262768 states and 421270 transitions. Word has length 498 [2019-09-10 09:04:48,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:04:48,959 INFO L475 AbstractCegarLoop]: Abstraction has 262768 states and 421270 transitions. [2019-09-10 09:04:48,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:04:48,959 INFO L276 IsEmpty]: Start isEmpty. Operand 262768 states and 421270 transitions. [2019-09-10 09:04:49,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-09-10 09:04:49,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:04:49,064 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:04:49,065 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:04:49,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:04:49,065 INFO L82 PathProgramCache]: Analyzing trace with hash 2080836239, now seen corresponding path program 1 times [2019-09-10 09:04:49,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:04:49,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:49,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:04:49,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:04:49,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:04:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:04:49,344 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 09:04:49,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:04:49,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:04:49,347 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:04:49,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:04:49,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:04:49,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:04:49,348 INFO L87 Difference]: Start difference. First operand 262768 states and 421270 transitions. Second operand 3 states. [2019-09-10 09:04:50,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:04:50,337 INFO L93 Difference]: Finished difference Result 514240 states and 822144 transitions. [2019-09-10 09:04:50,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:04:50,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 499 [2019-09-10 09:04:50,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:04:56,547 INFO L225 Difference]: With dead ends: 514240 [2019-09-10 09:04:56,547 INFO L226 Difference]: Without dead ends: 514240 [2019-09-10 09:04:56,548 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 09:04:56,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514240 states. [2019-09-10 09:04:59,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514240 to 265318. [2019-09-10 09:04:59,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265318 states. [2019-09-10 09:05:00,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265318 states to 265318 states and 424939 transitions. [2019-09-10 09:05:00,114 INFO L78 Accepts]: Start accepts. Automaton has 265318 states and 424939 transitions. Word has length 499 [2019-09-10 09:05:00,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:05:00,115 INFO L475 AbstractCegarLoop]: Abstraction has 265318 states and 424939 transitions. [2019-09-10 09:05:00,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:05:00,115 INFO L276 IsEmpty]: Start isEmpty. Operand 265318 states and 424939 transitions. [2019-09-10 09:05:00,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-09-10 09:05:00,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:00,222 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:05:00,222 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:00,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:00,222 INFO L82 PathProgramCache]: Analyzing trace with hash -549806561, now seen corresponding path program 1 times [2019-09-10 09:05:00,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:00,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:00,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:00,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:00,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:05:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:01,199 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 09:05:01,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:01,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:05:01,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:01,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:05:01,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:05:01,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:05:01,201 INFO L87 Difference]: Start difference. First operand 265318 states and 424939 transitions. Second operand 3 states. [2019-09-10 09:05:02,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:02,172 INFO L93 Difference]: Finished difference Result 421372 states and 676508 transitions. [2019-09-10 09:05:02,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:05:02,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 499 [2019-09-10 09:05:02,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:02,644 INFO L225 Difference]: With dead ends: 421372 [2019-09-10 09:05:02,644 INFO L226 Difference]: Without dead ends: 421372 [2019-09-10 09:05:02,645 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 09:05:02,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421372 states. [2019-09-10 09:05:12,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421372 to 387382. [2019-09-10 09:05:12,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387382 states. [2019-09-10 09:05:13,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387382 states to 387382 states and 622883 transitions. [2019-09-10 09:05:13,080 INFO L78 Accepts]: Start accepts. Automaton has 387382 states and 622883 transitions. Word has length 499 [2019-09-10 09:05:13,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:05:13,080 INFO L475 AbstractCegarLoop]: Abstraction has 387382 states and 622883 transitions. [2019-09-10 09:05:13,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:05:13,081 INFO L276 IsEmpty]: Start isEmpty. Operand 387382 states and 622883 transitions. [2019-09-10 09:05:13,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2019-09-10 09:05:13,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:13,176 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:05:13,176 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:13,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:13,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1791362985, now seen corresponding path program 1 times [2019-09-10 09:05:13,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:13,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:13,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:13,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:13,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:05:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:14,416 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 09:05:14,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:14,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:05:14,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:14,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:05:14,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:05:14,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:05:14,418 INFO L87 Difference]: Start difference. First operand 387382 states and 622883 transitions. Second operand 3 states. [2019-09-10 09:05:15,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:15,931 INFO L93 Difference]: Finished difference Result 761730 states and 1222166 transitions. [2019-09-10 09:05:15,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:05:15,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 500 [2019-09-10 09:05:15,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:24,586 INFO L225 Difference]: With dead ends: 761730 [2019-09-10 09:05:24,587 INFO L226 Difference]: Without dead ends: 761730 [2019-09-10 09:05:24,587 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 09:05:24,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761730 states. [2019-09-10 09:05:29,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761730 to 390744. [2019-09-10 09:05:29,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390744 states. [2019-09-10 09:05:30,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390744 states to 390744 states and 627017 transitions. [2019-09-10 09:05:30,493 INFO L78 Accepts]: Start accepts. Automaton has 390744 states and 627017 transitions. Word has length 500 [2019-09-10 09:05:30,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:05:30,493 INFO L475 AbstractCegarLoop]: Abstraction has 390744 states and 627017 transitions. [2019-09-10 09:05:30,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:05:30,493 INFO L276 IsEmpty]: Start isEmpty. Operand 390744 states and 627017 transitions. [2019-09-10 09:05:31,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2019-09-10 09:05:31,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:05:31,642 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:05:31,643 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:05:31,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:05:31,643 INFO L82 PathProgramCache]: Analyzing trace with hash -96364935, now seen corresponding path program 1 times [2019-09-10 09:05:31,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:05:31,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:31,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:05:31,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:05:31,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:05:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:05:32,133 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 09:05:32,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:05:32,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:05:32,134 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:05:32,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:05:32,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:05:32,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:05:32,135 INFO L87 Difference]: Start difference. First operand 390744 states and 627017 transitions. Second operand 3 states. [2019-09-10 09:05:34,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:05:34,878 INFO L93 Difference]: Finished difference Result 771334 states and 1233784 transitions. [2019-09-10 09:05:34,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:05:34,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 500 [2019-09-10 09:05:34,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:05:35,749 INFO L225 Difference]: With dead ends: 771334 [2019-09-10 09:05:35,750 INFO L226 Difference]: Without dead ends: 771334 [2019-09-10 09:05:35,750 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 09:05:36,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771334 states. [2019-09-10 09:05:51,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771334 to 771332. [2019-09-10 09:05:51,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771332 states. [2019-09-10 09:06:03,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771332 states to 771332 states and 1233783 transitions. [2019-09-10 09:06:03,142 INFO L78 Accepts]: Start accepts. Automaton has 771332 states and 1233783 transitions. Word has length 500 [2019-09-10 09:06:03,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:06:03,142 INFO L475 AbstractCegarLoop]: Abstraction has 771332 states and 1233783 transitions. [2019-09-10 09:06:03,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:06:03,142 INFO L276 IsEmpty]: Start isEmpty. Operand 771332 states and 1233783 transitions. [2019-09-10 09:06:03,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2019-09-10 09:06:03,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:06:03,346 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:06:03,346 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:06:03,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:06:03,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1343003732, now seen corresponding path program 1 times [2019-09-10 09:06:03,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:06:03,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:03,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:06:03,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:06:03,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:06:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:06:03,889 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 09:06:03,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:06:03,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:06:03,889 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:06:03,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:06:03,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:06:03,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:06:03,891 INFO L87 Difference]: Start difference. First operand 771332 states and 1233783 transitions. Second operand 3 states. [2019-09-10 09:06:22,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:06:22,302 INFO L93 Difference]: Finished difference Result 1516123 states and 2415971 transitions. [2019-09-10 09:06:22,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:06:22,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 502 [2019-09-10 09:06:22,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:06:24,193 INFO L225 Difference]: With dead ends: 1516123 [2019-09-10 09:06:24,193 INFO L226 Difference]: Without dead ends: 1516123 [2019-09-10 09:06:24,193 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 09:06:25,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516123 states. [2019-09-10 09:06:57,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516123 to 1516121. [2019-09-10 09:06:57,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1516121 states. [2019-09-10 09:07:15,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516121 states to 1516121 states and 2415970 transitions. [2019-09-10 09:07:15,089 INFO L78 Accepts]: Start accepts. Automaton has 1516121 states and 2415970 transitions. Word has length 502 [2019-09-10 09:07:15,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:07:15,089 INFO L475 AbstractCegarLoop]: Abstraction has 1516121 states and 2415970 transitions. [2019-09-10 09:07:15,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:07:15,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1516121 states and 2415970 transitions. [2019-09-10 09:07:18,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2019-09-10 09:07:18,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:07:18,159 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:07:18,159 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:07:18,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:07:18,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1783720207, now seen corresponding path program 1 times [2019-09-10 09:07:18,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:07:18,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:18,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:07:18,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:07:18,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:07:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:07:18,726 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 09:07:18,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:07:18,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 09:07:18,726 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:07:18,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 09:07:18,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 09:07:18,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 09:07:18,728 INFO L87 Difference]: Start difference. First operand 1516121 states and 2415970 transitions. Second operand 4 states. [2019-09-10 09:07:40,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:07:40,853 INFO L93 Difference]: Finished difference Result 2876835 states and 4579302 transitions. [2019-09-10 09:07:40,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 09:07:40,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 502 [2019-09-10 09:07:40,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:07:59,400 INFO L225 Difference]: With dead ends: 2876835 [2019-09-10 09:07:59,400 INFO L226 Difference]: Without dead ends: 2876835 [2019-09-10 09:07:59,401 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 09:08:00,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2876835 states.