java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:24:54,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:24:54,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:24:54,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:24:54,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:24:54,151 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:24:54,152 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:24:54,154 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:24:54,163 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:24:54,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:24:54,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:24:54,168 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:24:54,168 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:24:54,169 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:24:54,170 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:24:54,171 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:24:54,171 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:24:54,173 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:24:54,176 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:24:54,180 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:24:54,182 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:24:54,183 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:24:54,185 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:24:54,186 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:24:54,188 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:24:54,188 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:24:54,188 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:24:54,191 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:24:54,192 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:24:54,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:24:54,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:24:54,195 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:24:54,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:24:54,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:24:54,199 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:24:54,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:24:54,202 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:24:54,202 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:24:54,202 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:24:54,203 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:24:54,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:24:54,206 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:24:54,227 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:24:54,227 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:24:54,227 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:24:54,228 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:24:54,228 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:24:54,229 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:24:54,229 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:24:54,229 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:24:54,229 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:24:54,230 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:24:54,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:24:54,230 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:24:54,231 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:24:54,231 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:24:54,231 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:24:54,231 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:24:54,231 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:24:54,232 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:24:54,232 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:24:54,232 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:24:54,232 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:24:54,233 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:24:54,233 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:24:54,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:24:54,233 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:24:54,233 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:24:54,234 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:24:54,234 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:24:54,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:24:54,234 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:24:54,261 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:24:54,276 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:24:54,279 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:24:54,281 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:24:54,281 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:24:54,282 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:24:54,348 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/685cd6834/c55c58678a294347a5acb222f5c21eff/FLAGe8ae884be [2019-09-10 06:24:54,884 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:24:54,885 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:24:54,911 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/685cd6834/c55c58678a294347a5acb222f5c21eff/FLAGe8ae884be [2019-09-10 06:24:55,174 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/685cd6834/c55c58678a294347a5acb222f5c21eff [2019-09-10 06:24:55,183 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:24:55,184 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:24:55,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:24:55,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:24:55,188 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:24:55,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:24:55" (1/1) ... [2019-09-10 06:24:55,192 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52f1ec00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:55, skipping insertion in model container [2019-09-10 06:24:55,192 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:24:55" (1/1) ... [2019-09-10 06:24:55,198 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:24:55,308 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:24:56,454 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:24:56,472 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:24:56,874 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:24:56,913 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:24:56,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:56 WrapperNode [2019-09-10 06:24:56,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:24:56,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:24:56,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:24:56,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:24:56,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:56" (1/1) ... [2019-09-10 06:24:56,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:56" (1/1) ... [2019-09-10 06:24:56,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:56" (1/1) ... [2019-09-10 06:24:56,981 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:56" (1/1) ... [2019-09-10 06:24:57,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:56" (1/1) ... [2019-09-10 06:24:57,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:56" (1/1) ... [2019-09-10 06:24:57,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:56" (1/1) ... [2019-09-10 06:24:57,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:24:57,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:24:57,099 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:24:57,099 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:24:57,101 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:24:57,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:24:57,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:24:57,170 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:24:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:24:57,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:24:57,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:24:57,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:24:57,171 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:24:57,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:24:57,171 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:24:57,172 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:24:57,172 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:24:57,172 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:24:57,173 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:24:57,173 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:24:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:24:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:24:57,175 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:24:57,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:24:57,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:24:59,519 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:24:59,519 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:24:59,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:24:59 BoogieIcfgContainer [2019-09-10 06:24:59,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:24:59,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:24:59,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:24:59,525 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:24:59,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:24:55" (1/3) ... [2019-09-10 06:24:59,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e3b6a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:24:59, skipping insertion in model container [2019-09-10 06:24:59,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:24:56" (2/3) ... [2019-09-10 06:24:59,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e3b6a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:24:59, skipping insertion in model container [2019-09-10 06:24:59,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:24:59" (3/3) ... [2019-09-10 06:24:59,528 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-09-10 06:24:59,538 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:24:59,545 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:24:59,562 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:24:59,588 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:24:59,589 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:24:59,589 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:24:59,589 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:24:59,589 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:24:59,589 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:24:59,589 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:24:59,590 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:24:59,619 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states. [2019-09-10 06:24:59,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-10 06:24:59,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:24:59,650 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:24:59,652 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:24:59,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:24:59,658 INFO L82 PathProgramCache]: Analyzing trace with hash 868226715, now seen corresponding path program 1 times [2019-09-10 06:24:59,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:24:59,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:59,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:24:59,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:24:59,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:00,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:00,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:00,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:00,647 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:00,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:00,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:00,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:00,673 INFO L87 Difference]: Start difference. First operand 721 states. Second operand 3 states. [2019-09-10 06:25:00,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:00,974 INFO L93 Difference]: Finished difference Result 1161 states and 2060 transitions. [2019-09-10 06:25:00,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:00,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-10 06:25:00,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:01,015 INFO L225 Difference]: With dead ends: 1161 [2019-09-10 06:25:01,015 INFO L226 Difference]: Without dead ends: 1153 [2019-09-10 06:25:01,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:01,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2019-09-10 06:25:01,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1151. [2019-09-10 06:25:01,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2019-09-10 06:25:01,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1780 transitions. [2019-09-10 06:25:01,127 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1780 transitions. Word has length 310 [2019-09-10 06:25:01,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:01,131 INFO L475 AbstractCegarLoop]: Abstraction has 1151 states and 1780 transitions. [2019-09-10 06:25:01,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:01,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1780 transitions. [2019-09-10 06:25:01,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-10 06:25:01,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:01,145 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:25:01,145 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:01,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:01,146 INFO L82 PathProgramCache]: Analyzing trace with hash -2087416445, now seen corresponding path program 1 times [2019-09-10 06:25:01,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:01,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:01,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:01,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:01,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:01,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:01,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:01,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:01,587 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:01,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:01,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:01,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:01,591 INFO L87 Difference]: Start difference. First operand 1151 states and 1780 transitions. Second operand 3 states. [2019-09-10 06:25:01,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:01,894 INFO L93 Difference]: Finished difference Result 2003 states and 3087 transitions. [2019-09-10 06:25:01,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:01,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-10 06:25:01,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:01,911 INFO L225 Difference]: With dead ends: 2003 [2019-09-10 06:25:01,911 INFO L226 Difference]: Without dead ends: 2003 [2019-09-10 06:25:01,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:01,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2019-09-10 06:25:01,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 2001. [2019-09-10 06:25:01,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2001 states. [2019-09-10 06:25:01,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 3086 transitions. [2019-09-10 06:25:01,976 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 3086 transitions. Word has length 310 [2019-09-10 06:25:01,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:01,977 INFO L475 AbstractCegarLoop]: Abstraction has 2001 states and 3086 transitions. [2019-09-10 06:25:01,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:01,977 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 3086 transitions. [2019-09-10 06:25:01,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-10 06:25:01,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:01,991 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:25:01,991 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:01,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:01,991 INFO L82 PathProgramCache]: Analyzing trace with hash 204836255, now seen corresponding path program 1 times [2019-09-10 06:25:01,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:01,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:01,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:01,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:01,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:02,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:02,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:02,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:02,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:02,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:02,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:02,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:02,321 INFO L87 Difference]: Start difference. First operand 2001 states and 3086 transitions. Second operand 3 states. [2019-09-10 06:25:02,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:02,532 INFO L93 Difference]: Finished difference Result 3631 states and 5575 transitions. [2019-09-10 06:25:02,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:02,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-10 06:25:02,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:02,552 INFO L225 Difference]: With dead ends: 3631 [2019-09-10 06:25:02,552 INFO L226 Difference]: Without dead ends: 3631 [2019-09-10 06:25:02,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:02,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3631 states. [2019-09-10 06:25:02,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3631 to 3629. [2019-09-10 06:25:02,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3629 states. [2019-09-10 06:25:02,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3629 states to 3629 states and 5574 transitions. [2019-09-10 06:25:02,635 INFO L78 Accepts]: Start accepts. Automaton has 3629 states and 5574 transitions. Word has length 310 [2019-09-10 06:25:02,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:02,636 INFO L475 AbstractCegarLoop]: Abstraction has 3629 states and 5574 transitions. [2019-09-10 06:25:02,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:02,636 INFO L276 IsEmpty]: Start isEmpty. Operand 3629 states and 5574 transitions. [2019-09-10 06:25:02,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-10 06:25:02,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:02,645 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:25:02,645 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:02,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:02,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1606789085, now seen corresponding path program 1 times [2019-09-10 06:25:02,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:02,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:02,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:02,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:02,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:03,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:03,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:03,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:25:03,432 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:03,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:25:03,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:25:03,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:25:03,434 INFO L87 Difference]: Start difference. First operand 3629 states and 5574 transitions. Second operand 4 states. [2019-09-10 06:25:03,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:03,613 INFO L93 Difference]: Finished difference Result 7147 states and 10917 transitions. [2019-09-10 06:25:03,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:25:03,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 310 [2019-09-10 06:25:03,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:03,648 INFO L225 Difference]: With dead ends: 7147 [2019-09-10 06:25:03,649 INFO L226 Difference]: Without dead ends: 7147 [2019-09-10 06:25:03,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:25:03,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7147 states. [2019-09-10 06:25:03,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7147 to 7145. [2019-09-10 06:25:03,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7145 states. [2019-09-10 06:25:03,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7145 states to 7145 states and 10916 transitions. [2019-09-10 06:25:03,882 INFO L78 Accepts]: Start accepts. Automaton has 7145 states and 10916 transitions. Word has length 310 [2019-09-10 06:25:03,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:03,882 INFO L475 AbstractCegarLoop]: Abstraction has 7145 states and 10916 transitions. [2019-09-10 06:25:03,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:25:03,882 INFO L276 IsEmpty]: Start isEmpty. Operand 7145 states and 10916 transitions. [2019-09-10 06:25:03,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-10 06:25:03,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:03,907 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:25:03,907 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:03,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:03,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1465903914, now seen corresponding path program 1 times [2019-09-10 06:25:03,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:03,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:03,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:03,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:03,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:04,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:04,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:04,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:04,198 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:04,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:04,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:04,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:04,200 INFO L87 Difference]: Start difference. First operand 7145 states and 10916 transitions. Second operand 3 states. [2019-09-10 06:25:04,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:04,353 INFO L93 Difference]: Finished difference Result 14018 states and 21286 transitions. [2019-09-10 06:25:04,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:04,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-10 06:25:04,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:04,435 INFO L225 Difference]: With dead ends: 14018 [2019-09-10 06:25:04,436 INFO L226 Difference]: Without dead ends: 14018 [2019-09-10 06:25:04,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:04,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14018 states. [2019-09-10 06:25:04,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14018 to 14016. [2019-09-10 06:25:04,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14016 states. [2019-09-10 06:25:04,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14016 states to 14016 states and 21285 transitions. [2019-09-10 06:25:04,782 INFO L78 Accepts]: Start accepts. Automaton has 14016 states and 21285 transitions. Word has length 312 [2019-09-10 06:25:04,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:04,783 INFO L475 AbstractCegarLoop]: Abstraction has 14016 states and 21285 transitions. [2019-09-10 06:25:04,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:04,783 INFO L276 IsEmpty]: Start isEmpty. Operand 14016 states and 21285 transitions. [2019-09-10 06:25:04,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-10 06:25:04,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:04,811 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:25:04,811 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:04,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:04,812 INFO L82 PathProgramCache]: Analyzing trace with hash 2044247323, now seen corresponding path program 1 times [2019-09-10 06:25:04,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:04,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:04,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:04,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:04,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:04,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:04,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:04,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:04,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:04,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:04,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:04,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:04,965 INFO L87 Difference]: Start difference. First operand 14016 states and 21285 transitions. Second operand 3 states. [2019-09-10 06:25:05,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:05,086 INFO L93 Difference]: Finished difference Result 27999 states and 42510 transitions. [2019-09-10 06:25:05,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:05,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-09-10 06:25:05,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:05,151 INFO L225 Difference]: With dead ends: 27999 [2019-09-10 06:25:05,151 INFO L226 Difference]: Without dead ends: 27999 [2019-09-10 06:25:05,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:05,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27999 states. [2019-09-10 06:25:06,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27999 to 14035. [2019-09-10 06:25:06,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14035 states. [2019-09-10 06:25:06,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14035 states to 14035 states and 21313 transitions. [2019-09-10 06:25:06,110 INFO L78 Accepts]: Start accepts. Automaton has 14035 states and 21313 transitions. Word has length 312 [2019-09-10 06:25:06,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:06,110 INFO L475 AbstractCegarLoop]: Abstraction has 14035 states and 21313 transitions. [2019-09-10 06:25:06,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:06,115 INFO L276 IsEmpty]: Start isEmpty. Operand 14035 states and 21313 transitions. [2019-09-10 06:25:06,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-09-10 06:25:06,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:06,139 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] [2019-09-10 06:25:06,140 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:06,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:06,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1586277871, now seen corresponding path program 1 times [2019-09-10 06:25:06,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:06,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:06,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:06,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:06,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:06,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:06,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:06,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:06,280 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:06,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:06,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:06,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:06,283 INFO L87 Difference]: Start difference. First operand 14035 states and 21313 transitions. Second operand 3 states. [2019-09-10 06:25:06,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:06,394 INFO L93 Difference]: Finished difference Result 28017 states and 42531 transitions. [2019-09-10 06:25:06,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:06,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-09-10 06:25:06,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:06,448 INFO L225 Difference]: With dead ends: 28017 [2019-09-10 06:25:06,448 INFO L226 Difference]: Without dead ends: 28017 [2019-09-10 06:25:06,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:06,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28017 states. [2019-09-10 06:25:06,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28017 to 14053. [2019-09-10 06:25:06,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14053 states. [2019-09-10 06:25:06,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14053 states to 14053 states and 21334 transitions. [2019-09-10 06:25:06,904 INFO L78 Accepts]: Start accepts. Automaton has 14053 states and 21334 transitions. Word has length 313 [2019-09-10 06:25:06,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:06,904 INFO L475 AbstractCegarLoop]: Abstraction has 14053 states and 21334 transitions. [2019-09-10 06:25:06,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:06,904 INFO L276 IsEmpty]: Start isEmpty. Operand 14053 states and 21334 transitions. [2019-09-10 06:25:06,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:25:06,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:06,926 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:25:06,926 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:06,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:06,927 INFO L82 PathProgramCache]: Analyzing trace with hash 265595537, now seen corresponding path program 1 times [2019-09-10 06:25:06,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:06,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:06,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:06,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:06,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:07,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:07,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:07,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:07,199 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:07,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:07,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:07,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:07,201 INFO L87 Difference]: Start difference. First operand 14053 states and 21334 transitions. Second operand 3 states. [2019-09-10 06:25:07,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:07,364 INFO L93 Difference]: Finished difference Result 25986 states and 39155 transitions. [2019-09-10 06:25:07,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:07,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-10 06:25:07,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:07,416 INFO L225 Difference]: With dead ends: 25986 [2019-09-10 06:25:07,417 INFO L226 Difference]: Without dead ends: 25986 [2019-09-10 06:25:07,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:07,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25986 states. [2019-09-10 06:25:07,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25986 to 25984. [2019-09-10 06:25:07,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25984 states. [2019-09-10 06:25:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25984 states to 25984 states and 39154 transitions. [2019-09-10 06:25:07,768 INFO L78 Accepts]: Start accepts. Automaton has 25984 states and 39154 transitions. Word has length 314 [2019-09-10 06:25:07,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:07,769 INFO L475 AbstractCegarLoop]: Abstraction has 25984 states and 39154 transitions. [2019-09-10 06:25:07,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:07,769 INFO L276 IsEmpty]: Start isEmpty. Operand 25984 states and 39154 transitions. [2019-09-10 06:25:07,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-10 06:25:07,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:07,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] [2019-09-10 06:25:07,818 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:07,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:07,818 INFO L82 PathProgramCache]: Analyzing trace with hash 197586990, now seen corresponding path program 1 times [2019-09-10 06:25:07,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:07,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:07,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:07,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:07,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:08,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:08,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:08,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:25:08,779 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:08,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:25:08,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:25:08,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:25:08,781 INFO L87 Difference]: Start difference. First operand 25984 states and 39154 transitions. Second operand 4 states. [2019-09-10 06:25:08,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:08,942 INFO L93 Difference]: Finished difference Result 49895 states and 75060 transitions. [2019-09-10 06:25:08,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:25:08,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 314 [2019-09-10 06:25:08,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:09,048 INFO L225 Difference]: With dead ends: 49895 [2019-09-10 06:25:09,049 INFO L226 Difference]: Without dead ends: 49895 [2019-09-10 06:25:09,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:25:09,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49895 states. [2019-09-10 06:25:09,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49895 to 26219. [2019-09-10 06:25:09,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26219 states. [2019-09-10 06:25:09,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26219 states to 26219 states and 39542 transitions. [2019-09-10 06:25:09,520 INFO L78 Accepts]: Start accepts. Automaton has 26219 states and 39542 transitions. Word has length 314 [2019-09-10 06:25:09,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:09,521 INFO L475 AbstractCegarLoop]: Abstraction has 26219 states and 39542 transitions. [2019-09-10 06:25:09,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:25:09,521 INFO L276 IsEmpty]: Start isEmpty. Operand 26219 states and 39542 transitions. [2019-09-10 06:25:09,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-10 06:25:09,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:09,558 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:25:09,559 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:09,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:09,559 INFO L82 PathProgramCache]: Analyzing trace with hash -561760958, now seen corresponding path program 1 times [2019-09-10 06:25:09,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:09,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:09,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:09,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:09,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:09,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:09,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:09,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:09,764 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:09,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:09,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:09,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:09,765 INFO L87 Difference]: Start difference. First operand 26219 states and 39542 transitions. Second operand 3 states. [2019-09-10 06:25:09,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:09,901 INFO L93 Difference]: Finished difference Result 51671 states and 77728 transitions. [2019-09-10 06:25:09,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:09,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-09-10 06:25:09,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:10,005 INFO L225 Difference]: With dead ends: 51671 [2019-09-10 06:25:10,006 INFO L226 Difference]: Without dead ends: 51671 [2019-09-10 06:25:10,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:10,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51671 states. [2019-09-10 06:25:10,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51671 to 26323. [2019-09-10 06:25:10,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26323 states. [2019-09-10 06:25:10,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26323 states to 26323 states and 39685 transitions. [2019-09-10 06:25:10,518 INFO L78 Accepts]: Start accepts. Automaton has 26323 states and 39685 transitions. Word has length 316 [2019-09-10 06:25:10,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:10,518 INFO L475 AbstractCegarLoop]: Abstraction has 26323 states and 39685 transitions. [2019-09-10 06:25:10,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:10,519 INFO L276 IsEmpty]: Start isEmpty. Operand 26323 states and 39685 transitions. [2019-09-10 06:25:10,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-10 06:25:10,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:10,571 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] [2019-09-10 06:25:10,571 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:10,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:10,572 INFO L82 PathProgramCache]: Analyzing trace with hash -177363696, now seen corresponding path program 1 times [2019-09-10 06:25:10,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:10,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:10,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:10,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:10,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:10,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:10,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:10,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:10,706 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:10,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:10,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:10,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:10,707 INFO L87 Difference]: Start difference. First operand 26323 states and 39685 transitions. Second operand 3 states. [2019-09-10 06:25:10,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:10,847 INFO L93 Difference]: Finished difference Result 51796 states and 77874 transitions. [2019-09-10 06:25:10,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:10,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2019-09-10 06:25:10,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:10,951 INFO L225 Difference]: With dead ends: 51796 [2019-09-10 06:25:10,951 INFO L226 Difference]: Without dead ends: 51796 [2019-09-10 06:25:10,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:11,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51796 states. [2019-09-10 06:25:11,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51796 to 26448. [2019-09-10 06:25:11,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26448 states. [2019-09-10 06:25:11,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26448 states to 26448 states and 39831 transitions. [2019-09-10 06:25:11,667 INFO L78 Accepts]: Start accepts. Automaton has 26448 states and 39831 transitions. Word has length 317 [2019-09-10 06:25:11,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:11,667 INFO L475 AbstractCegarLoop]: Abstraction has 26448 states and 39831 transitions. [2019-09-10 06:25:11,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:11,668 INFO L276 IsEmpty]: Start isEmpty. Operand 26448 states and 39831 transitions. [2019-09-10 06:25:11,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-09-10 06:25:11,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:11,689 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] [2019-09-10 06:25:11,689 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:11,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:11,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1917251435, now seen corresponding path program 1 times [2019-09-10 06:25:11,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:11,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:11,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:11,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:11,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:11,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:11,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:25:11,995 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:11,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:25:11,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:25:11,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:25:11,997 INFO L87 Difference]: Start difference. First operand 26448 states and 39831 transitions. Second operand 4 states. [2019-09-10 06:25:12,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:12,088 INFO L93 Difference]: Finished difference Result 25421 states and 38322 transitions. [2019-09-10 06:25:12,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:25:12,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 318 [2019-09-10 06:25:12,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:12,131 INFO L225 Difference]: With dead ends: 25421 [2019-09-10 06:25:12,132 INFO L226 Difference]: Without dead ends: 24624 [2019-09-10 06:25:12,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:25:12,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24624 states. [2019-09-10 06:25:12,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24624 to 24604. [2019-09-10 06:25:12,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24604 states. [2019-09-10 06:25:12,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24604 states to 24604 states and 37055 transitions. [2019-09-10 06:25:12,436 INFO L78 Accepts]: Start accepts. Automaton has 24604 states and 37055 transitions. Word has length 318 [2019-09-10 06:25:12,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:12,436 INFO L475 AbstractCegarLoop]: Abstraction has 24604 states and 37055 transitions. [2019-09-10 06:25:12,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:25:12,437 INFO L276 IsEmpty]: Start isEmpty. Operand 24604 states and 37055 transitions. [2019-09-10 06:25:12,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-09-10 06:25:12,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:12,457 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:25:12,457 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:12,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:12,458 INFO L82 PathProgramCache]: Analyzing trace with hash -728131852, now seen corresponding path program 1 times [2019-09-10 06:25:12,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:12,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:12,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:12,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:12,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:13,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:13,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:13,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:13,392 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:13,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:13,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:13,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:13,394 INFO L87 Difference]: Start difference. First operand 24604 states and 37055 transitions. Second operand 3 states. [2019-09-10 06:25:14,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:14,021 INFO L93 Difference]: Finished difference Result 46350 states and 69405 transitions. [2019-09-10 06:25:14,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:14,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 319 [2019-09-10 06:25:14,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:14,070 INFO L225 Difference]: With dead ends: 46350 [2019-09-10 06:25:14,070 INFO L226 Difference]: Without dead ends: 46350 [2019-09-10 06:25:14,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:14,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46350 states. [2019-09-10 06:25:14,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46350 to 46348. [2019-09-10 06:25:14,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46348 states. [2019-09-10 06:25:14,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46348 states to 46348 states and 69404 transitions. [2019-09-10 06:25:14,626 INFO L78 Accepts]: Start accepts. Automaton has 46348 states and 69404 transitions. Word has length 319 [2019-09-10 06:25:14,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:14,626 INFO L475 AbstractCegarLoop]: Abstraction has 46348 states and 69404 transitions. [2019-09-10 06:25:14,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:14,627 INFO L276 IsEmpty]: Start isEmpty. Operand 46348 states and 69404 transitions. [2019-09-10 06:25:14,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-09-10 06:25:14,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:14,667 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] [2019-09-10 06:25:14,667 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:14,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:14,667 INFO L82 PathProgramCache]: Analyzing trace with hash -355830279, now seen corresponding path program 1 times [2019-09-10 06:25:14,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:14,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:14,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:14,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:14,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:15,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:15,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:15,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:25:15,195 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:15,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:25:15,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:25:15,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:25:15,196 INFO L87 Difference]: Start difference. First operand 46348 states and 69404 transitions. Second operand 5 states. [2019-09-10 06:25:15,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:15,929 INFO L93 Difference]: Finished difference Result 39310 states and 59478 transitions. [2019-09-10 06:25:15,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 06:25:15,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 319 [2019-09-10 06:25:15,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:15,975 INFO L225 Difference]: With dead ends: 39310 [2019-09-10 06:25:15,975 INFO L226 Difference]: Without dead ends: 39254 [2019-09-10 06:25:15,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:25:16,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39254 states. [2019-09-10 06:25:16,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39254 to 39252. [2019-09-10 06:25:16,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39252 states. [2019-09-10 06:25:16,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39252 states to 39252 states and 59409 transitions. [2019-09-10 06:25:16,369 INFO L78 Accepts]: Start accepts. Automaton has 39252 states and 59409 transitions. Word has length 319 [2019-09-10 06:25:16,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:16,369 INFO L475 AbstractCegarLoop]: Abstraction has 39252 states and 59409 transitions. [2019-09-10 06:25:16,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:25:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 39252 states and 59409 transitions. [2019-09-10 06:25:16,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-09-10 06:25:16,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:16,400 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] [2019-09-10 06:25:16,400 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:16,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:16,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1204773999, now seen corresponding path program 1 times [2019-09-10 06:25:16,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:16,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:16,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:16,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:16,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:16,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:16,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:16,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 06:25:16,861 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:16,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 06:25:16,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 06:25:16,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:25:16,862 INFO L87 Difference]: Start difference. First operand 39252 states and 59409 transitions. Second operand 8 states. [2019-09-10 06:25:18,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:18,446 INFO L93 Difference]: Finished difference Result 76280 states and 117977 transitions. [2019-09-10 06:25:18,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 06:25:18,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 319 [2019-09-10 06:25:18,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:18,538 INFO L225 Difference]: With dead ends: 76280 [2019-09-10 06:25:18,538 INFO L226 Difference]: Without dead ends: 76280 [2019-09-10 06:25:18,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-09-10 06:25:18,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76280 states. [2019-09-10 06:25:19,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76280 to 46062. [2019-09-10 06:25:19,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46062 states. [2019-09-10 06:25:19,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46062 states to 46062 states and 69342 transitions. [2019-09-10 06:25:19,607 INFO L78 Accepts]: Start accepts. Automaton has 46062 states and 69342 transitions. Word has length 319 [2019-09-10 06:25:19,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:19,609 INFO L475 AbstractCegarLoop]: Abstraction has 46062 states and 69342 transitions. [2019-09-10 06:25:19,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 06:25:19,609 INFO L276 IsEmpty]: Start isEmpty. Operand 46062 states and 69342 transitions. [2019-09-10 06:25:19,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-09-10 06:25:19,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:19,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] [2019-09-10 06:25:19,642 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:19,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:19,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1461261681, now seen corresponding path program 1 times [2019-09-10 06:25:19,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:19,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:19,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:19,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:19,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:20,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:20,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:20,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:25:20,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:20,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:25:20,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:25:20,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:25:20,450 INFO L87 Difference]: Start difference. First operand 46062 states and 69342 transitions. Second operand 4 states. [2019-09-10 06:25:20,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:20,773 INFO L93 Difference]: Finished difference Result 90586 states and 135668 transitions. [2019-09-10 06:25:20,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:25:20,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 319 [2019-09-10 06:25:20,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:20,885 INFO L225 Difference]: With dead ends: 90586 [2019-09-10 06:25:20,886 INFO L226 Difference]: Without dead ends: 90562 [2019-09-10 06:25:20,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:25:20,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90562 states. [2019-09-10 06:25:21,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90562 to 90560. [2019-09-10 06:25:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90560 states. [2019-09-10 06:25:21,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90560 states to 90560 states and 135643 transitions. [2019-09-10 06:25:21,823 INFO L78 Accepts]: Start accepts. Automaton has 90560 states and 135643 transitions. Word has length 319 [2019-09-10 06:25:21,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:21,823 INFO L475 AbstractCegarLoop]: Abstraction has 90560 states and 135643 transitions. [2019-09-10 06:25:21,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:25:21,823 INFO L276 IsEmpty]: Start isEmpty. Operand 90560 states and 135643 transitions. [2019-09-10 06:25:21,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-10 06:25:21,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:21,864 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] [2019-09-10 06:25:21,864 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:21,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:21,864 INFO L82 PathProgramCache]: Analyzing trace with hash -2088154721, now seen corresponding path program 1 times [2019-09-10 06:25:21,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:21,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:21,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:21,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:21,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:23,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:23,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:23,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:23,579 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:23,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:23,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:23,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:23,581 INFO L87 Difference]: Start difference. First operand 90560 states and 135643 transitions. Second operand 3 states. [2019-09-10 06:25:24,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:24,031 INFO L93 Difference]: Finished difference Result 177101 states and 263929 transitions. [2019-09-10 06:25:24,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:24,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-09-10 06:25:24,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:24,215 INFO L225 Difference]: With dead ends: 177101 [2019-09-10 06:25:24,215 INFO L226 Difference]: Without dead ends: 177101 [2019-09-10 06:25:24,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:24,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177101 states. [2019-09-10 06:25:25,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177101 to 177099. [2019-09-10 06:25:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177099 states. [2019-09-10 06:25:25,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177099 states to 177099 states and 263928 transitions. [2019-09-10 06:25:25,978 INFO L78 Accepts]: Start accepts. Automaton has 177099 states and 263928 transitions. Word has length 321 [2019-09-10 06:25:25,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:25,979 INFO L475 AbstractCegarLoop]: Abstraction has 177099 states and 263928 transitions. [2019-09-10 06:25:25,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:25,979 INFO L276 IsEmpty]: Start isEmpty. Operand 177099 states and 263928 transitions. [2019-09-10 06:25:26,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-10 06:25:26,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:26,055 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] [2019-09-10 06:25:26,055 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:26,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:26,056 INFO L82 PathProgramCache]: Analyzing trace with hash 464862980, now seen corresponding path program 1 times [2019-09-10 06:25:26,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:26,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:26,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:26,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:26,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:26,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:26,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:26,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:26,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:26,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:26,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:26,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:26,274 INFO L87 Difference]: Start difference. First operand 177099 states and 263928 transitions. Second operand 3 states. [2019-09-10 06:25:30,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:30,048 INFO L93 Difference]: Finished difference Result 346900 states and 513120 transitions. [2019-09-10 06:25:30,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:30,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 323 [2019-09-10 06:25:30,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:30,377 INFO L225 Difference]: With dead ends: 346900 [2019-09-10 06:25:30,378 INFO L226 Difference]: Without dead ends: 346900 [2019-09-10 06:25:30,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:30,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346900 states. [2019-09-10 06:25:37,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346900 to 346898. [2019-09-10 06:25:37,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346898 states. [2019-09-10 06:25:37,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346898 states to 346898 states and 513119 transitions. [2019-09-10 06:25:37,842 INFO L78 Accepts]: Start accepts. Automaton has 346898 states and 513119 transitions. Word has length 323 [2019-09-10 06:25:37,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:37,843 INFO L475 AbstractCegarLoop]: Abstraction has 346898 states and 513119 transitions. [2019-09-10 06:25:37,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:25:37,843 INFO L276 IsEmpty]: Start isEmpty. Operand 346898 states and 513119 transitions. [2019-09-10 06:25:37,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-09-10 06:25:37,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:37,994 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] [2019-09-10 06:25:37,994 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:37,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:37,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1850483001, now seen corresponding path program 1 times [2019-09-10 06:25:37,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:37,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:37,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:37,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:37,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:38,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:38,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:38,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:25:38,266 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:38,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:25:38,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:25:38,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:25:38,269 INFO L87 Difference]: Start difference. First operand 346898 states and 513119 transitions. Second operand 4 states. [2019-09-10 06:25:45,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:45,027 INFO L93 Difference]: Finished difference Result 594103 states and 877931 transitions. [2019-09-10 06:25:45,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:25:45,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 323 [2019-09-10 06:25:45,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:45,587 INFO L225 Difference]: With dead ends: 594103 [2019-09-10 06:25:45,588 INFO L226 Difference]: Without dead ends: 594103 [2019-09-10 06:25:45,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:25:45,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594103 states. [2019-09-10 06:25:50,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594103 to 337475. [2019-09-10 06:25:50,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337475 states. [2019-09-10 06:25:50,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337475 states to 337475 states and 499219 transitions. [2019-09-10 06:25:50,444 INFO L78 Accepts]: Start accepts. Automaton has 337475 states and 499219 transitions. Word has length 323 [2019-09-10 06:25:50,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:25:50,445 INFO L475 AbstractCegarLoop]: Abstraction has 337475 states and 499219 transitions. [2019-09-10 06:25:50,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:25:50,445 INFO L276 IsEmpty]: Start isEmpty. Operand 337475 states and 499219 transitions. [2019-09-10 06:25:50,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-10 06:25:50,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:25:50,603 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] [2019-09-10 06:25:50,603 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:25:50,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:25:50,604 INFO L82 PathProgramCache]: Analyzing trace with hash -2020944693, now seen corresponding path program 1 times [2019-09-10 06:25:50,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:25:50,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:50,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:25:50,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:25:50,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:25:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:25:51,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:25:51,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:25:51,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:25:51,769 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:25:51,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:25:51,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:25:51,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:51,771 INFO L87 Difference]: Start difference. First operand 337475 states and 499219 transitions. Second operand 3 states. [2019-09-10 06:25:53,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:25:53,003 INFO L93 Difference]: Finished difference Result 601271 states and 887739 transitions. [2019-09-10 06:25:53,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:25:53,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-09-10 06:25:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:25:53,694 INFO L225 Difference]: With dead ends: 601271 [2019-09-10 06:25:53,694 INFO L226 Difference]: Without dead ends: 601271 [2019-09-10 06:25:53,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:25:54,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601271 states. [2019-09-10 06:26:04,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601271 to 337956. [2019-09-10 06:26:04,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337956 states. [2019-09-10 06:26:04,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337956 states to 337956 states and 499817 transitions. [2019-09-10 06:26:04,864 INFO L78 Accepts]: Start accepts. Automaton has 337956 states and 499817 transitions. Word has length 326 [2019-09-10 06:26:04,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:04,864 INFO L475 AbstractCegarLoop]: Abstraction has 337956 states and 499817 transitions. [2019-09-10 06:26:04,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:26:04,864 INFO L276 IsEmpty]: Start isEmpty. Operand 337956 states and 499817 transitions. [2019-09-10 06:26:05,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-09-10 06:26:05,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:05,019 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:26:05,019 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:05,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:05,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1298589021, now seen corresponding path program 1 times [2019-09-10 06:26:05,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:05,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:05,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:05,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:05,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:06,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:26:06,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:06,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:26:06,219 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:06,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:26:06,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:26:06,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:26:06,220 INFO L87 Difference]: Start difference. First operand 337956 states and 499817 transitions. Second operand 4 states. [2019-09-10 06:26:06,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:06,798 INFO L93 Difference]: Finished difference Result 306063 states and 452056 transitions. [2019-09-10 06:26:06,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:26:06,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 327 [2019-09-10 06:26:06,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:07,108 INFO L225 Difference]: With dead ends: 306063 [2019-09-10 06:26:07,108 INFO L226 Difference]: Without dead ends: 301895 [2019-09-10 06:26:07,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:26:07,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301895 states. [2019-09-10 06:26:15,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301895 to 301568. [2019-09-10 06:26:15,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301568 states. [2019-09-10 06:26:16,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301568 states to 301568 states and 445191 transitions. [2019-09-10 06:26:16,718 INFO L78 Accepts]: Start accepts. Automaton has 301568 states and 445191 transitions. Word has length 327 [2019-09-10 06:26:16,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:16,718 INFO L475 AbstractCegarLoop]: Abstraction has 301568 states and 445191 transitions. [2019-09-10 06:26:16,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:26:16,718 INFO L276 IsEmpty]: Start isEmpty. Operand 301568 states and 445191 transitions. [2019-09-10 06:26:16,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-10 06:26:16,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:16,841 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:26:16,841 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:16,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:16,841 INFO L82 PathProgramCache]: Analyzing trace with hash 786030914, now seen corresponding path program 1 times [2019-09-10 06:26:16,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:16,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:16,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:16,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:16,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:17,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:26:17,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:17,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 06:26:17,259 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:17,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 06:26:17,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 06:26:17,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:26:17,260 INFO L87 Difference]: Start difference. First operand 301568 states and 445191 transitions. Second operand 9 states. [2019-09-10 06:26:25,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:25,307 INFO L93 Difference]: Finished difference Result 1017516 states and 1515712 transitions. [2019-09-10 06:26:25,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 06:26:25,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 328 [2019-09-10 06:26:25,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:26,568 INFO L225 Difference]: With dead ends: 1017516 [2019-09-10 06:26:26,568 INFO L226 Difference]: Without dead ends: 1017516 [2019-09-10 06:26:26,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-09-10 06:26:27,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017516 states. [2019-09-10 06:26:44,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017516 to 740488. [2019-09-10 06:26:44,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740488 states. [2019-09-10 06:26:46,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740488 states to 740488 states and 1096072 transitions. [2019-09-10 06:26:46,566 INFO L78 Accepts]: Start accepts. Automaton has 740488 states and 1096072 transitions. Word has length 328 [2019-09-10 06:26:46,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:26:46,567 INFO L475 AbstractCegarLoop]: Abstraction has 740488 states and 1096072 transitions. [2019-09-10 06:26:46,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 06:26:46,567 INFO L276 IsEmpty]: Start isEmpty. Operand 740488 states and 1096072 transitions. [2019-09-10 06:26:46,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-10 06:26:46,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:26:46,865 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:26:46,865 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:26:46,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:26:46,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1643327470, now seen corresponding path program 1 times [2019-09-10 06:26:46,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:26:46,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:46,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:26:46,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:26:46,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:26:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:26:55,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:26:55,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:26:55,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:26:55,089 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:26:55,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:26:55,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:26:55,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:26:55,090 INFO L87 Difference]: Start difference. First operand 740488 states and 1096072 transitions. Second operand 4 states. [2019-09-10 06:26:57,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:26:57,777 INFO L93 Difference]: Finished difference Result 894778 states and 1333841 transitions. [2019-09-10 06:26:57,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:26:57,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2019-09-10 06:26:57,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:26:58,954 INFO L225 Difference]: With dead ends: 894778 [2019-09-10 06:26:58,954 INFO L226 Difference]: Without dead ends: 894778 [2019-09-10 06:26:58,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:26:59,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894778 states. [2019-09-10 06:27:18,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894778 to 894776. [2019-09-10 06:27:18,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894776 states. [2019-09-10 06:27:33,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894776 states to 894776 states and 1333840 transitions. [2019-09-10 06:27:33,522 INFO L78 Accepts]: Start accepts. Automaton has 894776 states and 1333840 transitions. Word has length 328 [2019-09-10 06:27:33,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:27:33,523 INFO L475 AbstractCegarLoop]: Abstraction has 894776 states and 1333840 transitions. [2019-09-10 06:27:33,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:27:33,523 INFO L276 IsEmpty]: Start isEmpty. Operand 894776 states and 1333840 transitions. [2019-09-10 06:27:33,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-10 06:27:33,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:27:33,783 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:27:33,783 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:27:33,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:27:33,784 INFO L82 PathProgramCache]: Analyzing trace with hash 465198786, now seen corresponding path program 1 times [2019-09-10 06:27:33,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:27:33,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:33,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:27:33,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:27:33,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:27:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:27:34,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:27:34,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:27:34,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:27:34,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:27:34,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:27:34,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:27:34,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:27:34,289 INFO L87 Difference]: Start difference. First operand 894776 states and 1333840 transitions. Second operand 4 states. [2019-09-10 06:27:48,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:27:48,947 INFO L93 Difference]: Finished difference Result 1681222 states and 2490909 transitions. [2019-09-10 06:27:48,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:27:48,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2019-09-10 06:27:48,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:27:51,159 INFO L225 Difference]: With dead ends: 1681222 [2019-09-10 06:27:51,160 INFO L226 Difference]: Without dead ends: 1680838 [2019-09-10 06:27:51,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:27:52,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680838 states. [2019-09-10 06:28:41,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680838 to 1680836. [2019-09-10 06:28:41,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1680836 states.