java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:52:30,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:52:30,928 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:52:30,941 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:52:30,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:52:30,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:52:30,944 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:52:30,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:52:30,948 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:52:30,948 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:52:30,949 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:52:30,950 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:52:30,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:52:30,952 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:52:30,953 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:52:30,954 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:52:30,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:52:30,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:52:30,957 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:52:30,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:52:30,961 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:52:30,962 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:52:30,963 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:52:30,964 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:52:30,966 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:52:30,966 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:52:30,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:52:30,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:52:30,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:52:30,968 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:52:30,969 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:52:30,969 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:52:30,970 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:52:30,971 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:52:30,972 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:52:30,972 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:52:30,973 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:52:30,973 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:52:30,973 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:52:30,974 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:52:30,976 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:52:30,977 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 08:52:30,996 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:52:30,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:52:30,997 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:52:30,998 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:52:30,999 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:52:30,999 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:52:30,999 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:52:31,000 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:52:31,000 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:52:31,000 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:52:31,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:52:31,001 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:52:31,001 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:52:31,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:52:31,001 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:52:31,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:52:31,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:52:31,003 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:52:31,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:52:31,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:52:31,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:52:31,004 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:52:31,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:52:31,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:52:31,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:52:31,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:52:31,005 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:52:31,006 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:52:31,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:52:31,006 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:52:31,050 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:52:31,062 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:52:31,067 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:52:31,068 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:52:31,069 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:52:31,071 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:52:31,153 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/707274227/f5af271f355b459482439d3f3113831d/FLAG5f1ba00e3 [2019-09-10 08:52:31,756 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:52:31,757 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:52:31,778 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/707274227/f5af271f355b459482439d3f3113831d/FLAG5f1ba00e3 [2019-09-10 08:52:32,010 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/707274227/f5af271f355b459482439d3f3113831d [2019-09-10 08:52:32,021 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:52:32,022 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:52:32,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:52:32,024 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:52:32,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:52:32,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:52:32" (1/1) ... [2019-09-10 08:52:32,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@741514e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:32, skipping insertion in model container [2019-09-10 08:52:32,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:52:32" (1/1) ... [2019-09-10 08:52:32,038 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:52:32,146 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:52:32,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:52:32,990 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:52:33,415 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:52:33,447 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:52:33,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:33 WrapperNode [2019-09-10 08:52:33,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:52:33,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:52:33,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:52:33,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:52:33,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:33" (1/1) ... [2019-09-10 08:52:33,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:33" (1/1) ... [2019-09-10 08:52:33,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:33" (1/1) ... [2019-09-10 08:52:33,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:33" (1/1) ... [2019-09-10 08:52:33,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:33" (1/1) ... [2019-09-10 08:52:33,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:33" (1/1) ... [2019-09-10 08:52:33,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:33" (1/1) ... [2019-09-10 08:52:33,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:52:33,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:52:33,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:52:33,655 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:52:33,657 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:33" (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 08:52:33,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:52:33,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:52:33,733 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:52:33,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:52:33,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:52:33,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 08:52:33,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:52:33,734 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:52:33,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:52:33,734 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:52:33,735 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:52:33,735 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:52:33,735 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:52:33,736 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:52:33,737 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:52:33,737 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:52:33,738 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:52:33,738 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:52:33,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:52:33,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:52:36,156 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:52:36,157 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:52:36,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:52:36 BoogieIcfgContainer [2019-09-10 08:52:36,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:52:36,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:52:36,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:52:36,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:52:36,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:52:32" (1/3) ... [2019-09-10 08:52:36,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b254a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:52:36, skipping insertion in model container [2019-09-10 08:52:36,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:52:33" (2/3) ... [2019-09-10 08:52:36,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b254a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:52:36, skipping insertion in model container [2019-09-10 08:52:36,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:52:36" (3/3) ... [2019-09-10 08:52:36,173 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-09-10 08:52:36,185 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:52:36,212 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-09-10 08:52:36,229 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-09-10 08:52:36,258 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:52:36,258 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:52:36,258 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:52:36,259 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:52:36,259 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:52:36,259 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:52:36,259 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:52:36,259 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:52:36,301 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states. [2019-09-10 08:52:36,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-10 08:52:36,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:36,343 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:52:36,346 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:36,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:36,353 INFO L82 PathProgramCache]: Analyzing trace with hash 570305456, now seen corresponding path program 1 times [2019-09-10 08:52:36,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:36,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:36,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:36,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:36,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:37,743 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 08:52:37,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:37,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:52:37,747 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:37,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:52:37,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:52:37,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:52:37,772 INFO L87 Difference]: Start difference. First operand 690 states. Second operand 4 states. [2019-09-10 08:52:38,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:38,115 INFO L93 Difference]: Finished difference Result 1348 states and 2387 transitions. [2019-09-10 08:52:38,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:52:38,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 251 [2019-09-10 08:52:38,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:38,154 INFO L225 Difference]: With dead ends: 1348 [2019-09-10 08:52:38,155 INFO L226 Difference]: Without dead ends: 1340 [2019-09-10 08:52:38,159 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 08:52:38,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2019-09-10 08:52:38,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1302. [2019-09-10 08:52:38,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1302 states. [2019-09-10 08:52:38,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 2029 transitions. [2019-09-10 08:52:38,301 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 2029 transitions. Word has length 251 [2019-09-10 08:52:38,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:38,304 INFO L475 AbstractCegarLoop]: Abstraction has 1302 states and 2029 transitions. [2019-09-10 08:52:38,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:52:38,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 2029 transitions. [2019-09-10 08:52:38,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-10 08:52:38,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:38,315 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] [2019-09-10 08:52:38,315 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:38,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:38,316 INFO L82 PathProgramCache]: Analyzing trace with hash 2110666408, now seen corresponding path program 1 times [2019-09-10 08:52:38,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:38,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:38,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:38,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:38,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:38,754 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 08:52:38,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:38,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:38,755 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:38,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:38,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:38,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:38,761 INFO L87 Difference]: Start difference. First operand 1302 states and 2029 transitions. Second operand 3 states. [2019-09-10 08:52:38,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:38,875 INFO L93 Difference]: Finished difference Result 2553 states and 3957 transitions. [2019-09-10 08:52:38,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:38,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-09-10 08:52:38,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:38,889 INFO L225 Difference]: With dead ends: 2553 [2019-09-10 08:52:38,890 INFO L226 Difference]: Without dead ends: 2553 [2019-09-10 08:52:38,891 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 08:52:38,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2553 states. [2019-09-10 08:52:38,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2553 to 2517. [2019-09-10 08:52:38,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2517 states. [2019-09-10 08:52:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2517 states to 2517 states and 3909 transitions. [2019-09-10 08:52:38,951 INFO L78 Accepts]: Start accepts. Automaton has 2517 states and 3909 transitions. Word has length 253 [2019-09-10 08:52:38,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:38,952 INFO L475 AbstractCegarLoop]: Abstraction has 2517 states and 3909 transitions. [2019-09-10 08:52:38,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:38,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2517 states and 3909 transitions. [2019-09-10 08:52:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-10 08:52:38,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:38,961 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] [2019-09-10 08:52:38,961 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:38,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:38,962 INFO L82 PathProgramCache]: Analyzing trace with hash -230602365, now seen corresponding path program 1 times [2019-09-10 08:52:38,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:38,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:38,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:38,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:38,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:39,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:52:39,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:39,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:39,093 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:39,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:39,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:39,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:39,095 INFO L87 Difference]: Start difference. First operand 2517 states and 3909 transitions. Second operand 3 states. [2019-09-10 08:52:39,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:39,160 INFO L93 Difference]: Finished difference Result 5001 states and 7758 transitions. [2019-09-10 08:52:39,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:39,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-09-10 08:52:39,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:39,186 INFO L225 Difference]: With dead ends: 5001 [2019-09-10 08:52:39,186 INFO L226 Difference]: Without dead ends: 5001 [2019-09-10 08:52:39,186 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 08:52:39,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5001 states. [2019-09-10 08:52:39,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5001 to 2536. [2019-09-10 08:52:39,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2536 states. [2019-09-10 08:52:39,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 3937 transitions. [2019-09-10 08:52:39,261 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 3937 transitions. Word has length 253 [2019-09-10 08:52:39,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:39,261 INFO L475 AbstractCegarLoop]: Abstraction has 2536 states and 3937 transitions. [2019-09-10 08:52:39,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:39,261 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 3937 transitions. [2019-09-10 08:52:39,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-10 08:52:39,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:39,269 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] [2019-09-10 08:52:39,270 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:39,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:39,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1570357102, now seen corresponding path program 1 times [2019-09-10 08:52:39,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:39,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:39,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:39,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:39,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:39,520 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 08:52:39,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:39,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:39,521 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:39,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:39,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:39,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:39,523 INFO L87 Difference]: Start difference. First operand 2536 states and 3937 transitions. Second operand 3 states. [2019-09-10 08:52:39,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:39,618 INFO L93 Difference]: Finished difference Result 5019 states and 7779 transitions. [2019-09-10 08:52:39,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:39,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 254 [2019-09-10 08:52:39,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:39,652 INFO L225 Difference]: With dead ends: 5019 [2019-09-10 08:52:39,652 INFO L226 Difference]: Without dead ends: 5019 [2019-09-10 08:52:39,653 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 08:52:39,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5019 states. [2019-09-10 08:52:39,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5019 to 2554. [2019-09-10 08:52:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2554 states. [2019-09-10 08:52:39,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 3958 transitions. [2019-09-10 08:52:39,761 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 3958 transitions. Word has length 254 [2019-09-10 08:52:39,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:39,761 INFO L475 AbstractCegarLoop]: Abstraction has 2554 states and 3958 transitions. [2019-09-10 08:52:39,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:39,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 3958 transitions. [2019-09-10 08:52:39,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-10 08:52:39,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:39,775 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] [2019-09-10 08:52:39,775 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:39,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:39,776 INFO L82 PathProgramCache]: Analyzing trace with hash -845935432, now seen corresponding path program 1 times [2019-09-10 08:52:39,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:39,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:39,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:39,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:39,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:39,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 08:52:39,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:39,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:39,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:39,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:39,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:39,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:39,965 INFO L87 Difference]: Start difference. First operand 2554 states and 3958 transitions. Second operand 3 states. [2019-09-10 08:52:40,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:40,098 INFO L93 Difference]: Finished difference Result 3430 states and 5351 transitions. [2019-09-10 08:52:40,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:40,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-09-10 08:52:40,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:40,114 INFO L225 Difference]: With dead ends: 3430 [2019-09-10 08:52:40,114 INFO L226 Difference]: Without dead ends: 3430 [2019-09-10 08:52:40,115 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 08:52:40,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3430 states. [2019-09-10 08:52:40,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3430 to 3062. [2019-09-10 08:52:40,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3062 states. [2019-09-10 08:52:40,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 4796 transitions. [2019-09-10 08:52:40,183 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 4796 transitions. Word has length 255 [2019-09-10 08:52:40,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:40,184 INFO L475 AbstractCegarLoop]: Abstraction has 3062 states and 4796 transitions. [2019-09-10 08:52:40,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:40,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 4796 transitions. [2019-09-10 08:52:40,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-10 08:52:40,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:40,191 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] [2019-09-10 08:52:40,192 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:40,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:40,192 INFO L82 PathProgramCache]: Analyzing trace with hash -494342739, now seen corresponding path program 1 times [2019-09-10 08:52:40,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:40,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:40,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:40,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:40,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:40,524 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 08:52:40,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:40,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:40,526 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:40,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:40,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:40,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:40,529 INFO L87 Difference]: Start difference. First operand 3062 states and 4796 transitions. Second operand 3 states. [2019-09-10 08:52:40,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:40,697 INFO L93 Difference]: Finished difference Result 5909 states and 9190 transitions. [2019-09-10 08:52:40,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:40,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-09-10 08:52:40,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:40,733 INFO L225 Difference]: With dead ends: 5909 [2019-09-10 08:52:40,733 INFO L226 Difference]: Without dead ends: 5909 [2019-09-10 08:52:40,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:40,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5909 states. [2019-09-10 08:52:40,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5909 to 5875. [2019-09-10 08:52:40,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5875 states. [2019-09-10 08:52:40,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5875 states to 5875 states and 9146 transitions. [2019-09-10 08:52:40,904 INFO L78 Accepts]: Start accepts. Automaton has 5875 states and 9146 transitions. Word has length 255 [2019-09-10 08:52:40,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:40,905 INFO L475 AbstractCegarLoop]: Abstraction has 5875 states and 9146 transitions. [2019-09-10 08:52:40,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:40,906 INFO L276 IsEmpty]: Start isEmpty. Operand 5875 states and 9146 transitions. [2019-09-10 08:52:40,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-10 08:52:40,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:40,920 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] [2019-09-10 08:52:40,920 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:40,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:40,930 INFO L82 PathProgramCache]: Analyzing trace with hash 797456944, now seen corresponding path program 1 times [2019-09-10 08:52:40,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:40,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:40,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:40,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:40,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:41,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:52:41,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:41,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:52:41,352 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:41,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:52:41,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:52:41,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:52:41,354 INFO L87 Difference]: Start difference. First operand 5875 states and 9146 transitions. Second operand 4 states. [2019-09-10 08:52:41,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:41,471 INFO L93 Difference]: Finished difference Result 10749 states and 16644 transitions. [2019-09-10 08:52:41,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:52:41,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 255 [2019-09-10 08:52:41,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:41,530 INFO L225 Difference]: With dead ends: 10749 [2019-09-10 08:52:41,531 INFO L226 Difference]: Without dead ends: 10749 [2019-09-10 08:52:41,531 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 08:52:41,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10749 states. [2019-09-10 08:52:41,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10749 to 6110. [2019-09-10 08:52:41,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6110 states. [2019-09-10 08:52:41,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6110 states to 6110 states and 9534 transitions. [2019-09-10 08:52:41,769 INFO L78 Accepts]: Start accepts. Automaton has 6110 states and 9534 transitions. Word has length 255 [2019-09-10 08:52:41,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:41,769 INFO L475 AbstractCegarLoop]: Abstraction has 6110 states and 9534 transitions. [2019-09-10 08:52:41,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:52:41,770 INFO L276 IsEmpty]: Start isEmpty. Operand 6110 states and 9534 transitions. [2019-09-10 08:52:41,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-10 08:52:41,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:41,793 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] [2019-09-10 08:52:41,793 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:41,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:41,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1038402649, now seen corresponding path program 1 times [2019-09-10 08:52:41,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:41,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:41,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:41,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:41,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:42,079 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 08:52:42,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:42,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:42,080 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:42,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:42,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:42,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:42,082 INFO L87 Difference]: Start difference. First operand 6110 states and 9534 transitions. Second operand 3 states. [2019-09-10 08:52:42,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:42,166 INFO L93 Difference]: Finished difference Result 11453 states and 17712 transitions. [2019-09-10 08:52:42,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:42,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-09-10 08:52:42,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:42,194 INFO L225 Difference]: With dead ends: 11453 [2019-09-10 08:52:42,194 INFO L226 Difference]: Without dead ends: 11453 [2019-09-10 08:52:42,194 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 08:52:42,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11453 states. [2019-09-10 08:52:42,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11453 to 6214. [2019-09-10 08:52:42,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2019-09-10 08:52:42,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 9677 transitions. [2019-09-10 08:52:42,370 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 9677 transitions. Word has length 257 [2019-09-10 08:52:42,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:42,370 INFO L475 AbstractCegarLoop]: Abstraction has 6214 states and 9677 transitions. [2019-09-10 08:52:42,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:42,370 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 9677 transitions. [2019-09-10 08:52:42,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-10 08:52:42,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:42,384 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] [2019-09-10 08:52:42,384 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:42,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:42,385 INFO L82 PathProgramCache]: Analyzing trace with hash -83305299, now seen corresponding path program 1 times [2019-09-10 08:52:42,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:42,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:42,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:42,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:42,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:42,647 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 08:52:42,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:42,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:42,649 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:42,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:42,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:42,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:42,651 INFO L87 Difference]: Start difference. First operand 6214 states and 9677 transitions. Second operand 3 states. [2019-09-10 08:52:42,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:42,785 INFO L93 Difference]: Finished difference Result 8676 states and 13626 transitions. [2019-09-10 08:52:42,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:42,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-09-10 08:52:42,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:42,804 INFO L225 Difference]: With dead ends: 8676 [2019-09-10 08:52:42,804 INFO L226 Difference]: Without dead ends: 8676 [2019-09-10 08:52:42,805 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 08:52:42,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8676 states. [2019-09-10 08:52:42,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8676 to 8002. [2019-09-10 08:52:42,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8002 states. [2019-09-10 08:52:42,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8002 states to 8002 states and 12613 transitions. [2019-09-10 08:52:42,963 INFO L78 Accepts]: Start accepts. Automaton has 8002 states and 12613 transitions. Word has length 257 [2019-09-10 08:52:42,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:42,964 INFO L475 AbstractCegarLoop]: Abstraction has 8002 states and 12613 transitions. [2019-09-10 08:52:42,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:42,964 INFO L276 IsEmpty]: Start isEmpty. Operand 8002 states and 12613 transitions. [2019-09-10 08:52:42,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-10 08:52:42,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:42,977 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:52:42,977 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:42,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:42,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1666901739, now seen corresponding path program 1 times [2019-09-10 08:52:42,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:42,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:42,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:42,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:42,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:43,560 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 08:52:43,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:43,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:52:43,561 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:43,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:52:43,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:52:43,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:52:43,562 INFO L87 Difference]: Start difference. First operand 8002 states and 12613 transitions. Second operand 4 states. [2019-09-10 08:52:43,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:43,772 INFO L93 Difference]: Finished difference Result 15471 states and 24227 transitions. [2019-09-10 08:52:43,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:52:43,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2019-09-10 08:52:43,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:43,805 INFO L225 Difference]: With dead ends: 15471 [2019-09-10 08:52:43,805 INFO L226 Difference]: Without dead ends: 15471 [2019-09-10 08:52:43,805 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 08:52:43,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15471 states. [2019-09-10 08:52:44,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15471 to 15443. [2019-09-10 08:52:44,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15443 states. [2019-09-10 08:52:44,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15443 states to 15443 states and 24191 transitions. [2019-09-10 08:52:44,177 INFO L78 Accepts]: Start accepts. Automaton has 15443 states and 24191 transitions. Word has length 258 [2019-09-10 08:52:44,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:44,177 INFO L475 AbstractCegarLoop]: Abstraction has 15443 states and 24191 transitions. [2019-09-10 08:52:44,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:52:44,178 INFO L276 IsEmpty]: Start isEmpty. Operand 15443 states and 24191 transitions. [2019-09-10 08:52:44,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-10 08:52:44,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:44,199 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] [2019-09-10 08:52:44,199 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:44,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:44,200 INFO L82 PathProgramCache]: Analyzing trace with hash 508525808, now seen corresponding path program 1 times [2019-09-10 08:52:44,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:44,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:44,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:44,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:44,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:44,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 08:52:44,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:44,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:44,587 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:44,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:44,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:44,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:44,589 INFO L87 Difference]: Start difference. First operand 15443 states and 24191 transitions. Second operand 3 states. [2019-09-10 08:52:44,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:44,791 INFO L93 Difference]: Finished difference Result 29770 states and 46288 transitions. [2019-09-10 08:52:44,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:44,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-09-10 08:52:44,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:44,858 INFO L225 Difference]: With dead ends: 29770 [2019-09-10 08:52:44,858 INFO L226 Difference]: Without dead ends: 29770 [2019-09-10 08:52:44,859 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 08:52:44,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29770 states. [2019-09-10 08:52:45,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29770 to 29744. [2019-09-10 08:52:45,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29744 states. [2019-09-10 08:52:45,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29744 states to 29744 states and 46256 transitions. [2019-09-10 08:52:45,422 INFO L78 Accepts]: Start accepts. Automaton has 29744 states and 46256 transitions. Word has length 260 [2019-09-10 08:52:45,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:45,422 INFO L475 AbstractCegarLoop]: Abstraction has 29744 states and 46256 transitions. [2019-09-10 08:52:45,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:45,423 INFO L276 IsEmpty]: Start isEmpty. Operand 29744 states and 46256 transitions. [2019-09-10 08:52:45,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-10 08:52:45,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:45,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] [2019-09-10 08:52:45,458 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:45,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:45,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1042221725, now seen corresponding path program 1 times [2019-09-10 08:52:45,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:45,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:45,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:45,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:45,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:45,600 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 08:52:45,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:45,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:45,601 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:45,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:45,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:45,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:45,602 INFO L87 Difference]: Start difference. First operand 29744 states and 46256 transitions. Second operand 3 states. [2019-09-10 08:52:45,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:45,925 INFO L93 Difference]: Finished difference Result 57269 states and 88620 transitions. [2019-09-10 08:52:45,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:45,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-09-10 08:52:45,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:46,064 INFO L225 Difference]: With dead ends: 57269 [2019-09-10 08:52:46,064 INFO L226 Difference]: Without dead ends: 57269 [2019-09-10 08:52:46,065 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 08:52:46,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57269 states. [2019-09-10 08:52:46,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57269 to 30230. [2019-09-10 08:52:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30230 states. [2019-09-10 08:52:46,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30230 states to 30230 states and 46809 transitions. [2019-09-10 08:52:46,795 INFO L78 Accepts]: Start accepts. Automaton has 30230 states and 46809 transitions. Word has length 260 [2019-09-10 08:52:46,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:46,796 INFO L475 AbstractCegarLoop]: Abstraction has 30230 states and 46809 transitions. [2019-09-10 08:52:46,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:46,796 INFO L276 IsEmpty]: Start isEmpty. Operand 30230 states and 46809 transitions. [2019-09-10 08:52:46,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-10 08:52:46,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:46,842 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] [2019-09-10 08:52:46,843 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:46,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:46,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1840728553, now seen corresponding path program 1 times [2019-09-10 08:52:46,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:46,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:46,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:46,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:46,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:47,040 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 08:52:47,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:47,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:47,042 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:47,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:47,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:47,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:47,044 INFO L87 Difference]: Start difference. First operand 30230 states and 46809 transitions. Second operand 3 states. [2019-09-10 08:52:47,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:47,271 INFO L93 Difference]: Finished difference Result 45394 states and 71194 transitions. [2019-09-10 08:52:47,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:47,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-09-10 08:52:47,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:47,374 INFO L225 Difference]: With dead ends: 45394 [2019-09-10 08:52:47,374 INFO L226 Difference]: Without dead ends: 45394 [2019-09-10 08:52:47,375 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 08:52:48,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45394 states. [2019-09-10 08:52:49,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45394 to 42438. [2019-09-10 08:52:49,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42438 states. [2019-09-10 08:52:49,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42438 states to 42438 states and 66633 transitions. [2019-09-10 08:52:49,135 INFO L78 Accepts]: Start accepts. Automaton has 42438 states and 66633 transitions. Word has length 261 [2019-09-10 08:52:49,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:49,136 INFO L475 AbstractCegarLoop]: Abstraction has 42438 states and 66633 transitions. [2019-09-10 08:52:49,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:49,136 INFO L276 IsEmpty]: Start isEmpty. Operand 42438 states and 66633 transitions. [2019-09-10 08:52:49,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-10 08:52:49,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:49,165 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] [2019-09-10 08:52:49,166 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:49,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:49,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1599963507, now seen corresponding path program 1 times [2019-09-10 08:52:49,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:49,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:49,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:49,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:49,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:49,481 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 08:52:49,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:49,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:52:49,482 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:49,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:52:49,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:52:49,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:52:49,484 INFO L87 Difference]: Start difference. First operand 42438 states and 66633 transitions. Second operand 4 states. [2019-09-10 08:52:49,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:49,652 INFO L93 Difference]: Finished difference Result 40434 states and 63340 transitions. [2019-09-10 08:52:49,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:52:49,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2019-09-10 08:52:49,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:49,730 INFO L225 Difference]: With dead ends: 40434 [2019-09-10 08:52:49,730 INFO L226 Difference]: Without dead ends: 37280 [2019-09-10 08:52:49,731 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 08:52:49,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37280 states. [2019-09-10 08:52:50,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37280 to 37204. [2019-09-10 08:52:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37204 states. [2019-09-10 08:52:50,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37204 states to 37204 states and 58398 transitions. [2019-09-10 08:52:50,653 INFO L78 Accepts]: Start accepts. Automaton has 37204 states and 58398 transitions. Word has length 261 [2019-09-10 08:52:50,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:50,653 INFO L475 AbstractCegarLoop]: Abstraction has 37204 states and 58398 transitions. [2019-09-10 08:52:50,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:52:50,653 INFO L276 IsEmpty]: Start isEmpty. Operand 37204 states and 58398 transitions. [2019-09-10 08:52:50,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-10 08:52:50,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:50,677 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] [2019-09-10 08:52:50,677 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:50,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:50,678 INFO L82 PathProgramCache]: Analyzing trace with hash 879012584, now seen corresponding path program 1 times [2019-09-10 08:52:50,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:50,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:50,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:50,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:50,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:50,956 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 08:52:50,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:50,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:52:50,956 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:50,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:52:50,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:52:50,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:52:50,959 INFO L87 Difference]: Start difference. First operand 37204 states and 58398 transitions. Second operand 4 states. [2019-09-10 08:52:51,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:51,224 INFO L93 Difference]: Finished difference Result 68450 states and 107244 transitions. [2019-09-10 08:52:51,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:52:51,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 262 [2019-09-10 08:52:51,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:51,390 INFO L225 Difference]: With dead ends: 68450 [2019-09-10 08:52:51,391 INFO L226 Difference]: Without dead ends: 68450 [2019-09-10 08:52:51,394 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 08:52:51,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68450 states. [2019-09-10 08:52:53,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68450 to 37895. [2019-09-10 08:52:53,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37895 states. [2019-09-10 08:52:53,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37895 states to 37895 states and 59547 transitions. [2019-09-10 08:52:53,301 INFO L78 Accepts]: Start accepts. Automaton has 37895 states and 59547 transitions. Word has length 262 [2019-09-10 08:52:53,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:53,302 INFO L475 AbstractCegarLoop]: Abstraction has 37895 states and 59547 transitions. [2019-09-10 08:52:53,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:52:53,302 INFO L276 IsEmpty]: Start isEmpty. Operand 37895 states and 59547 transitions. [2019-09-10 08:52:53,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-10 08:52:53,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:53,336 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] [2019-09-10 08:52:53,337 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:53,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:53,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1440113269, now seen corresponding path program 1 times [2019-09-10 08:52:53,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:53,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:53,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:53,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:53,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:53,577 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 08:52:53,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:53,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:53,579 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:53,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:53,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:53,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:53,580 INFO L87 Difference]: Start difference. First operand 37895 states and 59547 transitions. Second operand 3 states. [2019-09-10 08:52:53,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:53,846 INFO L93 Difference]: Finished difference Result 70994 states and 110825 transitions. [2019-09-10 08:52:53,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:53,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 262 [2019-09-10 08:52:53,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:54,000 INFO L225 Difference]: With dead ends: 70994 [2019-09-10 08:52:54,000 INFO L226 Difference]: Without dead ends: 70994 [2019-09-10 08:52:54,001 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 08:52:54,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70994 states. [2019-09-10 08:52:54,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70994 to 70970. [2019-09-10 08:52:54,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70970 states. [2019-09-10 08:52:55,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70970 states to 70970 states and 110797 transitions. [2019-09-10 08:52:55,068 INFO L78 Accepts]: Start accepts. Automaton has 70970 states and 110797 transitions. Word has length 262 [2019-09-10 08:52:55,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:55,068 INFO L475 AbstractCegarLoop]: Abstraction has 70970 states and 110797 transitions. [2019-09-10 08:52:55,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:55,068 INFO L276 IsEmpty]: Start isEmpty. Operand 70970 states and 110797 transitions. [2019-09-10 08:52:55,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-10 08:52:55,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:55,102 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] [2019-09-10 08:52:55,102 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:55,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:55,103 INFO L82 PathProgramCache]: Analyzing trace with hash -2065043887, now seen corresponding path program 1 times [2019-09-10 08:52:55,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:55,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:55,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:55,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:55,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:55,246 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 08:52:55,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:55,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:55,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:55,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:55,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:55,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:55,248 INFO L87 Difference]: Start difference. First operand 70970 states and 110797 transitions. Second operand 3 states. [2019-09-10 08:52:55,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:55,654 INFO L93 Difference]: Finished difference Result 115093 states and 181199 transitions. [2019-09-10 08:52:55,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:55,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 264 [2019-09-10 08:52:55,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:55,838 INFO L225 Difference]: With dead ends: 115093 [2019-09-10 08:52:55,838 INFO L226 Difference]: Without dead ends: 115093 [2019-09-10 08:52:55,839 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 08:52:55,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115093 states. [2019-09-10 08:52:58,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115093 to 107491. [2019-09-10 08:52:58,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107491 states. [2019-09-10 08:52:58,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107491 states to 107491 states and 170112 transitions. [2019-09-10 08:52:58,672 INFO L78 Accepts]: Start accepts. Automaton has 107491 states and 170112 transitions. Word has length 264 [2019-09-10 08:52:58,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:52:58,672 INFO L475 AbstractCegarLoop]: Abstraction has 107491 states and 170112 transitions. [2019-09-10 08:52:58,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:52:58,672 INFO L276 IsEmpty]: Start isEmpty. Operand 107491 states and 170112 transitions. [2019-09-10 08:52:58,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-10 08:52:58,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:52:58,707 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:52:58,707 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:52:58,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:52:58,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1033887376, now seen corresponding path program 1 times [2019-09-10 08:52:58,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:52:58,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:58,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:52:58,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:52:58,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:52:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:52:58,831 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 08:52:58,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:52:58,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:52:58,832 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:52:58,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:52:58,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:52:58,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:52:58,833 INFO L87 Difference]: Start difference. First operand 107491 states and 170112 transitions. Second operand 3 states. [2019-09-10 08:52:59,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:52:59,502 INFO L93 Difference]: Finished difference Result 190210 states and 300527 transitions. [2019-09-10 08:52:59,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:52:59,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2019-09-10 08:52:59,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:52:59,886 INFO L225 Difference]: With dead ends: 190210 [2019-09-10 08:52:59,887 INFO L226 Difference]: Without dead ends: 190210 [2019-09-10 08:52:59,887 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 08:53:00,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190210 states. [2019-09-10 08:53:02,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190210 to 107972. [2019-09-10 08:53:02,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107972 states. [2019-09-10 08:53:06,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107972 states to 107972 states and 170710 transitions. [2019-09-10 08:53:06,020 INFO L78 Accepts]: Start accepts. Automaton has 107972 states and 170710 transitions. Word has length 265 [2019-09-10 08:53:06,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:06,020 INFO L475 AbstractCegarLoop]: Abstraction has 107972 states and 170710 transitions. [2019-09-10 08:53:06,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:53:06,021 INFO L276 IsEmpty]: Start isEmpty. Operand 107972 states and 170710 transitions. [2019-09-10 08:53:06,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-10 08:53:06,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:06,049 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] [2019-09-10 08:53:06,050 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:06,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:06,050 INFO L82 PathProgramCache]: Analyzing trace with hash 950455431, now seen corresponding path program 1 times [2019-09-10 08:53:06,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:06,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:06,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:06,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:06,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:06,186 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 08:53:06,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:06,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:53:06,187 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:06,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:53:06,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:53:06,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:06,188 INFO L87 Difference]: Start difference. First operand 107972 states and 170710 transitions. Second operand 3 states. [2019-09-10 08:53:07,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:07,118 INFO L93 Difference]: Finished difference Result 203348 states and 321124 transitions. [2019-09-10 08:53:07,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:53:07,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2019-09-10 08:53:07,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:07,414 INFO L225 Difference]: With dead ends: 203348 [2019-09-10 08:53:07,415 INFO L226 Difference]: Without dead ends: 203348 [2019-09-10 08:53:07,415 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 08:53:07,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203348 states. [2019-09-10 08:53:09,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203348 to 203005. [2019-09-10 08:53:09,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203005 states. [2019-09-10 08:53:09,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203005 states to 203005 states and 320661 transitions. [2019-09-10 08:53:09,873 INFO L78 Accepts]: Start accepts. Automaton has 203005 states and 320661 transitions. Word has length 265 [2019-09-10 08:53:09,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:09,873 INFO L475 AbstractCegarLoop]: Abstraction has 203005 states and 320661 transitions. [2019-09-10 08:53:09,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:53:09,873 INFO L276 IsEmpty]: Start isEmpty. Operand 203005 states and 320661 transitions. [2019-09-10 08:53:09,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-10 08:53:09,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:09,910 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] [2019-09-10 08:53:09,911 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:09,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:09,911 INFO L82 PathProgramCache]: Analyzing trace with hash 284558754, now seen corresponding path program 1 times [2019-09-10 08:53:09,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:09,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:09,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:09,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:09,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:10,380 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 08:53:10,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:10,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:53:10,381 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:10,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:53:10,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:53:10,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:53:10,382 INFO L87 Difference]: Start difference. First operand 203005 states and 320661 transitions. Second operand 4 states. [2019-09-10 08:53:12,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:12,003 INFO L93 Difference]: Finished difference Result 372050 states and 584311 transitions. [2019-09-10 08:53:12,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:53:12,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 265 [2019-09-10 08:53:12,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:12,507 INFO L225 Difference]: With dead ends: 372050 [2019-09-10 08:53:12,508 INFO L226 Difference]: Without dead ends: 372050 [2019-09-10 08:53:12,508 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 08:53:12,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372050 states. [2019-09-10 08:53:20,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372050 to 372032. [2019-09-10 08:53:20,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372032 states. [2019-09-10 08:53:21,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372032 states to 372032 states and 584291 transitions. [2019-09-10 08:53:21,185 INFO L78 Accepts]: Start accepts. Automaton has 372032 states and 584291 transitions. Word has length 265 [2019-09-10 08:53:21,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:21,186 INFO L475 AbstractCegarLoop]: Abstraction has 372032 states and 584291 transitions. [2019-09-10 08:53:21,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:53:21,186 INFO L276 IsEmpty]: Start isEmpty. Operand 372032 states and 584291 transitions. [2019-09-10 08:53:21,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-10 08:53:21,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:21,253 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] [2019-09-10 08:53:21,253 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:21,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:21,254 INFO L82 PathProgramCache]: Analyzing trace with hash 369652713, now seen corresponding path program 1 times [2019-09-10 08:53:21,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:21,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:21,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:21,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:21,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:21,504 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 08:53:21,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:21,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:53:21,505 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:21,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:53:21,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:53:21,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:53:21,506 INFO L87 Difference]: Start difference. First operand 372032 states and 584291 transitions. Second operand 3 states. [2019-09-10 08:53:23,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:53:23,448 INFO L93 Difference]: Finished difference Result 728951 states and 1138601 transitions. [2019-09-10 08:53:23,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:53:23,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 267 [2019-09-10 08:53:23,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:53:32,445 INFO L225 Difference]: With dead ends: 728951 [2019-09-10 08:53:32,445 INFO L226 Difference]: Without dead ends: 728951 [2019-09-10 08:53:32,446 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 08:53:32,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728951 states. [2019-09-10 08:53:46,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728951 to 728631. [2019-09-10 08:53:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728631 states. [2019-09-10 08:53:47,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728631 states to 728631 states and 1138205 transitions. [2019-09-10 08:53:47,550 INFO L78 Accepts]: Start accepts. Automaton has 728631 states and 1138205 transitions. Word has length 267 [2019-09-10 08:53:47,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:53:47,551 INFO L475 AbstractCegarLoop]: Abstraction has 728631 states and 1138205 transitions. [2019-09-10 08:53:47,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:53:47,551 INFO L276 IsEmpty]: Start isEmpty. Operand 728631 states and 1138205 transitions. [2019-09-10 08:53:47,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-10 08:53:47,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:53:47,707 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:53:47,707 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:53:47,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:53:47,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1753616645, now seen corresponding path program 1 times [2019-09-10 08:53:47,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:53:47,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:47,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:53:47,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:53:47,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:53:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:53:49,803 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 08:53:49,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:53:49,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:53:49,804 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:53:49,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:53:49,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:53:49,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:53:49,805 INFO L87 Difference]: Start difference. First operand 728631 states and 1138205 transitions. Second operand 4 states. [2019-09-10 08:54:02,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:02,013 INFO L93 Difference]: Finished difference Result 1234752 states and 1925724 transitions. [2019-09-10 08:54:02,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:54:02,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 268 [2019-09-10 08:54:02,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:04,785 INFO L225 Difference]: With dead ends: 1234752 [2019-09-10 08:54:04,785 INFO L226 Difference]: Without dead ends: 1233234 [2019-09-10 08:54:04,786 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 08:54:05,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233234 states. [2019-09-10 08:54:20,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233234 to 716401. [2019-09-10 08:54:20,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716401 states. [2019-09-10 08:54:32,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716401 states to 716401 states and 1118691 transitions. [2019-09-10 08:54:32,845 INFO L78 Accepts]: Start accepts. Automaton has 716401 states and 1118691 transitions. Word has length 268 [2019-09-10 08:54:32,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:54:32,845 INFO L475 AbstractCegarLoop]: Abstraction has 716401 states and 1118691 transitions. [2019-09-10 08:54:32,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 08:54:32,845 INFO L276 IsEmpty]: Start isEmpty. Operand 716401 states and 1118691 transitions. [2019-09-10 08:54:32,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-10 08:54:32,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:54:32,967 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:54:32,967 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:54:32,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:54:32,968 INFO L82 PathProgramCache]: Analyzing trace with hash -2043165019, now seen corresponding path program 1 times [2019-09-10 08:54:32,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:54:32,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:32,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:54:32,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:54:32,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:54:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:54:33,170 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 08:54:33,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:54:33,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:54:33,171 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:54:33,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:54:33,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:54:33,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:54:33,172 INFO L87 Difference]: Start difference. First operand 716401 states and 1118691 transitions. Second operand 3 states. [2019-09-10 08:54:46,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:54:46,404 INFO L93 Difference]: Finished difference Result 1373722 states and 2132660 transitions. [2019-09-10 08:54:46,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:54:46,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2019-09-10 08:54:46,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:54:48,407 INFO L225 Difference]: With dead ends: 1373722 [2019-09-10 08:54:48,407 INFO L226 Difference]: Without dead ends: 1373722 [2019-09-10 08:54:48,407 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 08:54:49,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373722 states. [2019-09-10 08:55:26,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373722 to 1373708. [2019-09-10 08:55:26,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373708 states. [2019-09-10 08:55:31,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373708 states to 1373708 states and 2132648 transitions. [2019-09-10 08:55:31,196 INFO L78 Accepts]: Start accepts. Automaton has 1373708 states and 2132648 transitions. Word has length 269 [2019-09-10 08:55:31,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:55:31,197 INFO L475 AbstractCegarLoop]: Abstraction has 1373708 states and 2132648 transitions. [2019-09-10 08:55:31,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:55:31,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1373708 states and 2132648 transitions. [2019-09-10 08:55:44,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-10 08:55:44,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:55:44,161 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] [2019-09-10 08:55:44,162 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:55:44,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:55:44,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1044249299, now seen corresponding path program 1 times [2019-09-10 08:55:44,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:55:44,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:44,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:55:44,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:55:44,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:55:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:55:44,472 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 08:55:44,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:55:44,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 08:55:44,474 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:55:44,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 08:55:44,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 08:55:44,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 08:55:44,477 INFO L87 Difference]: Start difference. First operand 1373708 states and 2132648 transitions. Second operand 4 states. [2019-09-10 08:55:48,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:55:48,075 INFO L93 Difference]: Finished difference Result 1242378 states and 1922877 transitions. [2019-09-10 08:55:48,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 08:55:48,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 270 [2019-09-10 08:55:48,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:55:51,227 INFO L225 Difference]: With dead ends: 1242378 [2019-09-10 08:55:51,227 INFO L226 Difference]: Without dead ends: 1213056 [2019-09-10 08:55:51,228 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 08:55:51,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213056 states. [2019-09-10 08:56:14,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213056 to 1210604. [2019-09-10 08:56:14,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210604 states.