/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/47_ticket_lock_hc_backoff_vs.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 09:11:30,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 09:11:30,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 09:11:31,021 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 09:11:31,022 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 09:11:31,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 09:11:31,027 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 09:11:31,033 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 09:11:31,035 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 09:11:31,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 09:11:31,040 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 09:11:31,041 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 09:11:31,041 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 09:11:31,043 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 09:11:31,044 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 09:11:31,045 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 09:11:31,048 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 09:11:31,049 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 09:11:31,051 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 09:11:31,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 09:11:31,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 09:11:31,058 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 09:11:31,059 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 09:11:31,061 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 09:11:31,067 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 09:11:31,067 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 09:11:31,067 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 09:11:31,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 09:11:31,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 09:11:31,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 09:11:31,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 09:11:31,070 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 09:11:31,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 09:11:31,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 09:11:31,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 09:11:31,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 09:11:31,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 09:11:31,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 09:11:31,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 09:11:31,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 09:11:31,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 09:11:31,082 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf [2021-06-05 09:11:31,117 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 09:11:31,117 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 09:11:31,118 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 09:11:31,118 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 09:11:31,120 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 09:11:31,120 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 09:11:31,121 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 09:11:31,121 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 09:11:31,121 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 09:11:31,121 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 09:11:31,122 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 09:11:31,122 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 09:11:31,122 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 09:11:31,122 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 09:11:31,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 09:11:31,123 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 09:11:31,123 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 09:11:31,123 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 09:11:31,123 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 09:11:31,123 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 09:11:31,123 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 09:11:31,124 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 09:11:31,124 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 09:11:31,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 09:11:31,124 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 09:11:31,124 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 09:11:31,124 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 09:11:31,125 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 09:11:31,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 09:11:31,125 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 09:11:31,125 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 09:11:31,125 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 09:11:31,125 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 09:11:31,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 09:11:31,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 09:11:31,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 09:11:31,463 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 09:11:31,463 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 09:11:31,464 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/47_ticket_lock_hc_backoff_vs.i [2021-06-05 09:11:31,532 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14e436589/5e9d7b52713b48c6a7c3580d8fdcf14a/FLAGe353cb9f4 [2021-06-05 09:11:32,070 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 09:11:32,071 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/47_ticket_lock_hc_backoff_vs.i [2021-06-05 09:11:32,091 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14e436589/5e9d7b52713b48c6a7c3580d8fdcf14a/FLAGe353cb9f4 [2021-06-05 09:11:32,532 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14e436589/5e9d7b52713b48c6a7c3580d8fdcf14a [2021-06-05 09:11:32,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 09:11:32,536 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 09:11:32,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 09:11:32,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 09:11:32,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 09:11:32,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 09:11:32" (1/1) ... [2021-06-05 09:11:32,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@359128d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:11:32, skipping insertion in model container [2021-06-05 09:11:32,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 09:11:32" (1/1) ... [2021-06-05 09:11:32,563 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 09:11:32,611 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 09:11:32,851 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/47_ticket_lock_hc_backoff_vs.i[30336,30349] [2021-06-05 09:11:32,862 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 09:11:32,870 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 09:11:32,923 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/47_ticket_lock_hc_backoff_vs.i[30336,30349] [2021-06-05 09:11:32,925 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 09:11:32,979 INFO L208 MainTranslator]: Completed translation [2021-06-05 09:11:32,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:11:32 WrapperNode [2021-06-05 09:11:32,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 09:11:32,981 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 09:11:32,981 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 09:11:32,981 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 09:11:32,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:11:32" (1/1) ... [2021-06-05 09:11:32,997 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:11:32" (1/1) ... [2021-06-05 09:11:33,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 09:11:33,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 09:11:33,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 09:11:33,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 09:11:33,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:11:32" (1/1) ... [2021-06-05 09:11:33,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:11:32" (1/1) ... [2021-06-05 09:11:33,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:11:32" (1/1) ... [2021-06-05 09:11:33,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:11:32" (1/1) ... [2021-06-05 09:11:33,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:11:32" (1/1) ... [2021-06-05 09:11:33,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:11:32" (1/1) ... [2021-06-05 09:11:33,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:11:32" (1/1) ... [2021-06-05 09:11:33,036 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 09:11:33,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 09:11:33,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 09:11:33,037 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 09:11:33,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:11:32" (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 [2021-06-05 09:11:33,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 09:11:33,121 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2021-06-05 09:11:33,122 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2021-06-05 09:11:33,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 09:11:33,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 09:11:33,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 09:11:33,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 09:11:33,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 09:11:33,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 09:11:33,126 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 09:11:33,769 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 09:11:33,769 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-06-05 09:11:33,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 09:11:33 BoogieIcfgContainer [2021-06-05 09:11:33,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 09:11:33,772 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 09:11:33,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 09:11:33,776 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 09:11:33,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 09:11:32" (1/3) ... [2021-06-05 09:11:33,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d389f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 09:11:33, skipping insertion in model container [2021-06-05 09:11:33,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 09:11:32" (2/3) ... [2021-06-05 09:11:33,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d389f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 09:11:33, skipping insertion in model container [2021-06-05 09:11:33,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 09:11:33" (3/3) ... [2021-06-05 09:11:33,779 INFO L111 eAbstractionObserver]: Analyzing ICFG 47_ticket_lock_hc_backoff_vs.i [2021-06-05 09:11:33,784 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 09:11:33,784 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 09:11:33,785 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-05 09:11:33,786 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 09:11:33,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,814 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,814 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,815 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,815 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,815 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,815 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,815 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,816 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_fetch_and_inc_~l.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,817 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,817 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_fetch_and_inc_~l.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,818 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,818 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_fetch_and_inc_~l.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,818 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,818 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,818 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,818 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,819 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_fetch_and_inc_~l.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,819 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,821 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,821 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,821 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,821 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,821 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,821 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,822 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,823 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,823 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,823 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,823 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,825 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,825 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,826 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_fetch_and_inc_~l.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,826 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,826 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_fetch_and_inc_~l.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,827 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:11:33,829 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 09:11:33,848 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-05 09:11:33,864 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 09:11:33,864 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 09:11:33,865 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 09:11:33,865 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 09:11:33,865 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 09:11:33,865 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 09:11:33,865 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 09:11:33,865 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 09:11:33,873 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 91 transitions, 187 flow [2021-06-05 09:11:33,928 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1042 states, 1034 states have (on average 2.3123791102514506) internal successors, (2391), 1041 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:33,935 INFO L276 IsEmpty]: Start isEmpty. Operand has 1042 states, 1034 states have (on average 2.3123791102514506) internal successors, (2391), 1041 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:33,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-06-05 09:11:33,946 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:11:33,947 INFO L521 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] [2021-06-05 09:11:33,947 INFO L430 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:11:33,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:11:33,951 INFO L82 PathProgramCache]: Analyzing trace with hash -784179379, now seen corresponding path program 1 times [2021-06-05 09:11:33,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:11:33,958 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581148644] [2021-06-05 09:11:33,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:11:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:11:34,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:11:34,082 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:11:34,082 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581148644] [2021-06-05 09:11:34,083 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581148644] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:11:34,083 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:11:34,083 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 09:11:34,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336714969] [2021-06-05 09:11:34,086 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 09:11:34,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:11:34,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 09:11:34,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 09:11:34,100 INFO L87 Difference]: Start difference. First operand has 1042 states, 1034 states have (on average 2.3123791102514506) internal successors, (2391), 1041 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:34,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:11:34,128 INFO L93 Difference]: Finished difference Result 670 states and 1351 transitions. [2021-06-05 09:11:34,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 09:11:34,129 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-06-05 09:11:34,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:11:34,143 INFO L225 Difference]: With dead ends: 670 [2021-06-05 09:11:34,144 INFO L226 Difference]: Without dead ends: 670 [2021-06-05 09:11:34,145 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 09:11:34,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2021-06-05 09:11:34,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2021-06-05 09:11:34,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 667 states have (on average 2.025487256371814) internal successors, (1351), 669 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:34,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1351 transitions. [2021-06-05 09:11:34,217 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1351 transitions. Word has length 25 [2021-06-05 09:11:34,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:11:34,218 INFO L482 AbstractCegarLoop]: Abstraction has 670 states and 1351 transitions. [2021-06-05 09:11:34,218 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:34,218 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1351 transitions. [2021-06-05 09:11:34,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 09:11:34,219 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:11:34,219 INFO L521 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] [2021-06-05 09:11:34,220 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 09:11:34,220 INFO L430 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:11:34,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:11:34,221 INFO L82 PathProgramCache]: Analyzing trace with hash 2062752289, now seen corresponding path program 1 times [2021-06-05 09:11:34,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:11:34,221 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538075852] [2021-06-05 09:11:34,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:11:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:11:34,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:11:34,358 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:11:34,358 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538075852] [2021-06-05 09:11:34,358 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538075852] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:11:34,358 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:11:34,359 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 09:11:34,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767001598] [2021-06-05 09:11:34,360 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 09:11:34,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:11:34,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 09:11:34,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 09:11:34,363 INFO L87 Difference]: Start difference. First operand 670 states and 1351 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:34,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:11:34,404 INFO L93 Difference]: Finished difference Result 688 states and 1389 transitions. [2021-06-05 09:11:34,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 09:11:34,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 09:11:34,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:11:34,407 INFO L225 Difference]: With dead ends: 688 [2021-06-05 09:11:34,408 INFO L226 Difference]: Without dead ends: 565 [2021-06-05 09:11:34,408 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 09:11:34,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2021-06-05 09:11:34,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 537. [2021-06-05 09:11:34,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 537 states have (on average 2.0446927374301676) internal successors, (1098), 536 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:34,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 1098 transitions. [2021-06-05 09:11:34,437 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 1098 transitions. Word has length 30 [2021-06-05 09:11:34,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:11:34,437 INFO L482 AbstractCegarLoop]: Abstraction has 537 states and 1098 transitions. [2021-06-05 09:11:34,437 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:34,437 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 1098 transitions. [2021-06-05 09:11:34,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-06-05 09:11:34,445 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:11:34,445 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:11:34,445 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 09:11:34,447 INFO L430 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:11:34,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:11:34,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1042794163, now seen corresponding path program 1 times [2021-06-05 09:11:34,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:11:34,448 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139107383] [2021-06-05 09:11:34,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:11:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:11:34,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:11:34,667 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:11:34,667 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139107383] [2021-06-05 09:11:34,667 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139107383] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:34,667 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637552473] [2021-06-05 09:11:34,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:11:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:11:34,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 09:11:34,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:11:35,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:11:35,114 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:35,122 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:35,128 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:35,129 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:11:35,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:11:35,207 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:35,212 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:35,213 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:35,213 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:11:35,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:11:35,245 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637552473] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:35,245 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:11:35,245 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2021-06-05 09:11:35,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4624758] [2021-06-05 09:11:35,246 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 09:11:35,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:11:35,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 09:11:35,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:11:35,247 INFO L87 Difference]: Start difference. First operand 537 states and 1098 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:35,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:11:35,523 INFO L93 Difference]: Finished difference Result 938 states and 1945 transitions. [2021-06-05 09:11:35,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:11:35,524 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-06-05 09:11:35,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:11:35,529 INFO L225 Difference]: With dead ends: 938 [2021-06-05 09:11:35,529 INFO L226 Difference]: Without dead ends: 938 [2021-06-05 09:11:35,530 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 157.7ms TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:11:35,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2021-06-05 09:11:35,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 736. [2021-06-05 09:11:35,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 736 states have (on average 2.0543478260869565) internal successors, (1512), 735 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:35,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1512 transitions. [2021-06-05 09:11:35,554 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1512 transitions. Word has length 50 [2021-06-05 09:11:35,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:11:35,555 INFO L482 AbstractCegarLoop]: Abstraction has 736 states and 1512 transitions. [2021-06-05 09:11:35,555 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:35,555 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1512 transitions. [2021-06-05 09:11:35,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-06-05 09:11:35,558 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:11:35,558 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:11:35,781 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-06-05 09:11:35,781 INFO L430 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:11:35,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:11:35,782 INFO L82 PathProgramCache]: Analyzing trace with hash 978235885, now seen corresponding path program 2 times [2021-06-05 09:11:35,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:11:35,782 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55181845] [2021-06-05 09:11:35,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:11:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:11:35,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:11:35,910 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:11:35,910 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55181845] [2021-06-05 09:11:35,910 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55181845] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:11:35,910 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:11:35,910 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 09:11:35,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107437332] [2021-06-05 09:11:35,911 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 09:11:35,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:11:35,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 09:11:35,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 09:11:35,912 INFO L87 Difference]: Start difference. First operand 736 states and 1512 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:36,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:11:36,024 INFO L93 Difference]: Finished difference Result 816 states and 1680 transitions. [2021-06-05 09:11:36,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 09:11:36,025 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-06-05 09:11:36,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:11:36,029 INFO L225 Difference]: With dead ends: 816 [2021-06-05 09:11:36,029 INFO L226 Difference]: Without dead ends: 816 [2021-06-05 09:11:36,029 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 61.9ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-06-05 09:11:36,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2021-06-05 09:11:36,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 816. [2021-06-05 09:11:36,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 816 states have (on average 2.0588235294117645) internal successors, (1680), 815 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:36,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1680 transitions. [2021-06-05 09:11:36,048 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1680 transitions. Word has length 50 [2021-06-05 09:11:36,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:11:36,049 INFO L482 AbstractCegarLoop]: Abstraction has 816 states and 1680 transitions. [2021-06-05 09:11:36,049 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:36,049 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1680 transitions. [2021-06-05 09:11:36,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 09:11:36,051 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:11:36,051 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:11:36,051 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-05 09:11:36,051 INFO L430 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:11:36,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:11:36,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1011590070, now seen corresponding path program 1 times [2021-06-05 09:11:36,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:11:36,052 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809532089] [2021-06-05 09:11:36,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:11:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:11:36,271 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:11:36,272 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:11:36,272 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809532089] [2021-06-05 09:11:36,272 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809532089] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:36,272 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063517279] [2021-06-05 09:11:36,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:11:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:11:36,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 09:11:36,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:11:36,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:11:36,642 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:36,650 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:36,652 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:36,653 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:11:36,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:11:36,687 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:36,691 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:36,692 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:36,692 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:11:36,725 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:11:36,726 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063517279] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:36,726 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:11:36,726 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 16 [2021-06-05 09:11:36,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342957373] [2021-06-05 09:11:36,728 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 09:11:36,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:11:36,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 09:11:36,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:11:36,729 INFO L87 Difference]: Start difference. First operand 816 states and 1680 transitions. Second operand has 16 states, 16 states have (on average 5.9375) internal successors, (95), 16 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:37,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:11:37,225 INFO L93 Difference]: Finished difference Result 1224 states and 2529 transitions. [2021-06-05 09:11:37,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 09:11:37,226 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.9375) internal successors, (95), 16 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-06-05 09:11:37,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:11:37,231 INFO L225 Difference]: With dead ends: 1224 [2021-06-05 09:11:37,231 INFO L226 Difference]: Without dead ends: 1224 [2021-06-05 09:11:37,232 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 294.4ms TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2021-06-05 09:11:37,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2021-06-05 09:11:37,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1008. [2021-06-05 09:11:37,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 1008 states have (on average 2.0595238095238093) internal successors, (2076), 1007 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 2076 transitions. [2021-06-05 09:11:37,257 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 2076 transitions. Word has length 65 [2021-06-05 09:11:37,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:11:37,258 INFO L482 AbstractCegarLoop]: Abstraction has 1008 states and 2076 transitions. [2021-06-05 09:11:37,258 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 5.9375) internal successors, (95), 16 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:37,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 2076 transitions. [2021-06-05 09:11:37,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 09:11:37,261 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:11:37,261 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:11:37,485 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:11:37,485 INFO L430 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:11:37,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:11:37,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1938622520, now seen corresponding path program 2 times [2021-06-05 09:11:37,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:11:37,486 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599200571] [2021-06-05 09:11:37,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:11:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:11:37,649 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:11:37,649 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:11:37,671 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599200571] [2021-06-05 09:11:37,671 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599200571] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:37,673 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837078831] [2021-06-05 09:11:37,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:11:37,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 09:11:37,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:11:37,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 32 conjunts are in the unsatisfiable core [2021-06-05 09:11:37,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:11:37,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:11:37,853 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:37,858 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:37,859 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:37,859 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2021-06-05 09:11:37,987 INFO L354 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2021-06-05 09:11:37,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2021-06-05 09:11:37,991 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:38,000 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:38,005 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:38,005 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2021-06-05 09:11:38,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 09:11:38,040 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:38,042 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:38,043 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:38,043 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2021-06-05 09:11:38,086 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:11:38,086 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837078831] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:11:38,086 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:11:38,087 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2021-06-05 09:11:38,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828014026] [2021-06-05 09:11:38,087 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:11:38,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:11:38,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:11:38,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-06-05 09:11:38,090 INFO L87 Difference]: Start difference. First operand 1008 states and 2076 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:38,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:11:38,531 INFO L93 Difference]: Finished difference Result 1637 states and 3401 transitions. [2021-06-05 09:11:38,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 09:11:38,531 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-06-05 09:11:38,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:11:38,537 INFO L225 Difference]: With dead ends: 1637 [2021-06-05 09:11:38,537 INFO L226 Difference]: Without dead ends: 1637 [2021-06-05 09:11:38,537 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 316.5ms TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2021-06-05 09:11:38,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2021-06-05 09:11:38,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1014. [2021-06-05 09:11:38,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 1014 states have (on average 2.060157790927022) internal successors, (2089), 1013 states have internal predecessors, (2089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:38,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 2089 transitions. [2021-06-05 09:11:38,562 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 2089 transitions. Word has length 65 [2021-06-05 09:11:38,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:11:38,563 INFO L482 AbstractCegarLoop]: Abstraction has 1014 states and 2089 transitions. [2021-06-05 09:11:38,563 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:38,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 2089 transitions. [2021-06-05 09:11:38,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 09:11:38,565 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:11:38,565 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:11:38,784 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:11:38,785 INFO L430 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:11:38,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:11:38,785 INFO L82 PathProgramCache]: Analyzing trace with hash 479424622, now seen corresponding path program 3 times [2021-06-05 09:11:38,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:11:38,785 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25449120] [2021-06-05 09:11:38,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:11:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:11:38,961 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:11:38,961 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:11:38,961 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25449120] [2021-06-05 09:11:38,961 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25449120] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:38,961 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658705257] [2021-06-05 09:11:38,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:11:39,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 09:11:39,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:11:39,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 32 conjunts are in the unsatisfiable core [2021-06-05 09:11:39,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:11:39,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:11:39,151 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:39,156 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:39,157 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:39,157 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2021-06-05 09:11:39,223 INFO L354 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2021-06-05 09:11:39,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-06-05 09:11:39,228 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:39,255 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:39,258 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:39,258 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2021-06-05 09:11:39,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-06-05 09:11:39,285 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:39,286 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:39,287 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:39,287 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2021-06-05 09:11:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:11:39,334 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658705257] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:11:39,335 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:11:39,335 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2021-06-05 09:11:39,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299565252] [2021-06-05 09:11:39,335 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:11:39,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:11:39,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:11:39,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-06-05 09:11:39,336 INFO L87 Difference]: Start difference. First operand 1014 states and 2089 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:39,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:11:39,667 INFO L93 Difference]: Finished difference Result 1616 states and 3373 transitions. [2021-06-05 09:11:39,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 09:11:39,667 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-06-05 09:11:39,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:11:39,673 INFO L225 Difference]: With dead ends: 1616 [2021-06-05 09:11:39,673 INFO L226 Difference]: Without dead ends: 1616 [2021-06-05 09:11:39,674 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 244.4ms TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2021-06-05 09:11:39,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2021-06-05 09:11:39,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1024. [2021-06-05 09:11:39,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1024 states have (on average 2.064453125) internal successors, (2114), 1023 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:39,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 2114 transitions. [2021-06-05 09:11:39,700 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 2114 transitions. Word has length 65 [2021-06-05 09:11:39,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:11:39,701 INFO L482 AbstractCegarLoop]: Abstraction has 1024 states and 2114 transitions. [2021-06-05 09:11:39,701 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:39,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 2114 transitions. [2021-06-05 09:11:39,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 09:11:39,703 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:11:39,703 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:11:39,923 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:11:39,924 INFO L430 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:11:39,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:11:39,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1093811618, now seen corresponding path program 4 times [2021-06-05 09:11:39,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:11:39,925 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435500369] [2021-06-05 09:11:39,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:11:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:11:40,064 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:11:40,064 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:11:40,064 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435500369] [2021-06-05 09:11:40,066 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435500369] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:40,066 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724764008] [2021-06-05 09:11:40,066 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:11:40,161 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:11:40,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:11:40,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 09:11:40,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:11:40,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:11:40,341 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:40,348 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:40,349 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:40,350 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:11:40,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:11:40,384 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:40,388 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:40,389 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:40,389 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:11:40,418 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:11:40,419 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724764008] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:40,419 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:11:40,419 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 16 [2021-06-05 09:11:40,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416396907] [2021-06-05 09:11:40,419 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 09:11:40,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:11:40,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 09:11:40,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:11:40,420 INFO L87 Difference]: Start difference. First operand 1024 states and 2114 transitions. Second operand has 16 states, 16 states have (on average 5.75) internal successors, (92), 16 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:40,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:11:40,894 INFO L93 Difference]: Finished difference Result 1282 states and 2654 transitions. [2021-06-05 09:11:40,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 09:11:40,895 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.75) internal successors, (92), 16 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-06-05 09:11:40,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:11:40,900 INFO L225 Difference]: With dead ends: 1282 [2021-06-05 09:11:40,900 INFO L226 Difference]: Without dead ends: 1282 [2021-06-05 09:11:40,900 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 242.9ms TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2021-06-05 09:11:40,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2021-06-05 09:11:40,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1053. [2021-06-05 09:11:40,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 1053 states have (on average 2.0655270655270654) internal successors, (2175), 1052 states have internal predecessors, (2175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:40,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 2175 transitions. [2021-06-05 09:11:40,923 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 2175 transitions. Word has length 65 [2021-06-05 09:11:40,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:11:40,924 INFO L482 AbstractCegarLoop]: Abstraction has 1053 states and 2175 transitions. [2021-06-05 09:11:40,924 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 5.75) internal successors, (92), 16 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:40,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 2175 transitions. [2021-06-05 09:11:40,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 09:11:40,926 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:11:40,926 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:11:41,148 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:11:41,149 INFO L430 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:11:41,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:11:41,149 INFO L82 PathProgramCache]: Analyzing trace with hash -547640160, now seen corresponding path program 5 times [2021-06-05 09:11:41,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:11:41,150 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31942932] [2021-06-05 09:11:41,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:11:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:11:41,269 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:11:41,270 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:11:41,270 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31942932] [2021-06-05 09:11:41,270 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31942932] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:41,270 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183511681] [2021-06-05 09:11:41,270 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:11:41,364 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:11:41,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:11:41,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 09:11:41,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:11:41,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:11:41,517 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:41,524 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:41,526 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:41,526 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:11:41,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:11:41,559 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:41,564 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:41,565 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:41,565 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:11:41,592 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:11:41,593 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183511681] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:41,593 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:11:41,593 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2021-06-05 09:11:41,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402564215] [2021-06-05 09:11:41,594 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 09:11:41,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:11:41,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 09:11:41,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:11:41,594 INFO L87 Difference]: Start difference. First operand 1053 states and 2175 transitions. Second operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:42,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:11:42,060 INFO L93 Difference]: Finished difference Result 1273 states and 2636 transitions. [2021-06-05 09:11:42,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 09:11:42,061 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-06-05 09:11:42,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:11:42,065 INFO L225 Difference]: With dead ends: 1273 [2021-06-05 09:11:42,065 INFO L226 Difference]: Without dead ends: 1273 [2021-06-05 09:11:42,066 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 240.0ms TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2021-06-05 09:11:42,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2021-06-05 09:11:42,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1057. [2021-06-05 09:11:42,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 1057 states have (on average 2.065279091769158) internal successors, (2183), 1056 states have internal predecessors, (2183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:42,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 2183 transitions. [2021-06-05 09:11:42,093 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 2183 transitions. Word has length 65 [2021-06-05 09:11:42,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:11:42,093 INFO L482 AbstractCegarLoop]: Abstraction has 1057 states and 2183 transitions. [2021-06-05 09:11:42,093 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:42,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 2183 transitions. [2021-06-05 09:11:42,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 09:11:42,095 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:11:42,095 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:11:42,319 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:11:42,320 INFO L430 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:11:42,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:11:42,320 INFO L82 PathProgramCache]: Analyzing trace with hash -900840246, now seen corresponding path program 6 times [2021-06-05 09:11:42,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:11:42,321 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396600036] [2021-06-05 09:11:42,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:11:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:11:42,481 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:11:42,481 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:11:42,481 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396600036] [2021-06-05 09:11:42,481 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396600036] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:42,481 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941960271] [2021-06-05 09:11:42,482 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:11:42,561 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-06-05 09:11:42,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:11:42,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 32 conjunts are in the unsatisfiable core [2021-06-05 09:11:42,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:11:42,646 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:11:42,647 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:42,651 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:42,652 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:42,652 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2021-06-05 09:11:42,809 INFO L354 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2021-06-05 09:11:42,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2021-06-05 09:11:42,812 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:42,821 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:42,824 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:42,824 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2021-06-05 09:11:42,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 09:11:42,859 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:42,861 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:42,862 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:42,862 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2021-06-05 09:11:42,897 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:11:42,897 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941960271] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:11:42,898 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:11:42,898 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2021-06-05 09:11:42,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278180166] [2021-06-05 09:11:42,900 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:11:42,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:11:42,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:11:42,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-06-05 09:11:42,901 INFO L87 Difference]: Start difference. First operand 1057 states and 2183 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:43,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:11:43,319 INFO L93 Difference]: Finished difference Result 1400 states and 2898 transitions. [2021-06-05 09:11:43,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 09:11:43,319 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-06-05 09:11:43,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:11:43,324 INFO L225 Difference]: With dead ends: 1400 [2021-06-05 09:11:43,325 INFO L226 Difference]: Without dead ends: 1400 [2021-06-05 09:11:43,325 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 332.1ms TimeCoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2021-06-05 09:11:43,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2021-06-05 09:11:43,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1111. [2021-06-05 09:11:43,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 1111 states have (on average 2.0792079207920793) internal successors, (2310), 1110 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:43,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 2310 transitions. [2021-06-05 09:11:43,351 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 2310 transitions. Word has length 65 [2021-06-05 09:11:43,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:11:43,351 INFO L482 AbstractCegarLoop]: Abstraction has 1111 states and 2310 transitions. [2021-06-05 09:11:43,352 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:43,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 2310 transitions. [2021-06-05 09:11:43,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 09:11:43,354 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:11:43,354 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:11:43,576 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-06-05 09:11:43,577 INFO L430 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:11:43,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:11:43,577 INFO L82 PathProgramCache]: Analyzing trace with hash 513591262, now seen corresponding path program 7 times [2021-06-05 09:11:43,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:11:43,578 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441166477] [2021-06-05 09:11:43,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:11:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:11:43,688 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:11:43,689 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:11:43,689 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441166477] [2021-06-05 09:11:43,689 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441166477] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:43,689 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294389653] [2021-06-05 09:11:43,689 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:11:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:11:43,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 09:11:43,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:11:43,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:11:43,934 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:43,941 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:43,943 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:43,943 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:11:43,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:11:43,971 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:43,975 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:43,976 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:43,976 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:11:44,004 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:11:44,004 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294389653] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:44,004 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:11:44,005 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2021-06-05 09:11:44,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187935280] [2021-06-05 09:11:44,006 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 09:11:44,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:11:44,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 09:11:44,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:11:44,007 INFO L87 Difference]: Start difference. First operand 1111 states and 2310 transitions. Second operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:44,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:11:44,420 INFO L93 Difference]: Finished difference Result 1363 states and 2835 transitions. [2021-06-05 09:11:44,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 09:11:44,421 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-06-05 09:11:44,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:11:44,426 INFO L225 Difference]: With dead ends: 1363 [2021-06-05 09:11:44,426 INFO L226 Difference]: Without dead ends: 1363 [2021-06-05 09:11:44,426 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 223.5ms TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-06-05 09:11:44,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2021-06-05 09:11:44,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1147. [2021-06-05 09:11:44,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 1147 states have (on average 2.080209241499564) internal successors, (2386), 1146 states have internal predecessors, (2386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:44,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 2386 transitions. [2021-06-05 09:11:44,451 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 2386 transitions. Word has length 65 [2021-06-05 09:11:44,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:11:44,451 INFO L482 AbstractCegarLoop]: Abstraction has 1147 states and 2386 transitions. [2021-06-05 09:11:44,451 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:44,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 2386 transitions. [2021-06-05 09:11:44,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 09:11:44,453 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:11:44,453 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:11:44,668 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-06-05 09:11:44,669 INFO L430 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:11:44,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:11:44,669 INFO L82 PathProgramCache]: Analyzing trace with hash 251664739, now seen corresponding path program 1 times [2021-06-05 09:11:44,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:11:44,669 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156021118] [2021-06-05 09:11:44,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:11:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:11:44,803 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:11:44,804 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:11:44,804 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156021118] [2021-06-05 09:11:44,804 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156021118] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:44,804 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116564224] [2021-06-05 09:11:44,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:11:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:11:44,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 09:11:44,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:11:45,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:11:45,042 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:45,049 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:45,051 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:45,051 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:11:45,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:11:45,078 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:45,082 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:45,083 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:45,083 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:11:45,107 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:11:45,107 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116564224] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:45,108 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:11:45,108 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2021-06-05 09:11:45,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6486124] [2021-06-05 09:11:45,108 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 09:11:45,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:11:45,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 09:11:45,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:11:45,109 INFO L87 Difference]: Start difference. First operand 1147 states and 2386 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:45,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:11:45,521 INFO L93 Difference]: Finished difference Result 1349 states and 2807 transitions. [2021-06-05 09:11:45,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 09:11:45,522 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-06-05 09:11:45,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:11:45,526 INFO L225 Difference]: With dead ends: 1349 [2021-06-05 09:11:45,526 INFO L226 Difference]: Without dead ends: 1349 [2021-06-05 09:11:45,526 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 268.3ms TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2021-06-05 09:11:45,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2021-06-05 09:11:45,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1249. [2021-06-05 09:11:45,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1249 states have (on average 2.0816653322658127) internal successors, (2600), 1248 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:45,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 2600 transitions. [2021-06-05 09:11:45,551 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 2600 transitions. Word has length 65 [2021-06-05 09:11:45,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:11:45,551 INFO L482 AbstractCegarLoop]: Abstraction has 1249 states and 2600 transitions. [2021-06-05 09:11:45,551 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:45,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 2600 transitions. [2021-06-05 09:11:45,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 09:11:45,553 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:11:45,553 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:11:45,776 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:11:45,777 INFO L430 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:11:45,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:11:45,777 INFO L82 PathProgramCache]: Analyzing trace with hash 350179319, now seen corresponding path program 2 times [2021-06-05 09:11:45,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:11:45,778 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924471879] [2021-06-05 09:11:45,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:11:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:11:45,898 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:11:45,899 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:11:45,899 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924471879] [2021-06-05 09:11:45,899 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924471879] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:45,899 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47158495] [2021-06-05 09:11:45,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:11:45,980 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 09:11:45,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:11:45,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 09:11:45,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:11:46,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:11:46,058 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:46,062 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:46,062 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:46,063 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2021-06-05 09:11:46,206 INFO L354 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-06-05 09:11:46,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2021-06-05 09:11:46,209 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:46,219 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:46,221 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:46,222 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2021-06-05 09:11:46,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 09:11:46,259 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:46,261 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:46,261 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:46,262 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2021-06-05 09:11:46,289 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 09:11:46,289 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47158495] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:11:46,290 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:11:46,290 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2021-06-05 09:11:46,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983431176] [2021-06-05 09:11:46,290 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 09:11:46,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:11:46,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 09:11:46,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:11:46,291 INFO L87 Difference]: Start difference. First operand 1249 states and 2600 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:46,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:11:46,603 INFO L93 Difference]: Finished difference Result 1522 states and 3158 transitions. [2021-06-05 09:11:46,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:11:46,603 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-06-05 09:11:46,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:11:46,608 INFO L225 Difference]: With dead ends: 1522 [2021-06-05 09:11:46,608 INFO L226 Difference]: Without dead ends: 1522 [2021-06-05 09:11:46,609 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 232.7ms TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2021-06-05 09:11:46,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2021-06-05 09:11:46,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1253. [2021-06-05 09:11:46,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1253 states have (on average 2.0822027134876295) internal successors, (2609), 1252 states have internal predecessors, (2609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:46,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 2609 transitions. [2021-06-05 09:11:46,635 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 2609 transitions. Word has length 65 [2021-06-05 09:11:46,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:11:46,635 INFO L482 AbstractCegarLoop]: Abstraction has 1253 states and 2609 transitions. [2021-06-05 09:11:46,636 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:46,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 2609 transitions. [2021-06-05 09:11:46,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 09:11:46,638 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:11:46,638 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:11:46,863 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:11:46,863 INFO L430 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:11:46,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:11:46,863 INFO L82 PathProgramCache]: Analyzing trace with hash -99389445, now seen corresponding path program 3 times [2021-06-05 09:11:46,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:11:46,863 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424181373] [2021-06-05 09:11:46,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:11:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:11:46,967 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:11:46,967 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:11:46,968 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424181373] [2021-06-05 09:11:46,968 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424181373] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:46,968 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108334752] [2021-06-05 09:11:46,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:11:47,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 09:11:47,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:11:47,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 09:11:47,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:11:47,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:11:47,120 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:47,124 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:47,125 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:47,125 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2021-06-05 09:11:47,183 INFO L354 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-06-05 09:11:47,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2021-06-05 09:11:47,185 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:47,194 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:47,196 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:47,196 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:13 [2021-06-05 09:11:47,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 09:11:47,272 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:47,273 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:47,274 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:47,274 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2021-06-05 09:11:47,299 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 09:11:47,299 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108334752] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:11:47,299 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:11:47,299 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2021-06-05 09:11:47,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212730441] [2021-06-05 09:11:47,300 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 09:11:47,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:11:47,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 09:11:47,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:11:47,301 INFO L87 Difference]: Start difference. First operand 1253 states and 2609 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:47,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:11:47,608 INFO L93 Difference]: Finished difference Result 1653 states and 3449 transitions. [2021-06-05 09:11:47,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 09:11:47,608 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-06-05 09:11:47,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:11:47,613 INFO L225 Difference]: With dead ends: 1653 [2021-06-05 09:11:47,614 INFO L226 Difference]: Without dead ends: 1653 [2021-06-05 09:11:47,614 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 229.4ms TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2021-06-05 09:11:47,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2021-06-05 09:11:47,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1263. [2021-06-05 09:11:47,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 1263 states have (on average 2.0902612826603324) internal successors, (2640), 1262 states have internal predecessors, (2640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:47,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 2640 transitions. [2021-06-05 09:11:47,640 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 2640 transitions. Word has length 65 [2021-06-05 09:11:47,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:11:47,640 INFO L482 AbstractCegarLoop]: Abstraction has 1263 states and 2640 transitions. [2021-06-05 09:11:47,641 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:47,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 2640 transitions. [2021-06-05 09:11:47,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 09:11:47,643 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:11:47,643 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:11:47,856 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-06-05 09:11:47,857 INFO L430 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:11:47,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:11:47,857 INFO L82 PathProgramCache]: Analyzing trace with hash -674744953, now seen corresponding path program 4 times [2021-06-05 09:11:47,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:11:47,857 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013346262] [2021-06-05 09:11:47,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:11:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:11:47,968 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:11:47,969 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:11:47,969 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013346262] [2021-06-05 09:11:47,969 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013346262] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:47,969 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047550444] [2021-06-05 09:11:47,969 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:11:48,028 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:11:48,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:11:48,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 09:11:48,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:11:48,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:11:48,185 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:48,192 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:48,193 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:48,193 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:11:48,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:11:48,218 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:48,222 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:48,223 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:48,223 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:11:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:11:48,252 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047550444] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:48,252 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:11:48,252 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 16 [2021-06-05 09:11:48,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126252662] [2021-06-05 09:11:48,252 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 09:11:48,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:11:48,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 09:11:48,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:11:48,253 INFO L87 Difference]: Start difference. First operand 1263 states and 2640 transitions. Second operand has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:48,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:11:48,743 INFO L93 Difference]: Finished difference Result 1530 states and 3198 transitions. [2021-06-05 09:11:48,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 09:11:48,744 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-06-05 09:11:48,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:11:48,749 INFO L225 Difference]: With dead ends: 1530 [2021-06-05 09:11:48,749 INFO L226 Difference]: Without dead ends: 1530 [2021-06-05 09:11:48,750 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 258.5ms TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2021-06-05 09:11:48,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2021-06-05 09:11:48,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1292. [2021-06-05 09:11:48,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 1292 states have (on average 2.088235294117647) internal successors, (2698), 1291 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:48,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 2698 transitions. [2021-06-05 09:11:48,803 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 2698 transitions. Word has length 65 [2021-06-05 09:11:48,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:11:48,803 INFO L482 AbstractCegarLoop]: Abstraction has 1292 states and 2698 transitions. [2021-06-05 09:11:48,803 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:48,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 2698 transitions. [2021-06-05 09:11:48,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 09:11:48,806 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:11:48,806 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:11:49,030 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-06-05 09:11:49,030 INFO L430 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:11:49,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:11:49,031 INFO L82 PathProgramCache]: Analyzing trace with hash -994575387, now seen corresponding path program 5 times [2021-06-05 09:11:49,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:11:49,031 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331241985] [2021-06-05 09:11:49,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:11:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:11:49,141 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:11:49,141 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:11:49,141 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331241985] [2021-06-05 09:11:49,141 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331241985] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:49,141 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637015351] [2021-06-05 09:11:49,141 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:11:49,233 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:11:49,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:11:49,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 09:11:49,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:11:49,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:11:49,427 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:49,432 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:49,433 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:49,433 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2021-06-05 09:11:49,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 09:11:49,458 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:49,461 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:49,461 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:49,461 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2021-06-05 09:11:49,480 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:11:49,481 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637015351] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:49,481 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:11:49,481 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 18 [2021-06-05 09:11:49,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003130010] [2021-06-05 09:11:49,481 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 09:11:49,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:11:49,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 09:11:49,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-06-05 09:11:49,482 INFO L87 Difference]: Start difference. First operand 1292 states and 2698 transitions. Second operand has 18 states, 18 states have (on average 5.5) internal successors, (99), 18 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:49,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:11:49,864 INFO L93 Difference]: Finished difference Result 1581 states and 3305 transitions. [2021-06-05 09:11:49,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 09:11:49,865 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.5) internal successors, (99), 18 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-06-05 09:11:49,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:11:49,870 INFO L225 Difference]: With dead ends: 1581 [2021-06-05 09:11:49,871 INFO L226 Difference]: Without dead ends: 1581 [2021-06-05 09:11:49,871 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 265.4ms TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2021-06-05 09:11:49,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2021-06-05 09:11:49,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1286. [2021-06-05 09:11:49,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 1286 states have (on average 2.0894245723172626) internal successors, (2687), 1285 states have internal predecessors, (2687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:49,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 2687 transitions. [2021-06-05 09:11:49,893 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 2687 transitions. Word has length 65 [2021-06-05 09:11:49,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:11:49,893 INFO L482 AbstractCegarLoop]: Abstraction has 1286 states and 2687 transitions. [2021-06-05 09:11:49,893 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.5) internal successors, (99), 18 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:49,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 2687 transitions. [2021-06-05 09:11:49,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 09:11:49,895 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:11:49,895 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:11:50,121 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-06-05 09:11:50,121 INFO L430 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:11:50,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:11:50,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1133877337, now seen corresponding path program 6 times [2021-06-05 09:11:50,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:11:50,122 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894211158] [2021-06-05 09:11:50,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:11:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:11:50,233 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:11:50,234 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:11:50,234 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894211158] [2021-06-05 09:11:50,234 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894211158] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:50,234 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126032025] [2021-06-05 09:11:50,234 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:11:50,319 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 09:11:50,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:11:50,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 09:11:50,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:11:50,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:11:50,457 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:50,463 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:50,464 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:50,465 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:11:50,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:11:50,493 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:50,497 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:50,498 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:50,498 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:11:50,520 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:11:50,521 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126032025] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:50,521 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:11:50,521 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2021-06-05 09:11:50,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953470446] [2021-06-05 09:11:50,521 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 09:11:50,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:11:50,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 09:11:50,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:11:50,522 INFO L87 Difference]: Start difference. First operand 1286 states and 2687 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:50,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:11:50,910 INFO L93 Difference]: Finished difference Result 1406 states and 2938 transitions. [2021-06-05 09:11:50,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 09:11:50,910 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-06-05 09:11:50,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:11:50,913 INFO L225 Difference]: With dead ends: 1406 [2021-06-05 09:11:50,913 INFO L226 Difference]: Without dead ends: 1406 [2021-06-05 09:11:50,914 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 203.0ms TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2021-06-05 09:11:50,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2021-06-05 09:11:50,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1286. [2021-06-05 09:11:50,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 1286 states have (on average 2.0894245723172626) internal successors, (2687), 1285 states have internal predecessors, (2687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:50,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 2687 transitions. [2021-06-05 09:11:50,935 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 2687 transitions. Word has length 65 [2021-06-05 09:11:50,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:11:50,935 INFO L482 AbstractCegarLoop]: Abstraction has 1286 states and 2687 transitions. [2021-06-05 09:11:50,935 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:50,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 2687 transitions. [2021-06-05 09:11:50,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:11:50,938 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:11:50,938 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:11:51,152 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:11:51,153 INFO L430 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:11:51,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:11:51,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1605278089, now seen corresponding path program 8 times [2021-06-05 09:11:51,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:11:51,153 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886847101] [2021-06-05 09:11:51,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:11:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:11:51,292 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-05 09:11:51,292 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:11:51,292 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886847101] [2021-06-05 09:11:51,292 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886847101] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:51,292 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775216876] [2021-06-05 09:11:51,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:11:51,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 09:11:51,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:11:51,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 32 conjunts are in the unsatisfiable core [2021-06-05 09:11:51,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:11:51,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:11:51,476 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:51,481 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:51,482 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:51,483 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2021-06-05 09:11:51,538 INFO L354 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2021-06-05 09:11:51,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-06-05 09:11:51,540 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:51,546 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:51,548 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:51,548 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2021-06-05 09:11:51,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-06-05 09:11:51,569 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:51,571 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:51,571 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:51,571 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2021-06-05 09:11:51,617 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:11:51,617 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775216876] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:51,617 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:11:51,617 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2021-06-05 09:11:51,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013623336] [2021-06-05 09:11:51,618 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 09:11:51,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:11:51,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 09:11:51,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-05 09:11:51,619 INFO L87 Difference]: Start difference. First operand 1286 states and 2687 transitions. Second operand has 18 states, 18 states have (on average 7.5) internal successors, (135), 18 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:53,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:11:53,065 INFO L93 Difference]: Finished difference Result 2501 states and 5263 transitions. [2021-06-05 09:11:53,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-06-05 09:11:53,065 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.5) internal successors, (135), 18 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:11:53,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:11:53,070 INFO L225 Difference]: With dead ends: 2501 [2021-06-05 09:11:53,070 INFO L226 Difference]: Without dead ends: 2501 [2021-06-05 09:11:53,071 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1116 ImplicationChecksByTransitivity, 966.1ms TimeCoverageRelationStatistics Valid=480, Invalid=3426, Unknown=0, NotChecked=0, Total=3906 [2021-06-05 09:11:53,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2501 states. [2021-06-05 09:11:53,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2501 to 1278. [2021-06-05 09:11:53,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1278 states, 1278 states have (on average 2.0899843505477307) internal successors, (2671), 1277 states have internal predecessors, (2671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:53,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 2671 transitions. [2021-06-05 09:11:53,101 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 2671 transitions. Word has length 80 [2021-06-05 09:11:53,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:11:53,101 INFO L482 AbstractCegarLoop]: Abstraction has 1278 states and 2671 transitions. [2021-06-05 09:11:53,101 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 7.5) internal successors, (135), 18 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:53,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 2671 transitions. [2021-06-05 09:11:53,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:11:53,103 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:11:53,103 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:11:53,320 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-06-05 09:11:53,321 INFO L430 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:11:53,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:11:53,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1746986483, now seen corresponding path program 9 times [2021-06-05 09:11:53,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:11:53,321 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273721285] [2021-06-05 09:11:53,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:11:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:11:53,447 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:11:53,447 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:11:53,447 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273721285] [2021-06-05 09:11:53,447 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273721285] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:53,447 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534281148] [2021-06-05 09:11:53,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:11:53,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 09:11:53,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:11:53,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 32 conjunts are in the unsatisfiable core [2021-06-05 09:11:53,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:11:53,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:11:53,621 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:53,626 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:53,626 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:53,626 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2021-06-05 09:11:53,675 INFO L354 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2021-06-05 09:11:53,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-06-05 09:11:53,677 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:53,684 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:53,685 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:53,686 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2021-06-05 09:11:53,706 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-06-05 09:11:53,707 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:53,709 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:53,710 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:53,710 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2021-06-05 09:11:53,756 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:11:53,756 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534281148] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:53,756 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:11:53,756 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2021-06-05 09:11:53,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208151455] [2021-06-05 09:11:53,756 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 09:11:53,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:11:53,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 09:11:53,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-06-05 09:11:53,757 INFO L87 Difference]: Start difference. First operand 1278 states and 2671 transitions. Second operand has 18 states, 18 states have (on average 7.5) internal successors, (135), 18 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:55,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:11:55,180 INFO L93 Difference]: Finished difference Result 2396 states and 5025 transitions. [2021-06-05 09:11:55,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-06-05 09:11:55,186 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.5) internal successors, (135), 18 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:11:55,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:11:55,190 INFO L225 Difference]: With dead ends: 2396 [2021-06-05 09:11:55,191 INFO L226 Difference]: Without dead ends: 2396 [2021-06-05 09:11:55,192 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 896.8ms TimeCoverageRelationStatistics Valid=460, Invalid=3322, Unknown=0, NotChecked=0, Total=3782 [2021-06-05 09:11:55,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2396 states. [2021-06-05 09:11:55,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2396 to 1249. [2021-06-05 09:11:55,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1249 states have (on average 2.092073658927142) internal successors, (2613), 1248 states have internal predecessors, (2613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:55,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 2613 transitions. [2021-06-05 09:11:55,220 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 2613 transitions. Word has length 80 [2021-06-05 09:11:55,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:11:55,220 INFO L482 AbstractCegarLoop]: Abstraction has 1249 states and 2613 transitions. [2021-06-05 09:11:55,221 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 7.5) internal successors, (135), 18 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:55,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 2613 transitions. [2021-06-05 09:11:55,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:11:55,223 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:11:55,223 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:11:55,447 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:11:55,447 INFO L430 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:11:55,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:11:55,448 INFO L82 PathProgramCache]: Analyzing trace with hash -110652961, now seen corresponding path program 10 times [2021-06-05 09:11:55,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:11:55,448 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975018485] [2021-06-05 09:11:55,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:11:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:11:55,532 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:11:55,532 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:11:55,532 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975018485] [2021-06-05 09:11:55,532 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975018485] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:11:55,532 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:11:55,532 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 09:11:55,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071463309] [2021-06-05 09:11:55,533 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 09:11:55,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:11:55,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 09:11:55,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 09:11:55,534 INFO L87 Difference]: Start difference. First operand 1249 states and 2613 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:55,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:11:55,775 INFO L93 Difference]: Finished difference Result 1514 states and 3153 transitions. [2021-06-05 09:11:55,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 09:11:55,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:11:55,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:11:55,778 INFO L225 Difference]: With dead ends: 1514 [2021-06-05 09:11:55,778 INFO L226 Difference]: Without dead ends: 1514 [2021-06-05 09:11:55,778 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 93.2ms TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:11:55,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2021-06-05 09:11:55,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1253. [2021-06-05 09:11:55,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1253 states have (on average 2.0925778132482042) internal successors, (2622), 1252 states have internal predecessors, (2622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:55,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 2622 transitions. [2021-06-05 09:11:55,799 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 2622 transitions. Word has length 80 [2021-06-05 09:11:55,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:11:55,799 INFO L482 AbstractCegarLoop]: Abstraction has 1253 states and 2622 transitions. [2021-06-05 09:11:55,800 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:55,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 2622 transitions. [2021-06-05 09:11:55,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:11:55,802 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:11:55,802 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:11:55,802 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-05 09:11:55,802 INFO L430 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:11:55,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:11:55,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1569850859, now seen corresponding path program 11 times [2021-06-05 09:11:55,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:11:55,803 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251385955] [2021-06-05 09:11:55,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:11:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:11:55,945 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:11:55,945 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:11:55,945 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251385955] [2021-06-05 09:11:55,945 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251385955] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:55,945 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871005156] [2021-06-05 09:11:55,946 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:11:56,056 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:11:56,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:11:56,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 09:11:56,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:11:56,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:11:56,332 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:56,337 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:56,338 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:56,338 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2021-06-05 09:11:56,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 09:11:56,371 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:56,374 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:56,375 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:56,375 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2021-06-05 09:11:56,403 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:11:56,404 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871005156] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:56,404 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:11:56,404 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 21 [2021-06-05 09:11:56,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555528902] [2021-06-05 09:11:56,404 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 09:11:56,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:11:56,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 09:11:56,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2021-06-05 09:11:56,405 INFO L87 Difference]: Start difference. First operand 1253 states and 2622 transitions. Second operand has 21 states, 21 states have (on average 6.714285714285714) internal successors, (141), 21 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:57,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:11:57,575 INFO L93 Difference]: Finished difference Result 2254 states and 4668 transitions. [2021-06-05 09:11:57,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-06-05 09:11:57,575 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.714285714285714) internal successors, (141), 21 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:11:57,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:11:57,580 INFO L225 Difference]: With dead ends: 2254 [2021-06-05 09:11:57,580 INFO L226 Difference]: Without dead ends: 2254 [2021-06-05 09:11:57,581 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 671.4ms TimeCoverageRelationStatistics Valid=226, Invalid=1844, Unknown=0, NotChecked=0, Total=2070 [2021-06-05 09:11:57,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2021-06-05 09:11:57,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 1553. [2021-06-05 09:11:57,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1553 states, 1553 states have (on average 2.078557630392788) internal successors, (3228), 1552 states have internal predecessors, (3228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:57,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 3228 transitions. [2021-06-05 09:11:57,613 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 3228 transitions. Word has length 80 [2021-06-05 09:11:57,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:11:57,613 INFO L482 AbstractCegarLoop]: Abstraction has 1553 states and 3228 transitions. [2021-06-05 09:11:57,613 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 6.714285714285714) internal successors, (141), 21 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:57,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 3228 transitions. [2021-06-05 09:11:57,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:11:57,617 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:11:57,617 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:11:57,832 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-06-05 09:11:57,833 INFO L430 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:11:57,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:11:57,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1128770661, now seen corresponding path program 12 times [2021-06-05 09:11:57,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:11:57,833 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546174183] [2021-06-05 09:11:57,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:11:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:11:57,951 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:11:57,951 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:11:57,951 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546174183] [2021-06-05 09:11:57,951 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546174183] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:57,951 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630703879] [2021-06-05 09:11:57,951 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:11:58,042 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 09:11:58,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:11:58,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 09:11:58,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:11:58,305 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:11:58,306 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:58,311 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:58,312 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:58,312 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2021-06-05 09:11:58,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 09:11:58,343 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:11:58,346 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:11:58,347 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:11:58,347 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2021-06-05 09:11:58,376 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:11:58,376 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630703879] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:11:58,376 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:11:58,376 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 21 [2021-06-05 09:11:58,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723812765] [2021-06-05 09:11:58,377 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 09:11:58,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:11:58,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 09:11:58,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2021-06-05 09:11:58,378 INFO L87 Difference]: Start difference. First operand 1553 states and 3228 transitions. Second operand has 21 states, 21 states have (on average 6.714285714285714) internal successors, (141), 21 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:59,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:11:59,702 INFO L93 Difference]: Finished difference Result 2565 states and 5310 transitions. [2021-06-05 09:11:59,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-06-05 09:11:59,702 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.714285714285714) internal successors, (141), 21 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:11:59,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:11:59,706 INFO L225 Difference]: With dead ends: 2565 [2021-06-05 09:11:59,706 INFO L226 Difference]: Without dead ends: 2565 [2021-06-05 09:11:59,707 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 794.0ms TimeCoverageRelationStatistics Valid=238, Invalid=1924, Unknown=0, NotChecked=0, Total=2162 [2021-06-05 09:11:59,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2021-06-05 09:11:59,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1655. [2021-06-05 09:11:59,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1655 states have (on average 2.0779456193353476) internal successors, (3439), 1654 states have internal predecessors, (3439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:59,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 3439 transitions. [2021-06-05 09:11:59,738 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 3439 transitions. Word has length 80 [2021-06-05 09:11:59,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:11:59,738 INFO L482 AbstractCegarLoop]: Abstraction has 1655 states and 3439 transitions. [2021-06-05 09:11:59,739 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 6.714285714285714) internal successors, (141), 21 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:11:59,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 3439 transitions. [2021-06-05 09:11:59,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:11:59,741 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:11:59,741 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:11:59,965 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-06-05 09:11:59,966 INFO L430 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:11:59,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:11:59,966 INFO L82 PathProgramCache]: Analyzing trace with hash -2008611912, now seen corresponding path program 1 times [2021-06-05 09:11:59,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:11:59,966 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012630979] [2021-06-05 09:11:59,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:11:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:00,049 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:12:00,050 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:00,050 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012630979] [2021-06-05 09:12:00,050 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012630979] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:12:00,050 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:12:00,050 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 09:12:00,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390571370] [2021-06-05 09:12:00,050 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 09:12:00,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:00,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 09:12:00,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 09:12:00,051 INFO L87 Difference]: Start difference. First operand 1655 states and 3439 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:00,294 INFO L93 Difference]: Finished difference Result 1728 states and 3574 transitions. [2021-06-05 09:12:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 09:12:00,295 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:12:00,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:00,298 INFO L225 Difference]: With dead ends: 1728 [2021-06-05 09:12:00,298 INFO L226 Difference]: Without dead ends: 1728 [2021-06-05 09:12:00,298 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 79.8ms TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:12:00,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2021-06-05 09:12:00,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1537. [2021-06-05 09:12:00,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1537 states, 1537 states have (on average 2.0793754066363044) internal successors, (3196), 1536 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:00,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 3196 transitions. [2021-06-05 09:12:00,321 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 3196 transitions. Word has length 80 [2021-06-05 09:12:00,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:00,321 INFO L482 AbstractCegarLoop]: Abstraction has 1537 states and 3196 transitions. [2021-06-05 09:12:00,321 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:00,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 3196 transitions. [2021-06-05 09:12:00,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:12:00,323 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:00,323 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:00,323 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-05 09:12:00,323 INFO L430 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:00,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:00,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1163952444, now seen corresponding path program 2 times [2021-06-05 09:12:00,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:00,324 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149091285] [2021-06-05 09:12:00,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:00,397 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:12:00,397 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:00,397 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149091285] [2021-06-05 09:12:00,397 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149091285] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:12:00,397 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:12:00,397 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 09:12:00,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345319202] [2021-06-05 09:12:00,398 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 09:12:00,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:00,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 09:12:00,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 09:12:00,399 INFO L87 Difference]: Start difference. First operand 1537 states and 3196 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:00,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:00,654 INFO L93 Difference]: Finished difference Result 1877 states and 3902 transitions. [2021-06-05 09:12:00,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:12:00,654 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:12:00,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:00,658 INFO L225 Difference]: With dead ends: 1877 [2021-06-05 09:12:00,658 INFO L226 Difference]: Without dead ends: 1877 [2021-06-05 09:12:00,658 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 87.8ms TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:12:00,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2021-06-05 09:12:00,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1533. [2021-06-05 09:12:00,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1533 states have (on average 2.0789302022178733) internal successors, (3187), 1532 states have internal predecessors, (3187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:00,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 3187 transitions. [2021-06-05 09:12:00,688 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 3187 transitions. Word has length 80 [2021-06-05 09:12:00,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:00,688 INFO L482 AbstractCegarLoop]: Abstraction has 1533 states and 3187 transitions. [2021-06-05 09:12:00,688 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:00,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 3187 transitions. [2021-06-05 09:12:00,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:12:00,690 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:00,690 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:00,691 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-05 09:12:00,691 INFO L430 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:00,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:00,691 INFO L82 PathProgramCache]: Analyzing trace with hash 588596936, now seen corresponding path program 3 times [2021-06-05 09:12:00,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:00,691 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728717302] [2021-06-05 09:12:00,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:00,774 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:12:00,774 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:00,774 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728717302] [2021-06-05 09:12:00,774 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728717302] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:12:00,774 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:12:00,774 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 09:12:00,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529291792] [2021-06-05 09:12:00,775 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 09:12:00,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:00,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 09:12:00,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 09:12:00,775 INFO L87 Difference]: Start difference. First operand 1533 states and 3187 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:00,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:00,995 INFO L93 Difference]: Finished difference Result 1729 states and 3588 transitions. [2021-06-05 09:12:00,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 09:12:00,996 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:12:00,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:00,999 INFO L225 Difference]: With dead ends: 1729 [2021-06-05 09:12:00,999 INFO L226 Difference]: Without dead ends: 1729 [2021-06-05 09:12:00,999 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 96.0ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:12:01,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2021-06-05 09:12:01,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1519. [2021-06-05 09:12:01,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1519 states, 1519 states have (on average 2.071757735352205) internal successors, (3147), 1518 states have internal predecessors, (3147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:01,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 3147 transitions. [2021-06-05 09:12:01,023 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 3147 transitions. Word has length 80 [2021-06-05 09:12:01,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:01,023 INFO L482 AbstractCegarLoop]: Abstraction has 1519 states and 3147 transitions. [2021-06-05 09:12:01,023 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:01,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 3147 transitions. [2021-06-05 09:12:01,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:12:01,025 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:01,026 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:01,026 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-05 09:12:01,026 INFO L430 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:01,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:01,026 INFO L82 PathProgramCache]: Analyzing trace with hash -984639304, now seen corresponding path program 4 times [2021-06-05 09:12:01,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:01,027 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911778033] [2021-06-05 09:12:01,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:01,148 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 09:12:01,148 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:01,148 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911778033] [2021-06-05 09:12:01,149 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911778033] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:01,149 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209945663] [2021-06-05 09:12:01,149 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:01,253 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:12:01,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:12:01,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 09:12:01,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:01,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:12:01,503 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:01,508 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:01,508 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:01,509 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2021-06-05 09:12:01,536 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 09:12:01,537 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:01,539 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:01,540 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:01,540 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2021-06-05 09:12:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:12:01,567 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209945663] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:01,567 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:12:01,567 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 21 [2021-06-05 09:12:01,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320181923] [2021-06-05 09:12:01,567 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 09:12:01,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:01,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 09:12:01,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2021-06-05 09:12:01,568 INFO L87 Difference]: Start difference. First operand 1519 states and 3147 transitions. Second operand has 21 states, 21 states have (on average 6.714285714285714) internal successors, (141), 21 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:02,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:02,683 INFO L93 Difference]: Finished difference Result 2306 states and 4759 transitions. [2021-06-05 09:12:02,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-06-05 09:12:02,683 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.714285714285714) internal successors, (141), 21 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:12:02,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:02,687 INFO L225 Difference]: With dead ends: 2306 [2021-06-05 09:12:02,687 INFO L226 Difference]: Without dead ends: 2306 [2021-06-05 09:12:02,688 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 721.2ms TimeCoverageRelationStatistics Valid=223, Invalid=1757, Unknown=0, NotChecked=0, Total=1980 [2021-06-05 09:12:02,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2021-06-05 09:12:02,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 1557. [2021-06-05 09:12:02,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1557 states have (on average 2.067437379576108) internal successors, (3219), 1556 states have internal predecessors, (3219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:02,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 3219 transitions. [2021-06-05 09:12:02,713 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 3219 transitions. Word has length 80 [2021-06-05 09:12:02,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:02,714 INFO L482 AbstractCegarLoop]: Abstraction has 1557 states and 3219 transitions. [2021-06-05 09:12:02,714 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 6.714285714285714) internal successors, (141), 21 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:02,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 3219 transitions. [2021-06-05 09:12:02,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:12:02,716 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:02,716 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:02,942 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-06-05 09:12:02,943 INFO L430 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:02,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:02,943 INFO L82 PathProgramCache]: Analyzing trace with hash -213290548, now seen corresponding path program 5 times [2021-06-05 09:12:02,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:02,943 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999658753] [2021-06-05 09:12:02,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:03,076 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:12:03,076 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:03,076 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999658753] [2021-06-05 09:12:03,076 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999658753] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:03,076 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254040462] [2021-06-05 09:12:03,077 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:03,206 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:12:03,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:12:03,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 38 conjunts are in the unsatisfiable core [2021-06-05 09:12:03,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:03,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 09:12:03,433 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:03,452 INFO L628 ElimStorePlain]: treesize reduction 4, result has 90.5 percent of original size [2021-06-05 09:12:03,454 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:03,455 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:41 [2021-06-05 09:12:03,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:12:03,490 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:03,493 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:03,494 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:03,494 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:12:03,518 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:12:03,518 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254040462] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:03,518 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:12:03,518 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 19 [2021-06-05 09:12:03,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555271542] [2021-06-05 09:12:03,519 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 09:12:03,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:03,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 09:12:03,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 09:12:03,519 INFO L87 Difference]: Start difference. First operand 1557 states and 3219 transitions. Second operand has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 19 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:04,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:04,139 INFO L93 Difference]: Finished difference Result 2325 states and 4814 transitions. [2021-06-05 09:12:04,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 09:12:04,139 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 19 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:12:04,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:04,143 INFO L225 Difference]: With dead ends: 2325 [2021-06-05 09:12:04,143 INFO L226 Difference]: Without dead ends: 2325 [2021-06-05 09:12:04,144 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 355.3ms TimeCoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2021-06-05 09:12:04,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2021-06-05 09:12:04,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 1670. [2021-06-05 09:12:04,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1670 states have (on average 2.068862275449102) internal successors, (3455), 1669 states have internal predecessors, (3455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 3455 transitions. [2021-06-05 09:12:04,171 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 3455 transitions. Word has length 80 [2021-06-05 09:12:04,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:04,171 INFO L482 AbstractCegarLoop]: Abstraction has 1670 states and 3455 transitions. [2021-06-05 09:12:04,171 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 19 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:04,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 3455 transitions. [2021-06-05 09:12:04,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:12:04,173 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:04,173 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:04,392 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-06-05 09:12:04,393 INFO L430 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:04,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:04,393 INFO L82 PathProgramCache]: Analyzing trace with hash -419082640, now seen corresponding path program 6 times [2021-06-05 09:12:04,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:04,393 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120236594] [2021-06-05 09:12:04,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:04,516 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:12:04,516 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:04,516 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120236594] [2021-06-05 09:12:04,516 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120236594] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:04,516 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892703692] [2021-06-05 09:12:04,517 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:04,595 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-06-05 09:12:04,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:12:04,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 09:12:04,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:04,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:12:04,710 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:04,718 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:04,719 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:04,719 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2021-06-05 09:12:04,774 INFO L354 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-06-05 09:12:04,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2021-06-05 09:12:04,776 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:04,786 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:04,788 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:12:04,788 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2021-06-05 09:12:04,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-06-05 09:12:04,847 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:04,851 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-06-05 09:12:04,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2021-06-05 09:12:04,852 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:04,854 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:04,854 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:04,854 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:5 [2021-06-05 09:12:04,901 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 09:12:04,901 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892703692] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:12:04,901 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:12:04,901 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2021-06-05 09:12:04,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982871062] [2021-06-05 09:12:04,902 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 09:12:04,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:04,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 09:12:04,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2021-06-05 09:12:04,902 INFO L87 Difference]: Start difference. First operand 1670 states and 3455 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:05,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:05,172 INFO L93 Difference]: Finished difference Result 1840 states and 3809 transitions. [2021-06-05 09:12:05,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:12:05,172 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:12:05,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:05,175 INFO L225 Difference]: With dead ends: 1840 [2021-06-05 09:12:05,175 INFO L226 Difference]: Without dead ends: 1840 [2021-06-05 09:12:05,175 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 269.4ms TimeCoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2021-06-05 09:12:05,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2021-06-05 09:12:05,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1674. [2021-06-05 09:12:05,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1674 states have (on average 2.07168458781362) internal successors, (3468), 1673 states have internal predecessors, (3468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:05,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 3468 transitions. [2021-06-05 09:12:05,199 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 3468 transitions. Word has length 80 [2021-06-05 09:12:05,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:05,199 INFO L482 AbstractCegarLoop]: Abstraction has 1674 states and 3468 transitions. [2021-06-05 09:12:05,199 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:05,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 3468 transitions. [2021-06-05 09:12:05,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:12:05,201 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:05,201 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:05,420 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-06-05 09:12:05,421 INFO L430 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:05,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:05,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1992318880, now seen corresponding path program 7 times [2021-06-05 09:12:05,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:05,421 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242006079] [2021-06-05 09:12:05,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:05,547 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:12:05,547 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:05,547 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242006079] [2021-06-05 09:12:05,548 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242006079] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:05,548 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668221510] [2021-06-05 09:12:05,548 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:05,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 09:12:05,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:05,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:12:05,849 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:05,856 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:05,857 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:05,858 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:12:05,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:12:05,884 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:05,888 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:05,889 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:05,889 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:12:05,917 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:12:05,917 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668221510] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:05,917 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:12:05,917 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 19 [2021-06-05 09:12:05,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419126680] [2021-06-05 09:12:05,918 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 09:12:05,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:05,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 09:12:05,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 09:12:05,918 INFO L87 Difference]: Start difference. First operand 1674 states and 3468 transitions. Second operand has 19 states, 19 states have (on average 6.052631578947368) internal successors, (115), 19 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:06,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:06,561 INFO L93 Difference]: Finished difference Result 2245 states and 4662 transitions. [2021-06-05 09:12:06,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 09:12:06,561 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.052631578947368) internal successors, (115), 19 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:12:06,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:06,563 INFO L225 Difference]: With dead ends: 2245 [2021-06-05 09:12:06,563 INFO L226 Difference]: Without dead ends: 2245 [2021-06-05 09:12:06,564 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 378.7ms TimeCoverageRelationStatistics Valid=130, Invalid=926, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 09:12:06,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2021-06-05 09:12:06,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 1629. [2021-06-05 09:12:06,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1629 states, 1629 states have (on average 2.0705954573357888) internal successors, (3373), 1628 states have internal predecessors, (3373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:06,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 3373 transitions. [2021-06-05 09:12:06,591 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 3373 transitions. Word has length 80 [2021-06-05 09:12:06,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:06,591 INFO L482 AbstractCegarLoop]: Abstraction has 1629 states and 3373 transitions. [2021-06-05 09:12:06,592 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 6.052631578947368) internal successors, (115), 19 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:06,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 3373 transitions. [2021-06-05 09:12:06,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:12:06,594 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:06,594 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:06,816 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:06,817 INFO L430 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:06,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:06,817 INFO L82 PathProgramCache]: Analyzing trace with hash -102426706, now seen corresponding path program 8 times [2021-06-05 09:12:06,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:06,818 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051180651] [2021-06-05 09:12:06,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:06,953 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 09:12:06,953 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:06,953 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051180651] [2021-06-05 09:12:06,953 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051180651] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:06,953 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67227010] [2021-06-05 09:12:06,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:07,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:12:07,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:12:07,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 09:12:07,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:07,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:12:07,312 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:07,316 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:07,320 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:07,321 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2021-06-05 09:12:07,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 09:12:07,355 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:07,357 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:07,358 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:07,358 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2021-06-05 09:12:07,391 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:12:07,391 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67227010] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:07,391 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:12:07,391 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 21 [2021-06-05 09:12:07,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870466464] [2021-06-05 09:12:07,392 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 09:12:07,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:07,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 09:12:07,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2021-06-05 09:12:07,392 INFO L87 Difference]: Start difference. First operand 1629 states and 3373 transitions. Second operand has 21 states, 21 states have (on average 6.714285714285714) internal successors, (141), 21 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:08,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:08,564 INFO L93 Difference]: Finished difference Result 2511 states and 5186 transitions. [2021-06-05 09:12:08,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-06-05 09:12:08,565 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.714285714285714) internal successors, (141), 21 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:12:08,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:08,567 INFO L225 Difference]: With dead ends: 2511 [2021-06-05 09:12:08,567 INFO L226 Difference]: Without dead ends: 2511 [2021-06-05 09:12:08,567 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 636.4ms TimeCoverageRelationStatistics Valid=216, Invalid=1764, Unknown=0, NotChecked=0, Total=1980 [2021-06-05 09:12:08,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2511 states. [2021-06-05 09:12:08,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2511 to 1721. [2021-06-05 09:12:08,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1721 states, 1721 states have (on average 2.0679837303893085) internal successors, (3559), 1720 states have internal predecessors, (3559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:08,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 3559 transitions. [2021-06-05 09:12:08,587 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 3559 transitions. Word has length 80 [2021-06-05 09:12:08,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:08,587 INFO L482 AbstractCegarLoop]: Abstraction has 1721 states and 3559 transitions. [2021-06-05 09:12:08,587 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 6.714285714285714) internal successors, (141), 21 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:08,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 3559 transitions. [2021-06-05 09:12:08,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:12:08,589 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:08,589 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:08,813 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-06-05 09:12:08,813 INFO L430 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:08,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:08,813 INFO L82 PathProgramCache]: Analyzing trace with hash -954175388, now seen corresponding path program 9 times [2021-06-05 09:12:08,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:08,813 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29828130] [2021-06-05 09:12:08,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:08,942 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:12:08,942 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:08,942 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29828130] [2021-06-05 09:12:08,942 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29828130] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:08,942 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822848020] [2021-06-05 09:12:08,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:09,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 09:12:09,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:12:09,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 09:12:09,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:09,119 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:12:09,120 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:09,124 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:09,124 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:09,125 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2021-06-05 09:12:09,188 INFO L354 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-06-05 09:12:09,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2021-06-05 09:12:09,190 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:09,200 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:09,206 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:09,207 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:13 [2021-06-05 09:12:09,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-06-05 09:12:09,235 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:09,237 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:09,237 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:09,237 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2021-06-05 09:12:09,282 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 09:12:09,282 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822848020] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:12:09,283 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:12:09,283 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2021-06-05 09:12:09,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858165684] [2021-06-05 09:12:09,284 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 09:12:09,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:09,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 09:12:09,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-06-05 09:12:09,285 INFO L87 Difference]: Start difference. First operand 1721 states and 3559 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:09,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:09,501 INFO L93 Difference]: Finished difference Result 1904 states and 3942 transitions. [2021-06-05 09:12:09,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:12:09,501 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:12:09,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:09,503 INFO L225 Difference]: With dead ends: 1904 [2021-06-05 09:12:09,504 INFO L226 Difference]: Without dead ends: 1904 [2021-06-05 09:12:09,504 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 231.9ms TimeCoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2021-06-05 09:12:09,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2021-06-05 09:12:09,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1729. [2021-06-05 09:12:09,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1729 states, 1729 states have (on average 2.0711393869288606) internal successors, (3581), 1728 states have internal predecessors, (3581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 3581 transitions. [2021-06-05 09:12:09,524 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 3581 transitions. Word has length 80 [2021-06-05 09:12:09,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:09,524 INFO L482 AbstractCegarLoop]: Abstraction has 1729 states and 3581 transitions. [2021-06-05 09:12:09,524 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:09,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 3581 transitions. [2021-06-05 09:12:09,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:12:09,526 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:09,527 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:09,740 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:09,741 INFO L430 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:09,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:09,741 INFO L82 PathProgramCache]: Analyzing trace with hash 930405806, now seen corresponding path program 10 times [2021-06-05 09:12:09,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:09,741 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942628708] [2021-06-05 09:12:09,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:09,892 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:12:09,893 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:09,893 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942628708] [2021-06-05 09:12:09,893 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942628708] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:09,893 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742672289] [2021-06-05 09:12:09,893 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:09,976 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:12:09,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:12:09,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 09:12:09,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:10,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:12:10,167 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:10,173 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:10,174 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:10,174 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:12:10,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:12:10,208 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:10,213 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:10,214 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:10,214 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:12:10,240 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:12:10,240 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742672289] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:10,240 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:12:10,240 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 19 [2021-06-05 09:12:10,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682804195] [2021-06-05 09:12:10,241 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 09:12:10,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:10,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 09:12:10,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-06-05 09:12:10,242 INFO L87 Difference]: Start difference. First operand 1729 states and 3581 transitions. Second operand has 19 states, 19 states have (on average 5.7368421052631575) internal successors, (109), 19 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:10,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:10,862 INFO L93 Difference]: Finished difference Result 2666 states and 5532 transitions. [2021-06-05 09:12:10,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-06-05 09:12:10,862 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.7368421052631575) internal successors, (109), 19 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:12:10,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:10,864 INFO L225 Difference]: With dead ends: 2666 [2021-06-05 09:12:10,864 INFO L226 Difference]: Without dead ends: 2666 [2021-06-05 09:12:10,865 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 470.9ms TimeCoverageRelationStatistics Valid=167, Invalid=1239, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 09:12:10,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2021-06-05 09:12:10,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 1858. [2021-06-05 09:12:10,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1858 states have (on average 2.0731969860064585) internal successors, (3852), 1857 states have internal predecessors, (3852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:10,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 3852 transitions. [2021-06-05 09:12:10,888 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 3852 transitions. Word has length 80 [2021-06-05 09:12:10,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:10,889 INFO L482 AbstractCegarLoop]: Abstraction has 1858 states and 3852 transitions. [2021-06-05 09:12:10,889 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 5.7368421052631575) internal successors, (109), 19 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:10,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 3852 transitions. [2021-06-05 09:12:10,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:12:10,891 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:10,891 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:11,112 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-06-05 09:12:11,113 INFO L430 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:11,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:11,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1561763576, now seen corresponding path program 11 times [2021-06-05 09:12:11,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:11,113 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114272101] [2021-06-05 09:12:11,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:12:11,248 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:11,248 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114272101] [2021-06-05 09:12:11,249 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114272101] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:11,249 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963430775] [2021-06-05 09:12:11,249 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:11,344 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:12:11,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:12:11,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 53 conjunts are in the unsatisfiable core [2021-06-05 09:12:11,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:11,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:12:11,533 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:11,541 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:11,542 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:11,543 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2021-06-05 09:12:11,610 INFO L354 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2021-06-05 09:12:11,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 38 [2021-06-05 09:12:11,612 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:11,634 INFO L628 ElimStorePlain]: treesize reduction 10, result has 82.5 percent of original size [2021-06-05 09:12:11,636 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:11,636 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:30 [2021-06-05 09:12:11,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2021-06-05 09:12:11,663 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:11,668 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:11,669 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:11,669 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:15 [2021-06-05 09:12:11,720 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:12:11,720 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963430775] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:11,720 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:12:11,721 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 22 [2021-06-05 09:12:11,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701924328] [2021-06-05 09:12:11,721 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 09:12:11,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:11,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 09:12:11,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2021-06-05 09:12:11,722 INFO L87 Difference]: Start difference. First operand 1858 states and 3852 transitions. Second operand has 22 states, 22 states have (on average 4.818181818181818) internal successors, (106), 22 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:12,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:12,618 INFO L93 Difference]: Finished difference Result 2417 states and 5000 transitions. [2021-06-05 09:12:12,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 09:12:12,618 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.818181818181818) internal successors, (106), 22 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:12:12,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:12,620 INFO L225 Difference]: With dead ends: 2417 [2021-06-05 09:12:12,620 INFO L226 Difference]: Without dead ends: 2417 [2021-06-05 09:12:12,621 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 529.9ms TimeCoverageRelationStatistics Valid=175, Invalid=1547, Unknown=0, NotChecked=0, Total=1722 [2021-06-05 09:12:12,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2021-06-05 09:12:12,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 1817. [2021-06-05 09:12:12,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1817 states, 1817 states have (on average 2.0709961474958725) internal successors, (3763), 1816 states have internal predecessors, (3763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:12,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 3763 transitions. [2021-06-05 09:12:12,639 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 3763 transitions. Word has length 80 [2021-06-05 09:12:12,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:12,639 INFO L482 AbstractCegarLoop]: Abstraction has 1817 states and 3763 transitions. [2021-06-05 09:12:12,639 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 4.818181818181818) internal successors, (106), 22 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:12,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 3763 transitions. [2021-06-05 09:12:12,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:12:12,641 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:12,641 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:12,864 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-06-05 09:12:12,864 INFO L430 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:12,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:12,864 INFO L82 PathProgramCache]: Analyzing trace with hash -425591082, now seen corresponding path program 12 times [2021-06-05 09:12:12,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:12,865 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102923663] [2021-06-05 09:12:12,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:12,959 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:12:12,960 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:12,960 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102923663] [2021-06-05 09:12:12,960 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102923663] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:12,961 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128534467] [2021-06-05 09:12:12,961 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:13,027 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 09:12:13,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:12:13,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 09:12:13,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:13,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:12:13,282 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:13,286 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:13,287 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:13,287 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2021-06-05 09:12:13,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 09:12:13,312 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:13,316 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:13,316 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:13,316 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2021-06-05 09:12:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:12:13,341 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128534467] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:13,341 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:12:13,341 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 22 [2021-06-05 09:12:13,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070214812] [2021-06-05 09:12:13,341 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 09:12:13,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:13,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 09:12:13,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2021-06-05 09:12:13,343 INFO L87 Difference]: Start difference. First operand 1817 states and 3763 transitions. Second operand has 22 states, 22 states have (on average 6.5) internal successors, (143), 22 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:14,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:14,734 INFO L93 Difference]: Finished difference Result 3037 states and 6285 transitions. [2021-06-05 09:12:14,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-06-05 09:12:14,735 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.5) internal successors, (143), 22 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:12:14,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:14,737 INFO L225 Difference]: With dead ends: 3037 [2021-06-05 09:12:14,737 INFO L226 Difference]: Without dead ends: 3037 [2021-06-05 09:12:14,738 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 803.0ms TimeCoverageRelationStatistics Valid=310, Invalid=2660, Unknown=0, NotChecked=0, Total=2970 [2021-06-05 09:12:14,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3037 states. [2021-06-05 09:12:14,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3037 to 1946. [2021-06-05 09:12:14,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1946 states, 1946 states have (on average 2.0719424460431655) internal successors, (4032), 1945 states have internal predecessors, (4032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:14,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 4032 transitions. [2021-06-05 09:12:14,768 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 4032 transitions. Word has length 80 [2021-06-05 09:12:14,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:14,768 INFO L482 AbstractCegarLoop]: Abstraction has 1946 states and 4032 transitions. [2021-06-05 09:12:14,768 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 6.5) internal successors, (143), 22 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:14,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 4032 transitions. [2021-06-05 09:12:14,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:12:14,770 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:14,770 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:14,993 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-06-05 09:12:14,993 INFO L430 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:14,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:14,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1743629380, now seen corresponding path program 13 times [2021-06-05 09:12:14,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:14,993 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053735389] [2021-06-05 09:12:14,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:15,205 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:12:15,206 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:15,206 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053735389] [2021-06-05 09:12:15,206 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053735389] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:15,206 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510407274] [2021-06-05 09:12:15,206 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:15,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 09:12:15,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:15,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:12:15,475 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:15,480 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:15,481 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:15,481 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:12:15,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:12:15,520 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:15,524 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:15,525 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:15,525 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:12:15,549 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:12:15,550 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510407274] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:15,550 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:12:15,550 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 19 [2021-06-05 09:12:15,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819387614] [2021-06-05 09:12:15,550 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 09:12:15,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:15,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 09:12:15,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 09:12:15,551 INFO L87 Difference]: Start difference. First operand 1946 states and 4032 transitions. Second operand has 19 states, 19 states have (on average 5.7368421052631575) internal successors, (109), 19 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:16,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:16,206 INFO L93 Difference]: Finished difference Result 2673 states and 5555 transitions. [2021-06-05 09:12:16,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 09:12:16,207 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.7368421052631575) internal successors, (109), 19 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:12:16,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:16,209 INFO L225 Difference]: With dead ends: 2673 [2021-06-05 09:12:16,209 INFO L226 Difference]: Without dead ends: 2673 [2021-06-05 09:12:16,209 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 397.8ms TimeCoverageRelationStatistics Valid=162, Invalid=1098, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 09:12:16,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2021-06-05 09:12:16,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2115. [2021-06-05 09:12:16,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2115 states, 2115 states have (on average 2.074231678486998) internal successors, (4387), 2114 states have internal predecessors, (4387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:16,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 4387 transitions. [2021-06-05 09:12:16,228 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 4387 transitions. Word has length 80 [2021-06-05 09:12:16,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:16,229 INFO L482 AbstractCegarLoop]: Abstraction has 2115 states and 4387 transitions. [2021-06-05 09:12:16,229 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 5.7368421052631575) internal successors, (109), 19 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:16,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 4387 transitions. [2021-06-05 09:12:16,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:12:16,231 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:16,231 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:16,431 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-06-05 09:12:16,431 INFO L430 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:16,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:16,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1919980146, now seen corresponding path program 14 times [2021-06-05 09:12:16,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:16,432 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679933871] [2021-06-05 09:12:16,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:16,567 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:12:16,567 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:16,567 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679933871] [2021-06-05 09:12:16,567 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679933871] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:16,567 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386788206] [2021-06-05 09:12:16,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:16,634 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 09:12:16,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:12:16,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 09:12:16,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:16,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:12:16,729 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:16,732 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:16,733 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:16,733 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2021-06-05 09:12:16,795 INFO L354 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-06-05 09:12:16,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2021-06-05 09:12:16,798 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:16,805 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:16,807 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:12:16,807 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:27 [2021-06-05 09:12:16,895 INFO L354 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2021-06-05 09:12:16,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 23 [2021-06-05 09:12:16,897 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:16,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-06-05 09:12:16,900 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:16,906 INFO L628 ElimStorePlain]: treesize reduction 16, result has 23.8 percent of original size [2021-06-05 09:12:16,907 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:16,907 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:5 [2021-06-05 09:12:16,947 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 09:12:16,947 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386788206] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:12:16,948 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:12:16,948 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2021-06-05 09:12:16,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576055903] [2021-06-05 09:12:16,948 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 09:12:16,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:16,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 09:12:16,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-06-05 09:12:16,949 INFO L87 Difference]: Start difference. First operand 2115 states and 4387 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:17,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:17,209 INFO L93 Difference]: Finished difference Result 2292 states and 4743 transitions. [2021-06-05 09:12:17,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:12:17,209 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:12:17,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:17,211 INFO L225 Difference]: With dead ends: 2292 [2021-06-05 09:12:17,211 INFO L226 Difference]: Without dead ends: 2292 [2021-06-05 09:12:17,212 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 271.7ms TimeCoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2021-06-05 09:12:17,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2292 states. [2021-06-05 09:12:17,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2292 to 2100. [2021-06-05 09:12:17,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2100 states have (on average 2.0714285714285716) internal successors, (4350), 2099 states have internal predecessors, (4350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 4350 transitions. [2021-06-05 09:12:17,234 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 4350 transitions. Word has length 80 [2021-06-05 09:12:17,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:17,234 INFO L482 AbstractCegarLoop]: Abstraction has 2100 states and 4350 transitions. [2021-06-05 09:12:17,234 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:17,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 4350 transitions. [2021-06-05 09:12:17,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:12:17,236 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:17,236 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:17,456 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-06-05 09:12:17,457 INFO L430 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:17,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:17,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1884076286, now seen corresponding path program 15 times [2021-06-05 09:12:17,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:17,457 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874857669] [2021-06-05 09:12:17,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:12:17,583 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:17,583 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874857669] [2021-06-05 09:12:17,583 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874857669] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:17,583 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685088154] [2021-06-05 09:12:17,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:17,659 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 09:12:17,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:12:17,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 09:12:17,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:17,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:12:17,750 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:17,753 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:17,754 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:17,754 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2021-06-05 09:12:17,807 INFO L354 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-06-05 09:12:17,807 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2021-06-05 09:12:17,809 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:17,816 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:17,818 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:12:17,818 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2021-06-05 09:12:17,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 09:12:17,907 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:17,910 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-06-05 09:12:17,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2021-06-05 09:12:17,911 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:17,913 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:17,913 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:17,913 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:56, output treesize:9 [2021-06-05 09:12:17,940 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 09:12:17,941 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685088154] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:12:17,941 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:12:17,941 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2021-06-05 09:12:17,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525492586] [2021-06-05 09:12:17,941 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 09:12:17,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:17,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 09:12:17,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-06-05 09:12:17,942 INFO L87 Difference]: Start difference. First operand 2100 states and 4350 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:18,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:18,330 INFO L93 Difference]: Finished difference Result 2234 states and 4613 transitions. [2021-06-05 09:12:18,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 09:12:18,331 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:12:18,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:18,333 INFO L225 Difference]: With dead ends: 2234 [2021-06-05 09:12:18,333 INFO L226 Difference]: Without dead ends: 2234 [2021-06-05 09:12:18,334 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 372.6ms TimeCoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2021-06-05 09:12:18,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2021-06-05 09:12:18,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 2006. [2021-06-05 09:12:18,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2006 states, 2006 states have (on average 2.0712861415752744) internal successors, (4155), 2005 states have internal predecessors, (4155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:18,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 4155 transitions. [2021-06-05 09:12:18,353 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 4155 transitions. Word has length 80 [2021-06-05 09:12:18,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:18,354 INFO L482 AbstractCegarLoop]: Abstraction has 2006 states and 4155 transitions. [2021-06-05 09:12:18,354 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:18,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 4155 transitions. [2021-06-05 09:12:18,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:12:18,356 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:18,356 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:18,559 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:18,559 INFO L430 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:18,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:18,559 INFO L82 PathProgramCache]: Analyzing trace with hash -424983062, now seen corresponding path program 16 times [2021-06-05 09:12:18,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:18,559 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402543823] [2021-06-05 09:12:18,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:18,709 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:12:18,709 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:18,709 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402543823] [2021-06-05 09:12:18,709 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402543823] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:18,709 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460161657] [2021-06-05 09:12:18,709 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:18,789 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:12:18,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:12:18,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 09:12:18,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:18,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:12:18,963 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:18,969 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:18,970 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:18,970 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:12:18,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:12:18,992 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:18,995 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:18,996 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:18,996 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:12:19,023 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:12:19,023 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460161657] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:19,023 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:12:19,024 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 19 [2021-06-05 09:12:19,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393916376] [2021-06-05 09:12:19,024 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 09:12:19,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:19,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 09:12:19,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 09:12:19,025 INFO L87 Difference]: Start difference. First operand 2006 states and 4155 transitions. Second operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 19 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:19,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:19,881 INFO L93 Difference]: Finished difference Result 2483 states and 5153 transitions. [2021-06-05 09:12:19,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 09:12:19,882 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 19 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:12:19,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:19,884 INFO L225 Difference]: With dead ends: 2483 [2021-06-05 09:12:19,884 INFO L226 Difference]: Without dead ends: 2483 [2021-06-05 09:12:19,885 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 464.4ms TimeCoverageRelationStatistics Valid=145, Invalid=1045, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 09:12:19,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2021-06-05 09:12:19,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 1886. [2021-06-05 09:12:19,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1886 states have (on average 2.069459172852598) internal successors, (3903), 1885 states have internal predecessors, (3903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:19,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 3903 transitions. [2021-06-05 09:12:19,906 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 3903 transitions. Word has length 80 [2021-06-05 09:12:19,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:19,907 INFO L482 AbstractCegarLoop]: Abstraction has 1886 states and 3903 transitions. [2021-06-05 09:12:19,907 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 19 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:19,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 3903 transitions. [2021-06-05 09:12:19,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:12:19,908 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:19,908 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:20,109 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:20,109 INFO L430 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:20,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:20,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1591961928, now seen corresponding path program 17 times [2021-06-05 09:12:20,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:20,109 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250040201] [2021-06-05 09:12:20,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:20,254 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:12:20,254 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:20,254 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250040201] [2021-06-05 09:12:20,254 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250040201] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:20,254 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776777505] [2021-06-05 09:12:20,254 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:20,382 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:12:20,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:12:20,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 09:12:20,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:20,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:12:20,567 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:20,574 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:20,575 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:20,575 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:12:20,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:12:20,601 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:20,605 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:20,606 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:20,606 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:12:20,633 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:12:20,633 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776777505] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:20,634 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:12:20,634 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 19 [2021-06-05 09:12:20,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484453873] [2021-06-05 09:12:20,634 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 09:12:20,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:20,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 09:12:20,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 09:12:20,635 INFO L87 Difference]: Start difference. First operand 1886 states and 3903 transitions. Second operand has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:21,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:21,270 INFO L93 Difference]: Finished difference Result 2427 states and 5037 transitions. [2021-06-05 09:12:21,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 09:12:21,270 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:12:21,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:21,272 INFO L225 Difference]: With dead ends: 2427 [2021-06-05 09:12:21,272 INFO L226 Difference]: Without dead ends: 2427 [2021-06-05 09:12:21,272 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 374.4ms TimeCoverageRelationStatistics Valid=134, Invalid=858, Unknown=0, NotChecked=0, Total=992 [2021-06-05 09:12:21,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2427 states. [2021-06-05 09:12:21,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2427 to 1910. [2021-06-05 09:12:21,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1910 states, 1910 states have (on average 2.0717277486910994) internal successors, (3957), 1909 states have internal predecessors, (3957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:21,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 3957 transitions. [2021-06-05 09:12:21,290 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 3957 transitions. Word has length 80 [2021-06-05 09:12:21,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:21,290 INFO L482 AbstractCegarLoop]: Abstraction has 1910 states and 3957 transitions. [2021-06-05 09:12:21,291 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:21,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 3957 transitions. [2021-06-05 09:12:21,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:12:21,292 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:21,292 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:21,496 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2021-06-05 09:12:21,497 INFO L430 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:21,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:21,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1851341300, now seen corresponding path program 18 times [2021-06-05 09:12:21,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:21,497 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402234818] [2021-06-05 09:12:21,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:21,616 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:12:21,617 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:21,617 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402234818] [2021-06-05 09:12:21,617 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402234818] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:21,617 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890555835] [2021-06-05 09:12:21,617 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:21,711 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 09:12:21,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:12:21,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 35 conjunts are in the unsatisfiable core [2021-06-05 09:12:21,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:21,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:12:21,897 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:21,904 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:21,905 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:21,905 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:12:21,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:12:21,939 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:21,943 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:21,944 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:21,944 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:12:21,969 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:12:21,969 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890555835] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:21,969 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:12:21,969 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 19 [2021-06-05 09:12:21,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658799126] [2021-06-05 09:12:21,970 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 09:12:21,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:21,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 09:12:21,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 09:12:21,970 INFO L87 Difference]: Start difference. First operand 1910 states and 3957 transitions. Second operand has 19 states, 19 states have (on average 5.684210526315789) internal successors, (108), 19 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:22,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:22,613 INFO L93 Difference]: Finished difference Result 2582 states and 5361 transitions. [2021-06-05 09:12:22,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 09:12:22,613 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.684210526315789) internal successors, (108), 19 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:12:22,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:22,615 INFO L225 Difference]: With dead ends: 2582 [2021-06-05 09:12:22,615 INFO L226 Difference]: Without dead ends: 2582 [2021-06-05 09:12:22,616 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 393.1ms TimeCoverageRelationStatistics Valid=145, Invalid=1045, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 09:12:22,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2582 states. [2021-06-05 09:12:22,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2582 to 2073. [2021-06-05 09:12:22,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2073 states, 2073 states have (on average 2.0709117221418234) internal successors, (4293), 2072 states have internal predecessors, (4293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:22,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2073 states to 2073 states and 4293 transitions. [2021-06-05 09:12:22,634 INFO L78 Accepts]: Start accepts. Automaton has 2073 states and 4293 transitions. Word has length 80 [2021-06-05 09:12:22,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:22,635 INFO L482 AbstractCegarLoop]: Abstraction has 2073 states and 4293 transitions. [2021-06-05 09:12:22,635 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 5.684210526315789) internal successors, (108), 19 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:22,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 4293 transitions. [2021-06-05 09:12:22,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:12:22,637 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:22,637 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:22,837 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:22,837 INFO L430 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:22,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:22,838 INFO L82 PathProgramCache]: Analyzing trace with hash 275013554, now seen corresponding path program 19 times [2021-06-05 09:12:22,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:22,838 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659461654] [2021-06-05 09:12:22,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:22,963 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:12:22,964 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:22,964 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659461654] [2021-06-05 09:12:22,964 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659461654] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:22,964 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815150942] [2021-06-05 09:12:22,964 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:23,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 09:12:23,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:23,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:12:23,231 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:23,238 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:23,239 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:23,239 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:12:23,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:12:23,266 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:23,270 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:23,271 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:23,271 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:12:23,301 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:12:23,301 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815150942] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:23,301 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:12:23,301 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 19 [2021-06-05 09:12:23,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777995119] [2021-06-05 09:12:23,302 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 09:12:23,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:23,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 09:12:23,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 09:12:23,303 INFO L87 Difference]: Start difference. First operand 2073 states and 4293 transitions. Second operand has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 19 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:23,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:23,862 INFO L93 Difference]: Finished difference Result 2598 states and 5396 transitions. [2021-06-05 09:12:23,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 09:12:23,863 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 19 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:12:23,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:23,865 INFO L225 Difference]: With dead ends: 2598 [2021-06-05 09:12:23,865 INFO L226 Difference]: Without dead ends: 2598 [2021-06-05 09:12:23,865 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 403.0ms TimeCoverageRelationStatistics Valid=162, Invalid=1098, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 09:12:23,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2598 states. [2021-06-05 09:12:23,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2598 to 2073. [2021-06-05 09:12:23,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2073 states, 2073 states have (on average 2.0709117221418234) internal successors, (4293), 2072 states have internal predecessors, (4293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:23,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2073 states to 2073 states and 4293 transitions. [2021-06-05 09:12:23,884 INFO L78 Accepts]: Start accepts. Automaton has 2073 states and 4293 transitions. Word has length 80 [2021-06-05 09:12:23,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:23,884 INFO L482 AbstractCegarLoop]: Abstraction has 2073 states and 4293 transitions. [2021-06-05 09:12:23,884 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 19 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:23,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 4293 transitions. [2021-06-05 09:12:23,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:12:23,886 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:23,886 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:24,086 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2021-06-05 09:12:24,087 INFO L430 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:24,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:24,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1807934508, now seen corresponding path program 20 times [2021-06-05 09:12:24,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:24,087 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856361898] [2021-06-05 09:12:24,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:24,211 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:12:24,211 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:24,211 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856361898] [2021-06-05 09:12:24,211 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856361898] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:24,211 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276295029] [2021-06-05 09:12:24,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:24,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:12:24,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:12:24,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 09:12:24,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:24,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:12:24,509 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:24,514 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:24,515 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:24,515 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:12:24,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:12:24,539 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:24,542 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:24,543 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:24,543 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:12:24,567 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:12:24,567 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276295029] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:24,567 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:12:24,567 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 19 [2021-06-05 09:12:24,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667394566] [2021-06-05 09:12:24,568 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 09:12:24,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:24,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 09:12:24,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 09:12:24,568 INFO L87 Difference]: Start difference. First operand 2073 states and 4293 transitions. Second operand has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 19 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:25,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:25,137 INFO L93 Difference]: Finished difference Result 2499 states and 5187 transitions. [2021-06-05 09:12:25,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 09:12:25,138 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 19 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:12:25,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:25,140 INFO L225 Difference]: With dead ends: 2499 [2021-06-05 09:12:25,140 INFO L226 Difference]: Without dead ends: 2499 [2021-06-05 09:12:25,140 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 372.3ms TimeCoverageRelationStatistics Valid=134, Invalid=858, Unknown=0, NotChecked=0, Total=992 [2021-06-05 09:12:25,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2021-06-05 09:12:25,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2097. [2021-06-05 09:12:25,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2097 states, 2097 states have (on average 2.072961373390558) internal successors, (4347), 2096 states have internal predecessors, (4347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:25,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 4347 transitions. [2021-06-05 09:12:25,161 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 4347 transitions. Word has length 80 [2021-06-05 09:12:25,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:25,162 INFO L482 AbstractCegarLoop]: Abstraction has 2097 states and 4347 transitions. [2021-06-05 09:12:25,162 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 19 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:25,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 4347 transitions. [2021-06-05 09:12:25,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:12:25,164 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:25,164 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:25,388 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:25,388 INFO L430 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:25,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:25,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1291908470, now seen corresponding path program 21 times [2021-06-05 09:12:25,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:25,389 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997062158] [2021-06-05 09:12:25,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 09:12:25,515 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:25,516 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997062158] [2021-06-05 09:12:25,516 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997062158] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:25,516 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983235883] [2021-06-05 09:12:25,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:25,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 09:12:25,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:12:25,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 48 conjunts are in the unsatisfiable core [2021-06-05 09:12:25,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:25,650 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 09:12:25,651 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:25,652 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:25,653 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:25,653 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 09:12:25,685 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:12:25,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 09:12:25,689 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:25,692 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:25,693 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:25,693 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2021-06-05 09:12:25,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:12:25,728 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:25,734 INFO L628 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2021-06-05 09:12:25,735 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:12:25,735 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2021-06-05 09:12:25,779 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:12:25,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:12:25,781 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:25,792 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:25,793 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:25,793 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2021-06-05 09:12:25,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:12:25,835 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:25,845 INFO L628 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2021-06-05 09:12:25,846 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:12:25,847 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2021-06-05 09:12:25,878 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:25,895 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-06-05 09:12:25,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 09:12:25,897 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:25,903 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:25,904 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:25,904 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:11 [2021-06-05 09:12:25,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:12:25,932 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:25,941 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:25,942 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:25,942 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2021-06-05 09:12:25,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-06-05 09:12:25,978 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:25,990 INFO L628 ElimStorePlain]: treesize reduction 4, result has 88.9 percent of original size [2021-06-05 09:12:25,991 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:25,991 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2021-06-05 09:12:26,116 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:12:26,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2021-06-05 09:12:26,118 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:26,123 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:26,124 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:26,124 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:18 [2021-06-05 09:12:26,154 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:12:26,154 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983235883] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:26,154 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:12:26,154 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2021-06-05 09:12:26,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652924754] [2021-06-05 09:12:26,155 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 09:12:26,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:26,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 09:12:26,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2021-06-05 09:12:26,156 INFO L87 Difference]: Start difference. First operand 2097 states and 4347 transitions. Second operand has 22 states, 22 states have (on average 6.590909090909091) internal successors, (145), 22 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:31,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:31,686 INFO L93 Difference]: Finished difference Result 6512 states and 13664 transitions. [2021-06-05 09:12:31,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2021-06-05 09:12:31,687 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.590909090909091) internal successors, (145), 22 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:12:31,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:31,692 INFO L225 Difference]: With dead ends: 6512 [2021-06-05 09:12:31,692 INFO L226 Difference]: Without dead ends: 6512 [2021-06-05 09:12:31,694 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2959 ImplicationChecksByTransitivity, 2297.5ms TimeCoverageRelationStatistics Valid=788, Invalid=8332, Unknown=0, NotChecked=0, Total=9120 [2021-06-05 09:12:31,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6512 states. [2021-06-05 09:12:31,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6512 to 3863. [2021-06-05 09:12:31,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3863 states, 3863 states have (on average 2.0981102769867976) internal successors, (8105), 3862 states have internal predecessors, (8105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:31,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3863 states to 3863 states and 8105 transitions. [2021-06-05 09:12:31,758 INFO L78 Accepts]: Start accepts. Automaton has 3863 states and 8105 transitions. Word has length 80 [2021-06-05 09:12:31,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:31,758 INFO L482 AbstractCegarLoop]: Abstraction has 3863 states and 8105 transitions. [2021-06-05 09:12:31,758 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 6.590909090909091) internal successors, (145), 22 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:31,758 INFO L276 IsEmpty]: Start isEmpty. Operand 3863 states and 8105 transitions. [2021-06-05 09:12:31,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:12:31,763 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:31,763 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:31,968 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-06-05 09:12:31,969 INFO L430 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:31,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:31,969 INFO L82 PathProgramCache]: Analyzing trace with hash -876703972, now seen corresponding path program 22 times [2021-06-05 09:12:31,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:31,969 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212704129] [2021-06-05 09:12:31,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:32,080 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:12:32,080 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:32,080 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212704129] [2021-06-05 09:12:32,080 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212704129] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:32,080 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055423416] [2021-06-05 09:12:32,080 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:32,150 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:12:32,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:12:32,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 09:12:32,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:32,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:12:32,381 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:32,388 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:32,389 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:32,390 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:12:32,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:12:32,413 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:32,416 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:32,417 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:32,417 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:12:32,441 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:12:32,442 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055423416] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:32,442 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:12:32,442 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 19 [2021-06-05 09:12:32,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665551750] [2021-06-05 09:12:32,442 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 09:12:32,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:32,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 09:12:32,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2021-06-05 09:12:32,443 INFO L87 Difference]: Start difference. First operand 3863 states and 8105 transitions. Second operand has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:32,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:32,962 INFO L93 Difference]: Finished difference Result 5326 states and 11166 transitions. [2021-06-05 09:12:32,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 09:12:32,963 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:12:32,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:32,968 INFO L225 Difference]: With dead ends: 5326 [2021-06-05 09:12:32,968 INFO L226 Difference]: Without dead ends: 5326 [2021-06-05 09:12:32,968 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 341.8ms TimeCoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2021-06-05 09:12:32,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5326 states. [2021-06-05 09:12:33,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5326 to 3847. [2021-06-05 09:12:33,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3847 states, 3847 states have (on average 2.098258383155706) internal successors, (8072), 3846 states have internal predecessors, (8072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3847 states to 3847 states and 8072 transitions. [2021-06-05 09:12:33,027 INFO L78 Accepts]: Start accepts. Automaton has 3847 states and 8072 transitions. Word has length 80 [2021-06-05 09:12:33,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:33,027 INFO L482 AbstractCegarLoop]: Abstraction has 3847 states and 8072 transitions. [2021-06-05 09:12:33,027 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:33,027 INFO L276 IsEmpty]: Start isEmpty. Operand 3847 states and 8072 transitions. [2021-06-05 09:12:33,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:12:33,031 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:33,032 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:33,254 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2021-06-05 09:12:33,255 INFO L430 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:33,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:33,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1323220840, now seen corresponding path program 23 times [2021-06-05 09:12:33,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:33,255 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912232258] [2021-06-05 09:12:33,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:33,371 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:12:33,371 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:33,371 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912232258] [2021-06-05 09:12:33,371 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912232258] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:33,371 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318395665] [2021-06-05 09:12:33,371 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:33,450 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:12:33,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:12:33,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 09:12:33,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:33,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:12:33,643 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:33,651 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:33,652 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:33,652 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:12:33,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:12:33,681 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:33,685 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:33,685 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:33,685 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:12:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:12:33,711 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318395665] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:33,711 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:12:33,711 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 20 [2021-06-05 09:12:33,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930320922] [2021-06-05 09:12:33,711 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 09:12:33,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:33,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 09:12:33,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2021-06-05 09:12:33,712 INFO L87 Difference]: Start difference. First operand 3847 states and 8072 transitions. Second operand has 20 states, 20 states have (on average 5.3) internal successors, (106), 20 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:34,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:34,449 INFO L93 Difference]: Finished difference Result 4793 states and 10069 transitions. [2021-06-05 09:12:34,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 09:12:34,450 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.3) internal successors, (106), 20 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:12:34,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:34,454 INFO L225 Difference]: With dead ends: 4793 [2021-06-05 09:12:34,455 INFO L226 Difference]: Without dead ends: 4793 [2021-06-05 09:12:34,455 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 356.1ms TimeCoverageRelationStatistics Valid=127, Invalid=929, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 09:12:34,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4793 states. [2021-06-05 09:12:34,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4793 to 3891. [2021-06-05 09:12:34,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3891 states, 3891 states have (on average 2.0999742996658957) internal successors, (8171), 3890 states have internal predecessors, (8171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:34,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3891 states to 3891 states and 8171 transitions. [2021-06-05 09:12:34,503 INFO L78 Accepts]: Start accepts. Automaton has 3891 states and 8171 transitions. Word has length 80 [2021-06-05 09:12:34,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:34,503 INFO L482 AbstractCegarLoop]: Abstraction has 3891 states and 8171 transitions. [2021-06-05 09:12:34,504 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.3) internal successors, (106), 20 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:34,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3891 states and 8171 transitions. [2021-06-05 09:12:34,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:12:34,507 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:34,508 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:34,708 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2021-06-05 09:12:34,708 INFO L430 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:34,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:34,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1955737897, now seen corresponding path program 7 times [2021-06-05 09:12:34,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:34,709 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474332837] [2021-06-05 09:12:34,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:34,833 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:12:34,834 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:34,834 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474332837] [2021-06-05 09:12:34,834 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474332837] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:34,834 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220270531] [2021-06-05 09:12:34,834 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:34,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 09:12:34,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:35,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:12:35,095 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:35,101 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:35,101 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:35,101 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:12:35,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:12:35,124 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:35,128 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:35,128 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:35,128 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:12:35,154 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:12:35,154 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220270531] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:35,154 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:12:35,154 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 20 [2021-06-05 09:12:35,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492827123] [2021-06-05 09:12:35,154 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 09:12:35,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:35,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 09:12:35,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2021-06-05 09:12:35,155 INFO L87 Difference]: Start difference. First operand 3891 states and 8171 transitions. Second operand has 20 states, 20 states have (on average 5.35) internal successors, (107), 20 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:35,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:35,918 INFO L93 Difference]: Finished difference Result 4943 states and 10372 transitions. [2021-06-05 09:12:35,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 09:12:35,918 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 20 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:12:35,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:35,922 INFO L225 Difference]: With dead ends: 4943 [2021-06-05 09:12:35,922 INFO L226 Difference]: Without dead ends: 4943 [2021-06-05 09:12:35,922 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 387.6ms TimeCoverageRelationStatistics Valid=127, Invalid=929, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 09:12:35,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4943 states. [2021-06-05 09:12:35,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4943 to 3895. [2021-06-05 09:12:35,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3895 states, 3895 states have (on average 2.1001283697047497) internal successors, (8180), 3894 states have internal predecessors, (8180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:35,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3895 states to 3895 states and 8180 transitions. [2021-06-05 09:12:35,973 INFO L78 Accepts]: Start accepts. Automaton has 3895 states and 8180 transitions. Word has length 80 [2021-06-05 09:12:35,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:35,973 INFO L482 AbstractCegarLoop]: Abstraction has 3895 states and 8180 transitions. [2021-06-05 09:12:35,974 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 20 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:35,974 INFO L276 IsEmpty]: Start isEmpty. Operand 3895 states and 8180 transitions. [2021-06-05 09:12:35,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:12:35,978 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:35,978 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:36,178 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2021-06-05 09:12:36,179 INFO L430 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:36,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:36,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1803911650, now seen corresponding path program 24 times [2021-06-05 09:12:36,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:36,179 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133868552] [2021-06-05 09:12:36,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:36,318 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:12:36,318 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:36,318 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133868552] [2021-06-05 09:12:36,318 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133868552] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:36,318 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820346345] [2021-06-05 09:12:36,318 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:36,402 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 09:12:36,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:12:36,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 35 conjunts are in the unsatisfiable core [2021-06-05 09:12:36,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:36,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:12:36,567 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:36,573 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:36,574 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:36,574 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:12:36,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:12:36,599 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:36,604 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:36,605 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:36,605 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:12:36,639 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:12:36,640 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820346345] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:36,640 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:12:36,640 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 19 [2021-06-05 09:12:36,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106041194] [2021-06-05 09:12:36,640 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 09:12:36,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:36,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 09:12:36,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-06-05 09:12:36,641 INFO L87 Difference]: Start difference. First operand 3895 states and 8180 transitions. Second operand has 19 states, 19 states have (on average 5.684210526315789) internal successors, (108), 19 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:37,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:37,327 INFO L93 Difference]: Finished difference Result 5415 states and 11387 transitions. [2021-06-05 09:12:37,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 09:12:37,327 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.684210526315789) internal successors, (108), 19 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:12:37,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:37,332 INFO L225 Difference]: With dead ends: 5415 [2021-06-05 09:12:37,332 INFO L226 Difference]: Without dead ends: 5415 [2021-06-05 09:12:37,332 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 402.9ms TimeCoverageRelationStatistics Valid=151, Invalid=1181, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 09:12:37,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5415 states. [2021-06-05 09:12:37,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5415 to 4086. [2021-06-05 09:12:37,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4086 states, 4086 states have (on average 2.0983847283406756) internal successors, (8574), 4085 states have internal predecessors, (8574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:37,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 8574 transitions. [2021-06-05 09:12:37,386 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 8574 transitions. Word has length 80 [2021-06-05 09:12:37,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:37,386 INFO L482 AbstractCegarLoop]: Abstraction has 4086 states and 8574 transitions. [2021-06-05 09:12:37,386 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 5.684210526315789) internal successors, (108), 19 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:37,386 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 8574 transitions. [2021-06-05 09:12:37,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:12:37,390 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:37,390 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:37,605 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:37,605 INFO L430 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:37,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:37,605 INFO L82 PathProgramCache]: Analyzing trace with hash 210654716, now seen corresponding path program 25 times [2021-06-05 09:12:37,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:37,606 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857501948] [2021-06-05 09:12:37,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:37,730 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:12:37,730 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:37,730 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857501948] [2021-06-05 09:12:37,730 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857501948] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:37,730 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890534466] [2021-06-05 09:12:37,730 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:37,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 38 conjunts are in the unsatisfiable core [2021-06-05 09:12:37,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:38,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 09:12:38,052 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:38,072 INFO L628 ElimStorePlain]: treesize reduction 4, result has 90.5 percent of original size [2021-06-05 09:12:38,076 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:38,077 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:41 [2021-06-05 09:12:38,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:12:38,124 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:38,129 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:38,129 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:38,130 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:12:38,161 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:12:38,161 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890534466] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:38,161 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:12:38,161 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 19 [2021-06-05 09:12:38,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348517856] [2021-06-05 09:12:38,162 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 09:12:38,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:38,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 09:12:38,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-06-05 09:12:38,163 INFO L87 Difference]: Start difference. First operand 4086 states and 8574 transitions. Second operand has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 19 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:38,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:38,814 INFO L93 Difference]: Finished difference Result 5549 states and 11653 transitions. [2021-06-05 09:12:38,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-06-05 09:12:38,815 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 19 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:12:38,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:38,820 INFO L225 Difference]: With dead ends: 5549 [2021-06-05 09:12:38,820 INFO L226 Difference]: Without dead ends: 5549 [2021-06-05 09:12:38,820 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 443.7ms TimeCoverageRelationStatistics Valid=167, Invalid=1239, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 09:12:38,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5549 states. [2021-06-05 09:12:38,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5549 to 3903. [2021-06-05 09:12:38,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3903 states, 3903 states have (on average 2.099923136049193) internal successors, (8196), 3902 states have internal predecessors, (8196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:38,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3903 states to 3903 states and 8196 transitions. [2021-06-05 09:12:38,867 INFO L78 Accepts]: Start accepts. Automaton has 3903 states and 8196 transitions. Word has length 80 [2021-06-05 09:12:38,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:38,867 INFO L482 AbstractCegarLoop]: Abstraction has 3903 states and 8196 transitions. [2021-06-05 09:12:38,867 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 19 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:38,867 INFO L276 IsEmpty]: Start isEmpty. Operand 3903 states and 8196 transitions. [2021-06-05 09:12:38,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 09:12:38,869 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:38,869 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:39,070 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:39,070 INFO L430 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:39,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:39,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1743575670, now seen corresponding path program 26 times [2021-06-05 09:12:39,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:39,071 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895565167] [2021-06-05 09:12:39,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:39,193 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:12:39,193 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:39,193 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895565167] [2021-06-05 09:12:39,194 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895565167] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:39,194 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936282601] [2021-06-05 09:12:39,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:39,288 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:12:39,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:12:39,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 09:12:39,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:39,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:12:39,470 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:39,477 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:39,478 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:39,478 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:12:39,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:12:39,507 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:39,511 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:39,511 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:39,511 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:12:39,540 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:12:39,540 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936282601] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:39,540 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:12:39,540 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 19 [2021-06-05 09:12:39,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325311689] [2021-06-05 09:12:39,541 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 09:12:39,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:39,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 09:12:39,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-06-05 09:12:39,541 INFO L87 Difference]: Start difference. First operand 3903 states and 8196 transitions. Second operand has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 19 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:40,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:40,428 INFO L93 Difference]: Finished difference Result 4815 states and 10117 transitions. [2021-06-05 09:12:40,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 09:12:40,428 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 19 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 09:12:40,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:40,432 INFO L225 Difference]: With dead ends: 4815 [2021-06-05 09:12:40,432 INFO L226 Difference]: Without dead ends: 4815 [2021-06-05 09:12:40,433 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 442.7ms TimeCoverageRelationStatistics Valid=142, Invalid=980, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 09:12:40,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4815 states. [2021-06-05 09:12:40,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4815 to 3895. [2021-06-05 09:12:40,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3895 states, 3895 states have (on average 2.1001283697047497) internal successors, (8180), 3894 states have internal predecessors, (8180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:40,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3895 states to 3895 states and 8180 transitions. [2021-06-05 09:12:40,482 INFO L78 Accepts]: Start accepts. Automaton has 3895 states and 8180 transitions. Word has length 80 [2021-06-05 09:12:40,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:40,483 INFO L482 AbstractCegarLoop]: Abstraction has 3895 states and 8180 transitions. [2021-06-05 09:12:40,483 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 19 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:40,483 INFO L276 IsEmpty]: Start isEmpty. Operand 3895 states and 8180 transitions. [2021-06-05 09:12:40,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:12:40,485 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:40,486 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:40,686 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:40,686 INFO L430 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:40,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:40,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1581914198, now seen corresponding path program 13 times [2021-06-05 09:12:40,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:40,687 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053377628] [2021-06-05 09:12:40,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 57 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-05 09:12:40,819 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:40,819 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053377628] [2021-06-05 09:12:40,819 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053377628] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:40,819 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37341306] [2021-06-05 09:12:40,819 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:40,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 39 conjunts are in the unsatisfiable core [2021-06-05 09:12:40,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:41,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:12:41,156 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:41,163 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:41,164 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:41,164 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:12:41,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:12:41,200 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:41,205 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:41,205 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:41,205 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:12:41,233 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:12:41,233 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37341306] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:41,233 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:12:41,233 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 24 [2021-06-05 09:12:41,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098849818] [2021-06-05 09:12:41,233 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 09:12:41,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:41,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 09:12:41,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2021-06-05 09:12:41,234 INFO L87 Difference]: Start difference. First operand 3895 states and 8180 transitions. Second operand has 24 states, 24 states have (on average 5.833333333333333) internal successors, (140), 24 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:42,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:42,186 INFO L93 Difference]: Finished difference Result 5746 states and 12068 transitions. [2021-06-05 09:12:42,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-06-05 09:12:42,186 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.833333333333333) internal successors, (140), 24 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:12:42,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:42,191 INFO L225 Difference]: With dead ends: 5746 [2021-06-05 09:12:42,191 INFO L226 Difference]: Without dead ends: 5746 [2021-06-05 09:12:42,191 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 539.3ms TimeCoverageRelationStatistics Valid=208, Invalid=1954, Unknown=0, NotChecked=0, Total=2162 [2021-06-05 09:12:42,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5746 states. [2021-06-05 09:12:42,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5746 to 3885. [2021-06-05 09:12:42,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3885 states, 3885 states have (on average 2.1003861003861) internal successors, (8160), 3884 states have internal predecessors, (8160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:42,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3885 states to 3885 states and 8160 transitions. [2021-06-05 09:12:42,238 INFO L78 Accepts]: Start accepts. Automaton has 3885 states and 8160 transitions. Word has length 95 [2021-06-05 09:12:42,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:42,238 INFO L482 AbstractCegarLoop]: Abstraction has 3885 states and 8160 transitions. [2021-06-05 09:12:42,238 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 5.833333333333333) internal successors, (140), 24 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:42,238 INFO L276 IsEmpty]: Start isEmpty. Operand 3885 states and 8160 transitions. [2021-06-05 09:12:42,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:12:42,241 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:42,241 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:42,441 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:42,441 INFO L430 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:42,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:42,442 INFO L82 PathProgramCache]: Analyzing trace with hash -343256185, now seen corresponding path program 27 times [2021-06-05 09:12:42,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:42,442 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652762077] [2021-06-05 09:12:42,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:42,563 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 5 proven. 32 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-06-05 09:12:42,564 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:42,564 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652762077] [2021-06-05 09:12:42,564 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652762077] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:42,564 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539738339] [2021-06-05 09:12:42,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:42,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 09:12:42,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:12:42,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 53 conjunts are in the unsatisfiable core [2021-06-05 09:12:42,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:42,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:12:42,835 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:42,841 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:42,841 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:42,842 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 09:12:42,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-06-05 09:12:42,869 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:42,873 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:42,873 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:42,874 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:14 [2021-06-05 09:12:43,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-06-05 09:12:43,044 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:43,054 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:43,055 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:43,055 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:54 [2021-06-05 09:12:43,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2021-06-05 09:12:43,114 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:43,123 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:43,124 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:43,124 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:47 [2021-06-05 09:12:43,190 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 36 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:12:43,190 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539738339] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:43,191 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:12:43,191 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2021-06-05 09:12:43,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854279688] [2021-06-05 09:12:43,191 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 09:12:43,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:43,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 09:12:43,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2021-06-05 09:12:43,192 INFO L87 Difference]: Start difference. First operand 3885 states and 8160 transitions. Second operand has 22 states, 22 states have (on average 7.409090909090909) internal successors, (163), 22 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:45,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:45,835 INFO L93 Difference]: Finished difference Result 6337 states and 13252 transitions. [2021-06-05 09:12:45,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-06-05 09:12:45,835 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.409090909090909) internal successors, (163), 22 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:12:45,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:45,841 INFO L225 Difference]: With dead ends: 6337 [2021-06-05 09:12:45,841 INFO L226 Difference]: Without dead ends: 6337 [2021-06-05 09:12:45,842 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1167 ImplicationChecksByTransitivity, 1717.8ms TimeCoverageRelationStatistics Valid=484, Invalid=3806, Unknown=0, NotChecked=0, Total=4290 [2021-06-05 09:12:45,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6337 states. [2021-06-05 09:12:45,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6337 to 4722. [2021-06-05 09:12:45,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4722 states, 4722 states have (on average 2.0853451927149513) internal successors, (9847), 4721 states have internal predecessors, (9847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:45,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4722 states to 4722 states and 9847 transitions. [2021-06-05 09:12:45,892 INFO L78 Accepts]: Start accepts. Automaton has 4722 states and 9847 transitions. Word has length 95 [2021-06-05 09:12:45,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:45,892 INFO L482 AbstractCegarLoop]: Abstraction has 4722 states and 9847 transitions. [2021-06-05 09:12:45,893 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 7.409090909090909) internal successors, (163), 22 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:45,893 INFO L276 IsEmpty]: Start isEmpty. Operand 4722 states and 9847 transitions. [2021-06-05 09:12:45,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:12:45,896 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:45,896 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:46,096 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2021-06-05 09:12:46,097 INFO L430 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:46,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:46,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1783098669, now seen corresponding path program 28 times [2021-06-05 09:12:46,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:46,097 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779106719] [2021-06-05 09:12:46,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:46,228 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-06-05 09:12:46,228 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:46,228 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779106719] [2021-06-05 09:12:46,228 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779106719] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:46,228 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984378459] [2021-06-05 09:12:46,229 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:46,323 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:12:46,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:12:46,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 44 conjunts are in the unsatisfiable core [2021-06-05 09:12:46,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:46,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:12:46,609 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:46,616 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:46,617 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:46,618 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:12:46,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:12:46,647 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:46,651 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:46,651 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:46,651 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:12:46,681 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:12:46,682 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984378459] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:46,682 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:12:46,682 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 23 [2021-06-05 09:12:46,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997611565] [2021-06-05 09:12:46,682 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 09:12:46,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:46,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 09:12:46,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2021-06-05 09:12:46,683 INFO L87 Difference]: Start difference. First operand 4722 states and 9847 transitions. Second operand has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:47,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:47,519 INFO L93 Difference]: Finished difference Result 6455 states and 13434 transitions. [2021-06-05 09:12:47,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-06-05 09:12:47,519 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:12:47,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:47,525 INFO L225 Difference]: With dead ends: 6455 [2021-06-05 09:12:47,525 INFO L226 Difference]: Without dead ends: 6455 [2021-06-05 09:12:47,525 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 547.7ms TimeCoverageRelationStatistics Valid=198, Invalid=1872, Unknown=0, NotChecked=0, Total=2070 [2021-06-05 09:12:47,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6455 states. [2021-06-05 09:12:47,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6455 to 4493. [2021-06-05 09:12:47,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4493 states, 4493 states have (on average 2.0894725127976854) internal successors, (9388), 4492 states have internal predecessors, (9388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:47,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4493 states to 4493 states and 9388 transitions. [2021-06-05 09:12:47,577 INFO L78 Accepts]: Start accepts. Automaton has 4493 states and 9388 transitions. Word has length 95 [2021-06-05 09:12:47,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:47,578 INFO L482 AbstractCegarLoop]: Abstraction has 4493 states and 9388 transitions. [2021-06-05 09:12:47,578 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:47,578 INFO L276 IsEmpty]: Start isEmpty. Operand 4493 states and 9388 transitions. [2021-06-05 09:12:47,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:12:47,583 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:47,583 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:47,806 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,46 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:47,806 INFO L430 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:47,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:47,807 INFO L82 PathProgramCache]: Analyzing trace with hash 565905639, now seen corresponding path program 29 times [2021-06-05 09:12:47,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:47,807 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511154651] [2021-06-05 09:12:47,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:12:47,956 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:47,956 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511154651] [2021-06-05 09:12:47,956 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511154651] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:47,956 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351387595] [2021-06-05 09:12:47,956 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:48,059 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 09:12:48,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:12:48,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 39 conjunts are in the unsatisfiable core [2021-06-05 09:12:48,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:48,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:12:48,316 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:48,322 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:48,322 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:48,322 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:12:48,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:12:48,349 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:48,353 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:48,353 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:48,353 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:12:48,393 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:12:48,393 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351387595] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:48,393 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:12:48,393 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 24 [2021-06-05 09:12:48,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563719695] [2021-06-05 09:12:48,394 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 09:12:48,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:48,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 09:12:48,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2021-06-05 09:12:48,394 INFO L87 Difference]: Start difference. First operand 4493 states and 9388 transitions. Second operand has 24 states, 24 states have (on average 6.0) internal successors, (144), 24 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:49,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:49,693 INFO L93 Difference]: Finished difference Result 8014 states and 16778 transitions. [2021-06-05 09:12:49,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-06-05 09:12:49,694 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 6.0) internal successors, (144), 24 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:12:49,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:49,700 INFO L225 Difference]: With dead ends: 8014 [2021-06-05 09:12:49,701 INFO L226 Difference]: Without dead ends: 8014 [2021-06-05 09:12:49,701 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 742.4ms TimeCoverageRelationStatistics Valid=292, Invalid=2900, Unknown=0, NotChecked=0, Total=3192 [2021-06-05 09:12:49,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8014 states. [2021-06-05 09:12:49,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8014 to 5571. [2021-06-05 09:12:49,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5571 states, 5571 states have (on average 2.0962125291689104) internal successors, (11678), 5570 states have internal predecessors, (11678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:49,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5571 states to 5571 states and 11678 transitions. [2021-06-05 09:12:49,767 INFO L78 Accepts]: Start accepts. Automaton has 5571 states and 11678 transitions. Word has length 95 [2021-06-05 09:12:49,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:49,767 INFO L482 AbstractCegarLoop]: Abstraction has 5571 states and 11678 transitions. [2021-06-05 09:12:49,767 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 6.0) internal successors, (144), 24 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:49,768 INFO L276 IsEmpty]: Start isEmpty. Operand 5571 states and 11678 transitions. [2021-06-05 09:12:49,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:12:49,771 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:49,772 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:49,972 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2021-06-05 09:12:49,972 INFO L430 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:49,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:49,973 INFO L82 PathProgramCache]: Analyzing trace with hash -649782839, now seen corresponding path program 30 times [2021-06-05 09:12:49,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:49,973 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857484792] [2021-06-05 09:12:49,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:50,107 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:12:50,107 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:50,107 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857484792] [2021-06-05 09:12:50,107 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857484792] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:50,107 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498563245] [2021-06-05 09:12:50,107 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:50,234 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 09:12:50,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:12:50,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 60 conjunts are in the unsatisfiable core [2021-06-05 09:12:50,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:50,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 09:12:50,273 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:50,274 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:50,274 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:50,274 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 09:12:50,322 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:12:50,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 09:12:50,323 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:50,327 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:50,328 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:50,328 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2021-06-05 09:12:50,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:12:50,353 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:50,359 INFO L628 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2021-06-05 09:12:50,360 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:12:50,360 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2021-06-05 09:12:50,382 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:50,383 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:50,388 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:50,409 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:12:50,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:12:50,411 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:50,417 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:50,418 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:50,419 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2021-06-05 09:12:50,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:12:50,450 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:50,456 INFO L628 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2021-06-05 09:12:50,457 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:12:50,457 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2021-06-05 09:12:50,464 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:12:50,488 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:12:50,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:12:50,489 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:50,497 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:50,498 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:50,498 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2021-06-05 09:12:50,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:12:50,548 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:50,557 INFO L628 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2021-06-05 09:12:50,559 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:12:50,559 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2021-06-05 09:12:50,607 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-06-05 09:12:50,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 09:12:50,610 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:50,615 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:50,616 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:50,617 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:11 [2021-06-05 09:12:50,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:12:50,643 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:50,652 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:50,652 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:50,653 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2021-06-05 09:12:50,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-06-05 09:12:50,692 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:50,706 INFO L628 ElimStorePlain]: treesize reduction 4, result has 88.9 percent of original size [2021-06-05 09:12:50,707 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:50,707 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2021-06-05 09:12:50,861 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:12:50,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2021-06-05 09:12:50,863 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:50,869 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:50,870 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:50,871 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:16 [2021-06-05 09:12:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 23 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:12:50,915 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498563245] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:50,915 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:12:50,915 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2021-06-05 09:12:50,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834787592] [2021-06-05 09:12:50,916 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 09:12:50,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:50,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 09:12:50,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2021-06-05 09:12:50,917 INFO L87 Difference]: Start difference. First operand 5571 states and 11678 transitions. Second operand has 24 states, 24 states have (on average 7.166666666666667) internal successors, (172), 24 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:57,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:57,150 INFO L93 Difference]: Finished difference Result 11395 states and 23885 transitions. [2021-06-05 09:12:57,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2021-06-05 09:12:57,150 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.166666666666667) internal successors, (172), 24 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:12:57,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:57,159 INFO L225 Difference]: With dead ends: 11395 [2021-06-05 09:12:57,159 INFO L226 Difference]: Without dead ends: 11395 [2021-06-05 09:12:57,160 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8421 ImplicationChecksByTransitivity, 3837.5ms TimeCoverageRelationStatistics Valid=1503, Invalid=21449, Unknown=0, NotChecked=0, Total=22952 [2021-06-05 09:12:57,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11395 states. [2021-06-05 09:12:57,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11395 to 6511. [2021-06-05 09:12:57,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6511 states, 6511 states have (on average 2.0955306404546152) internal successors, (13644), 6510 states have internal predecessors, (13644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:57,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6511 states to 6511 states and 13644 transitions. [2021-06-05 09:12:57,250 INFO L78 Accepts]: Start accepts. Automaton has 6511 states and 13644 transitions. Word has length 95 [2021-06-05 09:12:57,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:57,250 INFO L482 AbstractCegarLoop]: Abstraction has 6511 states and 13644 transitions. [2021-06-05 09:12:57,250 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 7.166666666666667) internal successors, (172), 24 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:57,250 INFO L276 IsEmpty]: Start isEmpty. Operand 6511 states and 13644 transitions. [2021-06-05 09:12:57,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:12:57,255 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:57,255 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:57,456 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:57,457 INFO L430 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:57,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:57,457 INFO L82 PathProgramCache]: Analyzing trace with hash 309335075, now seen corresponding path program 31 times [2021-06-05 09:12:57,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:57,457 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323381680] [2021-06-05 09:12:57,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:57,606 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 09:12:57,606 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:57,606 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323381680] [2021-06-05 09:12:57,606 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323381680] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:57,606 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462156351] [2021-06-05 09:12:57,606 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:57,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 39 conjunts are in the unsatisfiable core [2021-06-05 09:12:57,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:12:57,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:12:57,988 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:57,994 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:57,995 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:57,995 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:12:58,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:12:58,022 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:12:58,025 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:12:58,026 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:12:58,026 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:12:58,051 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:12:58,051 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462156351] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:58,052 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:12:58,052 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 24 [2021-06-05 09:12:58,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860776854] [2021-06-05 09:12:58,052 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 09:12:58,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:12:58,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 09:12:58,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2021-06-05 09:12:58,053 INFO L87 Difference]: Start difference. First operand 6511 states and 13644 transitions. Second operand has 24 states, 24 states have (on average 6.041666666666667) internal successors, (145), 24 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:59,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:12:59,249 INFO L93 Difference]: Finished difference Result 8427 states and 17588 transitions. [2021-06-05 09:12:59,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-06-05 09:12:59,249 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 6.041666666666667) internal successors, (145), 24 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:12:59,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:12:59,257 INFO L225 Difference]: With dead ends: 8427 [2021-06-05 09:12:59,257 INFO L226 Difference]: Without dead ends: 8427 [2021-06-05 09:12:59,258 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1165 ImplicationChecksByTransitivity, 771.8ms TimeCoverageRelationStatistics Valid=324, Invalid=3458, Unknown=0, NotChecked=0, Total=3782 [2021-06-05 09:12:59,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8427 states. [2021-06-05 09:12:59,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8427 to 6243. [2021-06-05 09:12:59,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6243 states, 6243 states have (on average 2.0972288963639274) internal successors, (13093), 6242 states have internal predecessors, (13093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:59,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6243 states to 6243 states and 13093 transitions. [2021-06-05 09:12:59,331 INFO L78 Accepts]: Start accepts. Automaton has 6243 states and 13093 transitions. Word has length 95 [2021-06-05 09:12:59,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:12:59,331 INFO L482 AbstractCegarLoop]: Abstraction has 6243 states and 13093 transitions. [2021-06-05 09:12:59,332 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 6.041666666666667) internal successors, (145), 24 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:12:59,332 INFO L276 IsEmpty]: Start isEmpty. Operand 6243 states and 13093 transitions. [2021-06-05 09:12:59,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:12:59,336 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:12:59,336 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:12:59,536 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2021-06-05 09:12:59,537 INFO L430 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:12:59,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:12:59,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1259340263, now seen corresponding path program 32 times [2021-06-05 09:12:59,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:12:59,537 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136080430] [2021-06-05 09:12:59,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:12:59,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:12:59,689 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:12:59,689 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:12:59,689 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136080430] [2021-06-05 09:12:59,689 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136080430] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:12:59,689 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970496273] [2021-06-05 09:12:59,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:12:59,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:12:59,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:12:59,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 39 conjunts are in the unsatisfiable core [2021-06-05 09:12:59,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:00,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:13:00,077 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:00,084 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:00,085 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:00,085 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:13:00,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:13:00,115 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:00,119 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:00,120 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:00,120 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:13:00,150 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:00,150 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970496273] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:00,150 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:00,151 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 25 [2021-06-05 09:13:00,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626963122] [2021-06-05 09:13:00,151 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 09:13:00,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:00,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 09:13:00,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2021-06-05 09:13:00,152 INFO L87 Difference]: Start difference. First operand 6243 states and 13093 transitions. Second operand has 25 states, 25 states have (on average 5.96) internal successors, (149), 25 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:01,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:01,856 INFO L93 Difference]: Finished difference Result 10272 states and 21559 transitions. [2021-06-05 09:13:01,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-06-05 09:13:01,857 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.96) internal successors, (149), 25 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:13:01,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:01,866 INFO L225 Difference]: With dead ends: 10272 [2021-06-05 09:13:01,867 INFO L226 Difference]: Without dead ends: 10272 [2021-06-05 09:13:01,867 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1407 ImplicationChecksByTransitivity, 961.2ms TimeCoverageRelationStatistics Valid=391, Invalid=4165, Unknown=0, NotChecked=0, Total=4556 [2021-06-05 09:13:01,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10272 states. [2021-06-05 09:13:01,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10272 to 7083. [2021-06-05 09:13:01,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7083 states, 7083 states have (on average 2.099110546378653) internal successors, (14868), 7082 states have internal predecessors, (14868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:01,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7083 states to 7083 states and 14868 transitions. [2021-06-05 09:13:01,951 INFO L78 Accepts]: Start accepts. Automaton has 7083 states and 14868 transitions. Word has length 95 [2021-06-05 09:13:01,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:01,951 INFO L482 AbstractCegarLoop]: Abstraction has 7083 states and 14868 transitions. [2021-06-05 09:13:01,952 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 5.96) internal successors, (149), 25 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:01,952 INFO L276 IsEmpty]: Start isEmpty. Operand 7083 states and 14868 transitions. [2021-06-05 09:13:01,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:13:01,956 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:01,957 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:13:02,172 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2021-06-05 09:13:02,173 INFO L430 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:02,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:02,173 INFO L82 PathProgramCache]: Analyzing trace with hash 974936329, now seen corresponding path program 33 times [2021-06-05 09:13:02,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:02,173 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551964861] [2021-06-05 09:13:02,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:02,313 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:13:02,313 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:02,313 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551964861] [2021-06-05 09:13:02,314 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551964861] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:02,314 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654125452] [2021-06-05 09:13:02,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:02,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 09:13:02,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:02,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 60 conjunts are in the unsatisfiable core [2021-06-05 09:13:02,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:02,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 09:13:02,454 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:02,456 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:02,456 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:02,456 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 09:13:02,567 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:13:02,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 09:13:02,569 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:02,574 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:02,575 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:02,575 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2021-06-05 09:13:02,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:13:02,609 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:02,617 INFO L628 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2021-06-05 09:13:02,618 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:13:02,618 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2021-06-05 09:13:02,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:02,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:02,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:02,684 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:13:02,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:13:02,687 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:02,695 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:02,697 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:02,697 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2021-06-05 09:13:02,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:13:02,736 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:02,744 INFO L628 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2021-06-05 09:13:02,745 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:13:02,745 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2021-06-05 09:13:02,755 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:02,783 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:13:02,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:13:02,785 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:02,793 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:02,795 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:02,795 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2021-06-05 09:13:02,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:13:02,837 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:02,855 INFO L628 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2021-06-05 09:13:02,856 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:13:02,856 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2021-06-05 09:13:02,905 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-06-05 09:13:02,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 09:13:02,909 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:02,914 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:02,915 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:02,915 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:11 [2021-06-05 09:13:02,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:13:02,939 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:02,947 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:02,948 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:02,948 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2021-06-05 09:13:02,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-06-05 09:13:02,995 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:03,008 INFO L628 ElimStorePlain]: treesize reduction 4, result has 88.2 percent of original size [2021-06-05 09:13:03,009 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:03,009 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:30 [2021-06-05 09:13:03,085 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:13:03,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 22 [2021-06-05 09:13:03,088 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:03,093 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:03,094 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:03,094 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:12 [2021-06-05 09:13:03,172 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 23 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:13:03,173 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654125452] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:03,173 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:03,173 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2021-06-05 09:13:03,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633501360] [2021-06-05 09:13:03,173 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 09:13:03,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:03,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 09:13:03,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2021-06-05 09:13:03,174 INFO L87 Difference]: Start difference. First operand 7083 states and 14868 transitions. Second operand has 24 states, 24 states have (on average 7.166666666666667) internal successors, (172), 24 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:09,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:09,595 INFO L93 Difference]: Finished difference Result 16406 states and 34376 transitions. [2021-06-05 09:13:09,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2021-06-05 09:13:09,595 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.166666666666667) internal successors, (172), 24 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:13:09,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:09,610 INFO L225 Difference]: With dead ends: 16406 [2021-06-05 09:13:09,610 INFO L226 Difference]: Without dead ends: 16406 [2021-06-05 09:13:09,612 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9859 ImplicationChecksByTransitivity, 3668.7ms TimeCoverageRelationStatistics Valid=1684, Invalid=24398, Unknown=0, NotChecked=0, Total=26082 [2021-06-05 09:13:09,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16406 states. [2021-06-05 09:13:09,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16406 to 9260. [2021-06-05 09:13:09,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9260 states, 9260 states have (on average 2.097732181425486) internal successors, (19425), 9259 states have internal predecessors, (19425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:09,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9260 states to 9260 states and 19425 transitions. [2021-06-05 09:13:09,741 INFO L78 Accepts]: Start accepts. Automaton has 9260 states and 19425 transitions. Word has length 95 [2021-06-05 09:13:09,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:09,741 INFO L482 AbstractCegarLoop]: Abstraction has 9260 states and 19425 transitions. [2021-06-05 09:13:09,741 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 7.166666666666667) internal successors, (172), 24 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:09,741 INFO L276 IsEmpty]: Start isEmpty. Operand 9260 states and 19425 transitions. [2021-06-05 09:13:09,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:13:09,749 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:09,749 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:13:09,955 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2021-06-05 09:13:09,955 INFO L430 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:09,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:09,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1850832851, now seen corresponding path program 34 times [2021-06-05 09:13:09,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:09,955 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464980176] [2021-06-05 09:13:09,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:10,089 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:13:10,089 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:10,089 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464980176] [2021-06-05 09:13:10,089 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464980176] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:10,089 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935181631] [2021-06-05 09:13:10,089 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:10,166 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:13:10,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:10,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 39 conjunts are in the unsatisfiable core [2021-06-05 09:13:10,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:10,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:13:10,406 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:10,412 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:10,413 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:10,413 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:13:10,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:13:10,440 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:10,443 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:10,444 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:10,444 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:13:10,470 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:10,470 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935181631] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:10,470 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:10,470 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 24 [2021-06-05 09:13:10,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801252573] [2021-06-05 09:13:10,470 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 09:13:10,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:10,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 09:13:10,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2021-06-05 09:13:10,471 INFO L87 Difference]: Start difference. First operand 9260 states and 19425 transitions. Second operand has 24 states, 24 states have (on average 6.041666666666667) internal successors, (145), 24 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:11,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:11,895 INFO L93 Difference]: Finished difference Result 9985 states and 20870 transitions. [2021-06-05 09:13:11,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-06-05 09:13:11,895 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 6.041666666666667) internal successors, (145), 24 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:13:11,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:11,904 INFO L225 Difference]: With dead ends: 9985 [2021-06-05 09:13:11,905 INFO L226 Difference]: Without dead ends: 9985 [2021-06-05 09:13:11,905 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 792.8ms TimeCoverageRelationStatistics Valid=349, Invalid=3311, Unknown=0, NotChecked=0, Total=3660 [2021-06-05 09:13:11,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9985 states. [2021-06-05 09:13:11,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9985 to 8232. [2021-06-05 09:13:11,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8232 states, 8232 states have (on average 2.0934159378036927) internal successors, (17233), 8231 states have internal predecessors, (17233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:11,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8232 states to 8232 states and 17233 transitions. [2021-06-05 09:13:11,995 INFO L78 Accepts]: Start accepts. Automaton has 8232 states and 17233 transitions. Word has length 95 [2021-06-05 09:13:11,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:11,995 INFO L482 AbstractCegarLoop]: Abstraction has 8232 states and 17233 transitions. [2021-06-05 09:13:11,995 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 6.041666666666667) internal successors, (145), 24 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:11,995 INFO L276 IsEmpty]: Start isEmpty. Operand 8232 states and 17233 transitions. [2021-06-05 09:13:12,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:13:12,004 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:12,004 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:13:12,227 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,52 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:12,228 INFO L430 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:12,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:12,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1553653949, now seen corresponding path program 35 times [2021-06-05 09:13:12,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:12,228 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874119619] [2021-06-05 09:13:12,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:12,373 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 25 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-05 09:13:12,373 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:12,373 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874119619] [2021-06-05 09:13:12,373 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874119619] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:12,373 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579848908] [2021-06-05 09:13:12,373 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:12,505 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:13:12,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:12,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 39 conjunts are in the unsatisfiable core [2021-06-05 09:13:12,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:12,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:13:12,749 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:12,755 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:12,756 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:12,756 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:13:12,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:13:12,781 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:12,784 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:12,785 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:12,785 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:13:12,856 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:12,856 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579848908] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:12,856 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:12,856 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 24 [2021-06-05 09:13:12,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000531985] [2021-06-05 09:13:12,856 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 09:13:12,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:12,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 09:13:12,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2021-06-05 09:13:12,857 INFO L87 Difference]: Start difference. First operand 8232 states and 17233 transitions. Second operand has 24 states, 24 states have (on average 5.875) internal successors, (141), 24 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:14,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:14,019 INFO L93 Difference]: Finished difference Result 9863 states and 20653 transitions. [2021-06-05 09:13:14,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-06-05 09:13:14,020 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.875) internal successors, (141), 24 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:13:14,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:14,029 INFO L225 Difference]: With dead ends: 9863 [2021-06-05 09:13:14,029 INFO L226 Difference]: Without dead ends: 9863 [2021-06-05 09:13:14,029 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1060 ImplicationChecksByTransitivity, 798.1ms TimeCoverageRelationStatistics Valid=350, Invalid=3190, Unknown=0, NotChecked=0, Total=3540 [2021-06-05 09:13:14,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9863 states. [2021-06-05 09:13:14,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9863 to 8433. [2021-06-05 09:13:14,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8433 states, 8433 states have (on average 2.093561010316613) internal successors, (17655), 8432 states have internal predecessors, (17655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:14,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8433 states to 8433 states and 17655 transitions. [2021-06-05 09:13:14,120 INFO L78 Accepts]: Start accepts. Automaton has 8433 states and 17655 transitions. Word has length 95 [2021-06-05 09:13:14,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:14,120 INFO L482 AbstractCegarLoop]: Abstraction has 8433 states and 17655 transitions. [2021-06-05 09:13:14,120 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 5.875) internal successors, (141), 24 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:14,120 INFO L276 IsEmpty]: Start isEmpty. Operand 8433 states and 17655 transitions. [2021-06-05 09:13:14,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:13:14,127 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:14,127 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:13:14,327 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,53 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:14,327 INFO L430 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:14,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:14,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1208392393, now seen corresponding path program 36 times [2021-06-05 09:13:14,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:14,328 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554741672] [2021-06-05 09:13:14,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:14,464 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 09:13:14,464 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:14,464 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554741672] [2021-06-05 09:13:14,464 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554741672] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:14,464 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757922185] [2021-06-05 09:13:14,465 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:14,559 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 09:13:14,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:14,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 64 conjunts are in the unsatisfiable core [2021-06-05 09:13:14,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:14,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 09:13:14,604 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:14,607 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:14,607 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:14,608 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 09:13:14,681 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:13:14,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 09:13:14,683 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:14,688 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:14,689 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:14,689 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2021-06-05 09:13:14,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:13:14,724 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:14,733 INFO L628 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2021-06-05 09:13:14,734 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:13:14,734 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2021-06-05 09:13:14,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:14,795 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:13:14,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:13:14,797 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:14,806 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:14,807 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:14,807 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2021-06-05 09:13:14,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:13:14,861 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:14,867 INFO L628 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2021-06-05 09:13:14,868 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:13:14,868 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2021-06-05 09:13:14,920 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:13:14,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:13:14,921 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:14,929 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:14,930 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:14,930 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2021-06-05 09:13:14,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:13:14,955 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:14,962 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:14,962 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:14,962 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2021-06-05 09:13:15,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:13:15,008 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:15,019 INFO L628 ElimStorePlain]: treesize reduction 4, result has 85.2 percent of original size [2021-06-05 09:13:15,020 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:13:15,020 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:23 [2021-06-05 09:13:15,087 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:15,102 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-06-05 09:13:15,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 09:13:15,104 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:15,110 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:15,111 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:15,111 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:20 [2021-06-05 09:13:15,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:13:15,139 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:15,147 INFO L628 ElimStorePlain]: treesize reduction 4, result has 83.3 percent of original size [2021-06-05 09:13:15,148 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:15,148 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2021-06-05 09:13:15,319 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:13:15,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 20 [2021-06-05 09:13:15,320 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:15,324 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:15,325 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:15,325 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:9 [2021-06-05 09:13:15,357 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:15,358 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757922185] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:15,358 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:15,358 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 29 [2021-06-05 09:13:15,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267209247] [2021-06-05 09:13:15,358 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 09:13:15,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:15,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 09:13:15,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=745, Unknown=0, NotChecked=0, Total=812 [2021-06-05 09:13:15,359 INFO L87 Difference]: Start difference. First operand 8433 states and 17655 transitions. Second operand has 29 states, 29 states have (on average 6.137931034482759) internal successors, (178), 29 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:20,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:20,088 INFO L93 Difference]: Finished difference Result 13572 states and 28401 transitions. [2021-06-05 09:13:20,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2021-06-05 09:13:20,088 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.137931034482759) internal successors, (178), 29 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:13:20,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:20,103 INFO L225 Difference]: With dead ends: 13572 [2021-06-05 09:13:20,103 INFO L226 Difference]: Without dead ends: 13572 [2021-06-05 09:13:20,104 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4545 ImplicationChecksByTransitivity, 3172.6ms TimeCoverageRelationStatistics Valid=950, Invalid=13092, Unknown=0, NotChecked=0, Total=14042 [2021-06-05 09:13:20,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13572 states. [2021-06-05 09:13:20,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13572 to 12120. [2021-06-05 09:13:20,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12120 states, 12120 states have (on average 2.0984323432343235) internal successors, (25433), 12119 states have internal predecessors, (25433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:20,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12120 states to 12120 states and 25433 transitions. [2021-06-05 09:13:20,279 INFO L78 Accepts]: Start accepts. Automaton has 12120 states and 25433 transitions. Word has length 95 [2021-06-05 09:13:20,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:20,279 INFO L482 AbstractCegarLoop]: Abstraction has 12120 states and 25433 transitions. [2021-06-05 09:13:20,279 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 6.137931034482759) internal successors, (178), 29 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:20,279 INFO L276 IsEmpty]: Start isEmpty. Operand 12120 states and 25433 transitions. [2021-06-05 09:13:20,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:13:20,289 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:20,289 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:13:20,490 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable62 [2021-06-05 09:13:20,490 INFO L430 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:20,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:20,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1060589004, now seen corresponding path program 37 times [2021-06-05 09:13:20,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:20,491 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551970081] [2021-06-05 09:13:20,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:20,626 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 09:13:20,626 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:20,626 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551970081] [2021-06-05 09:13:20,626 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551970081] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:20,626 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818099716] [2021-06-05 09:13:20,626 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:20,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 39 conjunts are in the unsatisfiable core [2021-06-05 09:13:20,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:20,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:13:20,949 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:20,955 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:20,955 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:20,955 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:13:20,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:13:20,980 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:20,984 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:20,984 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:20,984 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:13:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:21,009 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818099716] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:21,010 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:21,010 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 24 [2021-06-05 09:13:21,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478235082] [2021-06-05 09:13:21,010 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 09:13:21,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:21,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 09:13:21,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2021-06-05 09:13:21,010 INFO L87 Difference]: Start difference. First operand 12120 states and 25433 transitions. Second operand has 24 states, 24 states have (on average 6.041666666666667) internal successors, (145), 24 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:21,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:21,992 INFO L93 Difference]: Finished difference Result 15122 states and 31740 transitions. [2021-06-05 09:13:21,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-06-05 09:13:21,993 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 6.041666666666667) internal successors, (145), 24 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:13:21,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:22,008 INFO L225 Difference]: With dead ends: 15122 [2021-06-05 09:13:22,008 INFO L226 Difference]: Without dead ends: 15122 [2021-06-05 09:13:22,008 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 577.9ms TimeCoverageRelationStatistics Valid=216, Invalid=2136, Unknown=0, NotChecked=0, Total=2352 [2021-06-05 09:13:22,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15122 states. [2021-06-05 09:13:22,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15122 to 12134. [2021-06-05 09:13:22,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12134 states, 12134 states have (on average 2.0989780781275753) internal successors, (25469), 12133 states have internal predecessors, (25469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:22,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12134 states to 12134 states and 25469 transitions. [2021-06-05 09:13:22,226 INFO L78 Accepts]: Start accepts. Automaton has 12134 states and 25469 transitions. Word has length 95 [2021-06-05 09:13:22,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:22,226 INFO L482 AbstractCegarLoop]: Abstraction has 12134 states and 25469 transitions. [2021-06-05 09:13:22,226 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 6.041666666666667) internal successors, (145), 24 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:22,226 INFO L276 IsEmpty]: Start isEmpty. Operand 12134 states and 25469 transitions. [2021-06-05 09:13:22,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:13:22,234 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:22,234 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:13:22,435 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2021-06-05 09:13:22,435 INFO L430 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:22,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:22,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1212415251, now seen corresponding path program 38 times [2021-06-05 09:13:22,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:22,436 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944300468] [2021-06-05 09:13:22,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:22,574 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 5 proven. 36 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:13:22,574 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:22,575 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944300468] [2021-06-05 09:13:22,575 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944300468] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:22,575 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864642562] [2021-06-05 09:13:22,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:22,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:13:22,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:22,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 52 conjunts are in the unsatisfiable core [2021-06-05 09:13:22,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:22,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 09:13:22,700 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:22,701 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:22,702 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:22,702 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 09:13:22,751 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:13:22,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 09:13:22,752 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:22,756 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:22,757 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:22,757 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2021-06-05 09:13:22,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:13:22,785 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:22,792 INFO L628 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2021-06-05 09:13:22,793 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:13:22,793 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2021-06-05 09:13:22,818 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:22,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:22,821 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:22,853 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:13:22,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:13:22,855 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:22,865 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:22,866 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:22,867 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2021-06-05 09:13:22,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:13:22,903 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:22,910 INFO L628 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2021-06-05 09:13:22,912 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:13:22,912 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2021-06-05 09:13:22,996 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:13:22,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:13:22,998 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:23,008 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:23,010 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:23,011 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2021-06-05 09:13:23,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:13:23,050 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:23,058 INFO L628 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2021-06-05 09:13:23,060 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:13:23,060 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2021-06-05 09:13:23,089 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:23,104 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-06-05 09:13:23,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 09:13:23,107 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:23,112 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:23,113 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:23,113 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:11 [2021-06-05 09:13:23,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:13:23,139 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:23,147 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:23,148 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:23,148 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2021-06-05 09:13:23,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-06-05 09:13:23,184 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:23,197 INFO L628 ElimStorePlain]: treesize reduction 4, result has 88.2 percent of original size [2021-06-05 09:13:23,198 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:23,198 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:30 [2021-06-05 09:13:23,269 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:13:23,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 22 [2021-06-05 09:13:23,271 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:23,277 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:23,278 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:23,278 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:12 [2021-06-05 09:13:23,337 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 28 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:23,338 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864642562] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:23,338 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:23,338 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2021-06-05 09:13:23,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982939641] [2021-06-05 09:13:23,338 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 09:13:23,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:23,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 09:13:23,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2021-06-05 09:13:23,339 INFO L87 Difference]: Start difference. First operand 12134 states and 25469 transitions. Second operand has 25 states, 25 states have (on average 6.92) internal successors, (173), 25 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:28,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:28,306 INFO L93 Difference]: Finished difference Result 18632 states and 39080 transitions. [2021-06-05 09:13:28,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2021-06-05 09:13:28,306 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.92) internal successors, (173), 25 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:13:28,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:28,325 INFO L225 Difference]: With dead ends: 18632 [2021-06-05 09:13:28,325 INFO L226 Difference]: Without dead ends: 18632 [2021-06-05 09:13:28,327 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6682 ImplicationChecksByTransitivity, 3127.7ms TimeCoverageRelationStatistics Valid=1283, Invalid=17349, Unknown=0, NotChecked=0, Total=18632 [2021-06-05 09:13:28,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18632 states. [2021-06-05 09:13:28,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18632 to 12508. [2021-06-05 09:13:28,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12508 states, 12508 states have (on average 2.099136552606332) internal successors, (26256), 12507 states have internal predecessors, (26256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:28,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12508 states to 12508 states and 26256 transitions. [2021-06-05 09:13:28,536 INFO L78 Accepts]: Start accepts. Automaton has 12508 states and 26256 transitions. Word has length 95 [2021-06-05 09:13:28,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:28,536 INFO L482 AbstractCegarLoop]: Abstraction has 12508 states and 26256 transitions. [2021-06-05 09:13:28,536 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 6.92) internal successors, (173), 25 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:28,536 INFO L276 IsEmpty]: Start isEmpty. Operand 12508 states and 26256 transitions. [2021-06-05 09:13:28,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:13:28,546 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:28,546 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:13:28,746 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,56 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:28,746 INFO L430 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:28,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:28,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1489295111, now seen corresponding path program 39 times [2021-06-05 09:13:28,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:28,747 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453409214] [2021-06-05 09:13:28,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:28,878 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:13:28,878 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:28,878 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453409214] [2021-06-05 09:13:28,878 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453409214] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:28,878 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230830221] [2021-06-05 09:13:28,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:28,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 09:13:28,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:28,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 52 conjunts are in the unsatisfiable core [2021-06-05 09:13:28,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:28,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 09:13:28,996 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:28,997 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:28,997 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:28,997 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 09:13:29,041 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:13:29,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 09:13:29,043 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:29,046 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:29,047 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:29,047 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2021-06-05 09:13:29,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:13:29,077 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:29,083 INFO L628 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2021-06-05 09:13:29,084 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:13:29,084 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2021-06-05 09:13:29,107 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:29,109 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:29,110 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:29,131 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:13:29,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:13:29,133 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:29,140 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:29,141 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:29,141 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2021-06-05 09:13:29,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:13:29,168 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:29,174 INFO L628 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2021-06-05 09:13:29,175 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:13:29,175 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2021-06-05 09:13:29,241 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:13:29,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:13:29,243 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:29,251 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:29,252 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:29,252 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2021-06-05 09:13:29,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:13:29,288 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:29,296 INFO L628 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2021-06-05 09:13:29,297 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:13:29,297 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2021-06-05 09:13:29,325 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:29,344 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-06-05 09:13:29,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 09:13:29,346 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:29,350 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:29,351 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:29,351 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:11 [2021-06-05 09:13:29,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:13:29,385 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:29,392 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:29,393 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:29,393 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2021-06-05 09:13:29,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2021-06-05 09:13:29,432 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:29,448 INFO L628 ElimStorePlain]: treesize reduction 4, result has 88.9 percent of original size [2021-06-05 09:13:29,449 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:29,449 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:32 [2021-06-05 09:13:29,592 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:13:29,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2021-06-05 09:13:29,593 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:29,598 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:29,599 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:29,599 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:18 [2021-06-05 09:13:29,648 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 28 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:29,648 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230830221] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:29,648 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:29,648 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2021-06-05 09:13:29,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076440814] [2021-06-05 09:13:29,648 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 09:13:29,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:29,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 09:13:29,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2021-06-05 09:13:29,649 INFO L87 Difference]: Start difference. First operand 12508 states and 26256 transitions. Second operand has 25 states, 25 states have (on average 6.84) internal successors, (171), 25 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:36,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:36,154 INFO L93 Difference]: Finished difference Result 19282 states and 40470 transitions. [2021-06-05 09:13:36,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2021-06-05 09:13:36,154 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.84) internal successors, (171), 25 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:13:36,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:36,173 INFO L225 Difference]: With dead ends: 19282 [2021-06-05 09:13:36,173 INFO L226 Difference]: Without dead ends: 19282 [2021-06-05 09:13:36,175 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10930 ImplicationChecksByTransitivity, 4392.9ms TimeCoverageRelationStatistics Valid=1857, Invalid=26873, Unknown=0, NotChecked=0, Total=28730 [2021-06-05 09:13:36,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19282 states. [2021-06-05 09:13:36,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19282 to 12251. [2021-06-05 09:13:36,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12251 states, 12251 states have (on average 2.100889723287895) internal successors, (25738), 12250 states have internal predecessors, (25738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:36,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12251 states to 12251 states and 25738 transitions. [2021-06-05 09:13:36,361 INFO L78 Accepts]: Start accepts. Automaton has 12251 states and 25738 transitions. Word has length 95 [2021-06-05 09:13:36,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:36,361 INFO L482 AbstractCegarLoop]: Abstraction has 12251 states and 25738 transitions. [2021-06-05 09:13:36,361 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 6.84) internal successors, (171), 25 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:36,361 INFO L276 IsEmpty]: Start isEmpty. Operand 12251 states and 25738 transitions. [2021-06-05 09:13:36,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:13:36,371 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:36,371 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:13:36,573 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2021-06-05 09:13:36,573 INFO L430 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:36,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:36,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1189529839, now seen corresponding path program 40 times [2021-06-05 09:13:36,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:36,574 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941791675] [2021-06-05 09:13:36,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:36,712 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:36,712 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:36,712 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941791675] [2021-06-05 09:13:36,713 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941791675] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:36,713 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196425246] [2021-06-05 09:13:36,713 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:36,789 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:13:36,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:36,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 39 conjunts are in the unsatisfiable core [2021-06-05 09:13:36,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:37,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:13:37,038 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:37,044 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:37,045 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:37,045 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:13:37,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:13:37,071 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:37,074 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:37,075 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:37,075 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:13:37,105 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:37,106 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196425246] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:37,106 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:37,106 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 25 [2021-06-05 09:13:37,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957987799] [2021-06-05 09:13:37,106 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 09:13:37,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:37,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 09:13:37,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2021-06-05 09:13:37,107 INFO L87 Difference]: Start difference. First operand 12251 states and 25738 transitions. Second operand has 25 states, 25 states have (on average 5.96) internal successors, (149), 25 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:38,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:38,740 INFO L93 Difference]: Finished difference Result 18436 states and 38758 transitions. [2021-06-05 09:13:38,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-06-05 09:13:38,741 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.96) internal successors, (149), 25 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:13:38,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:38,757 INFO L225 Difference]: With dead ends: 18436 [2021-06-05 09:13:38,757 INFO L226 Difference]: Without dead ends: 18436 [2021-06-05 09:13:38,757 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1495 ImplicationChecksByTransitivity, 942.2ms TimeCoverageRelationStatistics Valid=399, Invalid=4431, Unknown=0, NotChecked=0, Total=4830 [2021-06-05 09:13:38,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18436 states. [2021-06-05 09:13:38,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18436 to 14684. [2021-06-05 09:13:38,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14684 states, 14684 states have (on average 2.105625170253337) internal successors, (30919), 14683 states have internal predecessors, (30919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:38,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14684 states to 14684 states and 30919 transitions. [2021-06-05 09:13:38,934 INFO L78 Accepts]: Start accepts. Automaton has 14684 states and 30919 transitions. Word has length 95 [2021-06-05 09:13:38,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:38,935 INFO L482 AbstractCegarLoop]: Abstraction has 14684 states and 30919 transitions. [2021-06-05 09:13:38,935 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 5.96) internal successors, (149), 25 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:38,935 INFO L276 IsEmpty]: Start isEmpty. Operand 14684 states and 30919 transitions. [2021-06-05 09:13:38,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:13:38,945 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:38,946 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:13:39,146 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,58 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:39,146 INFO L430 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:39,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:39,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1337572021, now seen corresponding path program 41 times [2021-06-05 09:13:39,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:39,147 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988318350] [2021-06-05 09:13:39,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:39,300 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 09:13:39,300 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:39,300 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988318350] [2021-06-05 09:13:39,300 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988318350] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:39,300 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900932714] [2021-06-05 09:13:39,301 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:39,409 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:13:39,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:39,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 39 conjunts are in the unsatisfiable core [2021-06-05 09:13:39,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:39,651 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:13:39,652 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:39,658 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:39,659 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:39,659 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:13:39,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:13:39,684 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:39,688 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:39,688 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:39,688 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:13:39,722 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:39,722 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900932714] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:39,722 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:39,722 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 24 [2021-06-05 09:13:39,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124682026] [2021-06-05 09:13:39,722 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 09:13:39,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:39,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 09:13:39,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2021-06-05 09:13:39,723 INFO L87 Difference]: Start difference. First operand 14684 states and 30919 transitions. Second operand has 24 states, 24 states have (on average 5.625) internal successors, (135), 24 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:41,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:41,057 INFO L93 Difference]: Finished difference Result 17415 states and 36633 transitions. [2021-06-05 09:13:41,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-06-05 09:13:41,058 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.625) internal successors, (135), 24 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:13:41,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:41,075 INFO L225 Difference]: With dead ends: 17415 [2021-06-05 09:13:41,075 INFO L226 Difference]: Without dead ends: 17415 [2021-06-05 09:13:41,076 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 837.8ms TimeCoverageRelationStatistics Valid=359, Invalid=3423, Unknown=0, NotChecked=0, Total=3782 [2021-06-05 09:13:41,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17415 states. [2021-06-05 09:13:41,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17415 to 14778. [2021-06-05 09:13:41,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14778 states, 14778 states have (on average 2.105629990526458) internal successors, (31117), 14777 states have internal predecessors, (31117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:41,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14778 states to 14778 states and 31117 transitions. [2021-06-05 09:13:41,328 INFO L78 Accepts]: Start accepts. Automaton has 14778 states and 31117 transitions. Word has length 95 [2021-06-05 09:13:41,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:41,328 INFO L482 AbstractCegarLoop]: Abstraction has 14778 states and 31117 transitions. [2021-06-05 09:13:41,328 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 5.625) internal successors, (135), 24 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:41,328 INFO L276 IsEmpty]: Start isEmpty. Operand 14778 states and 31117 transitions. [2021-06-05 09:13:41,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:13:41,339 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:41,339 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:13:41,539 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2021-06-05 09:13:41,540 INFO L430 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:41,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:41,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1359892324, now seen corresponding path program 42 times [2021-06-05 09:13:41,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:41,540 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343270931] [2021-06-05 09:13:41,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:41,676 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:41,676 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:41,676 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343270931] [2021-06-05 09:13:41,676 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343270931] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:41,676 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768516130] [2021-06-05 09:13:41,676 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:41,756 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 09:13:41,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:41,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 39 conjunts are in the unsatisfiable core [2021-06-05 09:13:41,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:42,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:13:42,000 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:42,006 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:42,007 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:42,007 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:13:42,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:13:42,032 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:42,035 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:42,036 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:42,036 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:13:42,061 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:42,061 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768516130] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:42,061 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:42,062 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 24 [2021-06-05 09:13:42,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813613141] [2021-06-05 09:13:42,062 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 09:13:42,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:42,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 09:13:42,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2021-06-05 09:13:42,063 INFO L87 Difference]: Start difference. First operand 14778 states and 31117 transitions. Second operand has 24 states, 24 states have (on average 5.625) internal successors, (135), 24 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:43,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:43,250 INFO L93 Difference]: Finished difference Result 19112 states and 40174 transitions. [2021-06-05 09:13:43,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-06-05 09:13:43,250 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.625) internal successors, (135), 24 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:13:43,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:43,269 INFO L225 Difference]: With dead ends: 19112 [2021-06-05 09:13:43,270 INFO L226 Difference]: Without dead ends: 19112 [2021-06-05 09:13:43,270 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 670.7ms TimeCoverageRelationStatistics Valid=260, Invalid=2602, Unknown=0, NotChecked=0, Total=2862 [2021-06-05 09:13:43,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19112 states. [2021-06-05 09:13:43,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19112 to 15019. [2021-06-05 09:13:43,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15019 states, 15019 states have (on average 2.1039350156468473) internal successors, (31599), 15018 states have internal predecessors, (31599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:43,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15019 states to 15019 states and 31599 transitions. [2021-06-05 09:13:43,459 INFO L78 Accepts]: Start accepts. Automaton has 15019 states and 31599 transitions. Word has length 95 [2021-06-05 09:13:43,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:43,459 INFO L482 AbstractCegarLoop]: Abstraction has 15019 states and 31599 transitions. [2021-06-05 09:13:43,459 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 5.625) internal successors, (135), 24 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:43,459 INFO L276 IsEmpty]: Start isEmpty. Operand 15019 states and 31599 transitions. [2021-06-05 09:13:43,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:13:43,469 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:43,469 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:13:43,670 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,60 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:43,670 INFO L430 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:43,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:43,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1210012485, now seen corresponding path program 43 times [2021-06-05 09:13:43,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:43,670 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016558202] [2021-06-05 09:13:43,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:43,817 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:43,817 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:43,817 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016558202] [2021-06-05 09:13:43,817 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016558202] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:43,817 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918307728] [2021-06-05 09:13:43,817 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:43,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 44 conjunts are in the unsatisfiable core [2021-06-05 09:13:43,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:44,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:13:44,156 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:44,162 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:44,162 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:44,163 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:13:44,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:13:44,189 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:44,192 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:44,193 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:44,193 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:13:44,296 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:44,296 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918307728] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:44,296 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:44,296 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 24 [2021-06-05 09:13:44,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137043265] [2021-06-05 09:13:44,306 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 09:13:44,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:44,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 09:13:44,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2021-06-05 09:13:44,307 INFO L87 Difference]: Start difference. First operand 15019 states and 31599 transitions. Second operand has 24 states, 24 states have (on average 5.625) internal successors, (135), 24 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:45,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:45,400 INFO L93 Difference]: Finished difference Result 19295 states and 40495 transitions. [2021-06-05 09:13:45,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-06-05 09:13:45,400 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.625) internal successors, (135), 24 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:13:45,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:45,420 INFO L225 Difference]: With dead ends: 19295 [2021-06-05 09:13:45,420 INFO L226 Difference]: Without dead ends: 19295 [2021-06-05 09:13:45,420 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 778.2ms TimeCoverageRelationStatistics Valid=278, Invalid=3028, Unknown=0, NotChecked=0, Total=3306 [2021-06-05 09:13:45,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19295 states. [2021-06-05 09:13:45,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19295 to 16470. [2021-06-05 09:13:45,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16470 states, 16470 states have (on average 2.1005464480874316) internal successors, (34596), 16469 states have internal predecessors, (34596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:45,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16470 states to 16470 states and 34596 transitions. [2021-06-05 09:13:45,622 INFO L78 Accepts]: Start accepts. Automaton has 16470 states and 34596 transitions. Word has length 95 [2021-06-05 09:13:45,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:45,622 INFO L482 AbstractCegarLoop]: Abstraction has 16470 states and 34596 transitions. [2021-06-05 09:13:45,622 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 5.625) internal successors, (135), 24 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:45,622 INFO L276 IsEmpty]: Start isEmpty. Operand 16470 states and 34596 transitions. [2021-06-05 09:13:45,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:13:45,635 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:45,635 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:13:45,835 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2021-06-05 09:13:45,836 INFO L430 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:45,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:45,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1273213183, now seen corresponding path program 44 times [2021-06-05 09:13:45,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:45,836 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268345725] [2021-06-05 09:13:45,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:45,982 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:45,982 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:45,983 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268345725] [2021-06-05 09:13:45,983 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268345725] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:45,983 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265003906] [2021-06-05 09:13:45,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:46,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:13:46,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:46,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 52 conjunts are in the unsatisfiable core [2021-06-05 09:13:46,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:46,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 09:13:46,138 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:46,139 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:46,140 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:46,140 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 09:13:46,189 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:13:46,189 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 09:13:46,191 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:46,195 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:46,196 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:46,196 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2021-06-05 09:13:46,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:13:46,231 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:46,238 INFO L628 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2021-06-05 09:13:46,239 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:13:46,239 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2021-06-05 09:13:46,266 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:46,268 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:46,269 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:46,295 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:13:46,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:13:46,297 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:46,304 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:46,306 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:46,307 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2021-06-05 09:13:46,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:13:46,332 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:46,339 INFO L628 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2021-06-05 09:13:46,340 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:13:46,340 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2021-06-05 09:13:46,404 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:13:46,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:13:46,406 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:46,413 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:46,415 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:46,415 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2021-06-05 09:13:46,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:13:46,445 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:46,453 INFO L628 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2021-06-05 09:13:46,454 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:13:46,454 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2021-06-05 09:13:46,480 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:46,494 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-06-05 09:13:46,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 09:13:46,536 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:46,541 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:46,542 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:46,542 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:11 [2021-06-05 09:13:46,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:13:46,566 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:46,572 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:46,572 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:46,573 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2021-06-05 09:13:46,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2021-06-05 09:13:46,605 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:46,619 INFO L628 ElimStorePlain]: treesize reduction 4, result has 88.2 percent of original size [2021-06-05 09:13:46,619 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:46,619 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:30 [2021-06-05 09:13:46,693 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:13:46,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 22 [2021-06-05 09:13:46,694 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:46,699 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:46,700 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:46,700 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:14 [2021-06-05 09:13:46,769 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 28 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:46,769 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265003906] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:46,769 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:46,770 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2021-06-05 09:13:46,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179970775] [2021-06-05 09:13:46,770 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 09:13:46,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:46,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 09:13:46,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2021-06-05 09:13:46,771 INFO L87 Difference]: Start difference. First operand 16470 states and 34596 transitions. Second operand has 26 states, 26 states have (on average 6.846153846153846) internal successors, (178), 26 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:52,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:52,978 INFO L93 Difference]: Finished difference Result 25625 states and 53764 transitions. [2021-06-05 09:13:52,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2021-06-05 09:13:52,979 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.846153846153846) internal successors, (178), 26 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:13:52,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:53,010 INFO L225 Difference]: With dead ends: 25625 [2021-06-05 09:13:53,010 INFO L226 Difference]: Without dead ends: 25625 [2021-06-05 09:13:53,012 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11577 ImplicationChecksByTransitivity, 4180.4ms TimeCoverageRelationStatistics Valid=1831, Invalid=28619, Unknown=0, NotChecked=0, Total=30450 [2021-06-05 09:13:53,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25625 states. [2021-06-05 09:13:53,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25625 to 16436. [2021-06-05 09:13:53,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16436 states, 16436 states have (on average 2.099841810659528) internal successors, (34513), 16435 states have internal predecessors, (34513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:53,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16436 states to 16436 states and 34513 transitions. [2021-06-05 09:13:53,268 INFO L78 Accepts]: Start accepts. Automaton has 16436 states and 34513 transitions. Word has length 95 [2021-06-05 09:13:53,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:53,268 INFO L482 AbstractCegarLoop]: Abstraction has 16436 states and 34513 transitions. [2021-06-05 09:13:53,268 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 6.846153846153846) internal successors, (178), 26 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:53,268 INFO L276 IsEmpty]: Start isEmpty. Operand 16436 states and 34513 transitions. [2021-06-05 09:13:53,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:13:53,281 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:53,281 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:13:53,482 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,62 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:53,482 INFO L430 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:53,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:53,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1675165455, now seen corresponding path program 45 times [2021-06-05 09:13:53,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:53,482 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438559025] [2021-06-05 09:13:53,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:53,629 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:13:53,629 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:53,629 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438559025] [2021-06-05 09:13:53,629 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438559025] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:53,629 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038410496] [2021-06-05 09:13:53,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:53,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 09:13:53,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:53,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 52 conjunts are in the unsatisfiable core [2021-06-05 09:13:53,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:13:53,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 09:13:53,863 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:53,864 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:53,864 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:53,865 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 09:13:53,912 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:13:53,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 09:13:53,914 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:53,918 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:53,919 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:53,919 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2021-06-05 09:13:53,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:13:53,960 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:53,967 INFO L628 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2021-06-05 09:13:53,969 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:13:53,969 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2021-06-05 09:13:53,996 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:53,998 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:53,999 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:54,024 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:13:54,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:13:54,032 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:54,040 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:54,041 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:54,041 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2021-06-05 09:13:54,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:13:54,063 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:54,070 INFO L628 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2021-06-05 09:13:54,071 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:13:54,071 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2021-06-05 09:13:54,121 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:13:54,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:13:54,123 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:54,131 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:54,132 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:54,132 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2021-06-05 09:13:54,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:13:54,173 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:54,181 INFO L628 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2021-06-05 09:13:54,182 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:13:54,182 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2021-06-05 09:13:54,208 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:13:54,222 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-06-05 09:13:54,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 09:13:54,224 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:54,229 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:54,230 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:54,230 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:11 [2021-06-05 09:13:54,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:13:54,252 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:54,261 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:54,261 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:54,261 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2021-06-05 09:13:54,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-06-05 09:13:54,294 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:54,306 INFO L628 ElimStorePlain]: treesize reduction 4, result has 88.9 percent of original size [2021-06-05 09:13:54,306 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:54,307 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2021-06-05 09:13:54,387 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:13:54,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 24 [2021-06-05 09:13:54,389 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:13:54,393 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:13:54,394 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:13:54,394 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:14 [2021-06-05 09:13:54,453 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 34 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:54,453 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038410496] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:54,454 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:13:54,454 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2021-06-05 09:13:54,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790721863] [2021-06-05 09:13:54,454 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 09:13:54,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:13:54,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 09:13:54,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2021-06-05 09:13:54,454 INFO L87 Difference]: Start difference. First operand 16436 states and 34513 transitions. Second operand has 25 states, 25 states have (on average 6.92) internal successors, (173), 25 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:59,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:13:59,197 INFO L93 Difference]: Finished difference Result 25068 states and 52584 transitions. [2021-06-05 09:13:59,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2021-06-05 09:13:59,198 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.92) internal successors, (173), 25 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:13:59,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:13:59,226 INFO L225 Difference]: With dead ends: 25068 [2021-06-05 09:13:59,227 INFO L226 Difference]: Without dead ends: 25068 [2021-06-05 09:13:59,227 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5587 ImplicationChecksByTransitivity, 2856.9ms TimeCoverageRelationStatistics Valid=1119, Invalid=14631, Unknown=0, NotChecked=0, Total=15750 [2021-06-05 09:13:59,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25068 states. [2021-06-05 09:13:59,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25068 to 17217. [2021-06-05 09:13:59,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17217 states, 17217 states have (on average 2.098216878666434) internal successors, (36125), 17216 states have internal predecessors, (36125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17217 states to 17217 states and 36125 transitions. [2021-06-05 09:13:59,476 INFO L78 Accepts]: Start accepts. Automaton has 17217 states and 36125 transitions. Word has length 95 [2021-06-05 09:13:59,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:13:59,476 INFO L482 AbstractCegarLoop]: Abstraction has 17217 states and 36125 transitions. [2021-06-05 09:13:59,476 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 6.92) internal successors, (173), 25 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:13:59,476 INFO L276 IsEmpty]: Start isEmpty. Operand 17217 states and 36125 transitions. [2021-06-05 09:13:59,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:13:59,491 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:13:59,491 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:13:59,692 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,63 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:59,693 INFO L430 AbstractCegarLoop]: === Iteration 70 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:13:59,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:13:59,693 INFO L82 PathProgramCache]: Analyzing trace with hash 165129913, now seen corresponding path program 46 times [2021-06-05 09:13:59,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:13:59,693 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184154398] [2021-06-05 09:13:59,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:13:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:13:59,818 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:13:59,818 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:13:59,818 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184154398] [2021-06-05 09:13:59,818 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184154398] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:13:59,818 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497109343] [2021-06-05 09:13:59,818 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:13:59,893 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:13:59,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:13:59,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 39 conjunts are in the unsatisfiable core [2021-06-05 09:13:59,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:14:00,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:14:00,114 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:00,120 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:00,121 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:00,121 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:14:00,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:14:00,145 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:00,149 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:00,149 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:00,150 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:14:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:14:00,176 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497109343] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:00,176 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:14:00,176 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 23 [2021-06-05 09:14:00,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086736282] [2021-06-05 09:14:00,177 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 09:14:00,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:14:00,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 09:14:00,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2021-06-05 09:14:00,177 INFO L87 Difference]: Start difference. First operand 17217 states and 36125 transitions. Second operand has 23 states, 23 states have (on average 5.913043478260869) internal successors, (136), 23 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:01,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:14:01,196 INFO L93 Difference]: Finished difference Result 20258 states and 42463 transitions. [2021-06-05 09:14:01,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-06-05 09:14:01,197 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.913043478260869) internal successors, (136), 23 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:14:01,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:14:01,217 INFO L225 Difference]: With dead ends: 20258 [2021-06-05 09:14:01,217 INFO L226 Difference]: Without dead ends: 20258 [2021-06-05 09:14:01,217 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 507.0ms TimeCoverageRelationStatistics Valid=208, Invalid=1954, Unknown=0, NotChecked=0, Total=2162 [2021-06-05 09:14:01,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20258 states. [2021-06-05 09:14:01,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20258 to 17184. [2021-06-05 09:14:01,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17184 states, 17184 states have (on average 2.0982891061452515) internal successors, (36057), 17183 states have internal predecessors, (36057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:01,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17184 states to 17184 states and 36057 transitions. [2021-06-05 09:14:01,424 INFO L78 Accepts]: Start accepts. Automaton has 17184 states and 36057 transitions. Word has length 95 [2021-06-05 09:14:01,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:14:01,425 INFO L482 AbstractCegarLoop]: Abstraction has 17184 states and 36057 transitions. [2021-06-05 09:14:01,425 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 5.913043478260869) internal successors, (136), 23 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:01,425 INFO L276 IsEmpty]: Start isEmpty. Operand 17184 states and 36057 transitions. [2021-06-05 09:14:01,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:14:01,441 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:14:01,441 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:14:01,642 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,64 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:01,642 INFO L430 AbstractCegarLoop]: === Iteration 71 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:14:01,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:14:01,642 INFO L82 PathProgramCache]: Analyzing trace with hash -671850893, now seen corresponding path program 47 times [2021-06-05 09:14:01,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:14:01,642 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689034685] [2021-06-05 09:14:01,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:14:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:01,871 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 5 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:14:01,871 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:14:01,871 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689034685] [2021-06-05 09:14:01,871 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689034685] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:01,871 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976013164] [2021-06-05 09:14:01,871 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:01,972 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:14:01,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:14:01,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 39 conjunts are in the unsatisfiable core [2021-06-05 09:14:01,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:14:02,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:14:02,202 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:02,208 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:02,209 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:02,209 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:14:02,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:14:02,233 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:02,237 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:02,237 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:02,238 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:14:02,266 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 5 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:14:02,266 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976013164] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:02,266 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:14:02,267 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 24 [2021-06-05 09:14:02,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371467895] [2021-06-05 09:14:02,267 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 09:14:02,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:14:02,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 09:14:02,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2021-06-05 09:14:02,267 INFO L87 Difference]: Start difference. First operand 17184 states and 36057 transitions. Second operand has 24 states, 24 states have (on average 5.791666666666667) internal successors, (139), 24 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:03,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:14:03,435 INFO L93 Difference]: Finished difference Result 21646 states and 45366 transitions. [2021-06-05 09:14:03,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-06-05 09:14:03,435 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.791666666666667) internal successors, (139), 24 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:14:03,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:14:03,458 INFO L225 Difference]: With dead ends: 21646 [2021-06-05 09:14:03,458 INFO L226 Difference]: Without dead ends: 21646 [2021-06-05 09:14:03,459 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1055 ImplicationChecksByTransitivity, 733.7ms TimeCoverageRelationStatistics Valid=299, Invalid=3241, Unknown=0, NotChecked=0, Total=3540 [2021-06-05 09:14:03,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21646 states. [2021-06-05 09:14:03,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21646 to 18553. [2021-06-05 09:14:03,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18553 states, 18553 states have (on average 2.096588152859376) internal successors, (38898), 18552 states have internal predecessors, (38898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:03,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18553 states to 18553 states and 38898 transitions. [2021-06-05 09:14:03,689 INFO L78 Accepts]: Start accepts. Automaton has 18553 states and 38898 transitions. Word has length 95 [2021-06-05 09:14:03,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:14:03,690 INFO L482 AbstractCegarLoop]: Abstraction has 18553 states and 38898 transitions. [2021-06-05 09:14:03,690 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 5.791666666666667) internal successors, (139), 24 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:03,690 INFO L276 IsEmpty]: Start isEmpty. Operand 18553 states and 38898 transitions. [2021-06-05 09:14:03,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:14:03,705 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:14:03,705 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:14:03,905 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,65 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:03,906 INFO L430 AbstractCegarLoop]: === Iteration 72 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:14:03,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:14:03,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1252488601, now seen corresponding path program 48 times [2021-06-05 09:14:03,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:14:03,906 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013294621] [2021-06-05 09:14:03,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:14:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:04,049 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:14:04,050 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:14:04,050 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013294621] [2021-06-05 09:14:04,050 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013294621] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:04,050 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614137052] [2021-06-05 09:14:04,050 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:04,145 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 09:14:04,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:14:04,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 52 conjunts are in the unsatisfiable core [2021-06-05 09:14:04,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:14:04,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 09:14:04,181 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:04,182 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:04,182 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:04,183 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 09:14:04,224 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:14:04,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 09:14:04,225 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:04,229 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:04,229 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:04,229 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2021-06-05 09:14:04,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:14:04,261 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:04,266 INFO L628 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2021-06-05 09:14:04,267 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:14:04,267 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2021-06-05 09:14:04,291 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:14:04,292 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:14:04,293 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:14:04,314 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:14:04,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:14:04,316 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:04,322 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:04,323 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:04,324 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2021-06-05 09:14:04,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:14:04,345 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:04,351 INFO L628 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2021-06-05 09:14:04,352 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:14:04,352 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2021-06-05 09:14:04,424 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:14:04,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:14:04,426 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:04,436 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:04,438 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:04,438 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2021-06-05 09:14:04,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:14:04,473 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:04,484 INFO L628 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2021-06-05 09:14:04,485 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:14:04,486 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2021-06-05 09:14:04,517 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:14:04,532 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-06-05 09:14:04,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 09:14:04,535 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:04,540 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:04,541 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:04,541 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:11 [2021-06-05 09:14:04,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:14:04,564 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:04,569 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:04,570 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:04,570 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2021-06-05 09:14:04,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2021-06-05 09:14:04,598 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:04,611 INFO L628 ElimStorePlain]: treesize reduction 4, result has 88.2 percent of original size [2021-06-05 09:14:04,611 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:04,611 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:30 [2021-06-05 09:14:04,678 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:14:04,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 22 [2021-06-05 09:14:04,679 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:04,684 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:04,685 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:04,685 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:14 [2021-06-05 09:14:04,746 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 34 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:14:04,746 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614137052] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:04,746 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:14:04,746 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2021-06-05 09:14:04,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269321669] [2021-06-05 09:14:04,747 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 09:14:04,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:14:04,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 09:14:04,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2021-06-05 09:14:04,747 INFO L87 Difference]: Start difference. First operand 18553 states and 38898 transitions. Second operand has 26 states, 26 states have (on average 6.730769230769231) internal successors, (175), 26 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:10,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:14:10,950 INFO L93 Difference]: Finished difference Result 28649 states and 60022 transitions. [2021-06-05 09:14:10,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2021-06-05 09:14:10,951 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.730769230769231) internal successors, (175), 26 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:14:10,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:14:10,981 INFO L225 Difference]: With dead ends: 28649 [2021-06-05 09:14:10,981 INFO L226 Difference]: Without dead ends: 28649 [2021-06-05 09:14:10,983 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11438 ImplicationChecksByTransitivity, 4123.6ms TimeCoverageRelationStatistics Valid=1819, Invalid=27937, Unknown=0, NotChecked=0, Total=29756 [2021-06-05 09:14:11,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28649 states. [2021-06-05 09:14:11,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28649 to 17840. [2021-06-05 09:14:11,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17840 states, 17840 states have (on average 2.0992713004484305) internal successors, (37451), 17839 states have internal predecessors, (37451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17840 states to 17840 states and 37451 transitions. [2021-06-05 09:14:11,247 INFO L78 Accepts]: Start accepts. Automaton has 17840 states and 37451 transitions. Word has length 95 [2021-06-05 09:14:11,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:14:11,247 INFO L482 AbstractCegarLoop]: Abstraction has 17840 states and 37451 transitions. [2021-06-05 09:14:11,247 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 6.730769230769231) internal successors, (175), 26 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:11,247 INFO L276 IsEmpty]: Start isEmpty. Operand 17840 states and 37451 transitions. [2021-06-05 09:14:11,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:14:11,262 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:14:11,262 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:14:11,462 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable74 [2021-06-05 09:14:11,463 INFO L430 AbstractCegarLoop]: === Iteration 73 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:14:11,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:14:11,463 INFO L82 PathProgramCache]: Analyzing trace with hash -841920531, now seen corresponding path program 49 times [2021-06-05 09:14:11,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:14:11,463 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559289980] [2021-06-05 09:14:11,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:14:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:11,605 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:14:11,606 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:14:11,606 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559289980] [2021-06-05 09:14:11,606 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559289980] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:11,606 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34502834] [2021-06-05 09:14:11,606 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:11,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 44 conjunts are in the unsatisfiable core [2021-06-05 09:14:11,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:14:11,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-06-05 09:14:11,922 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:11,941 INFO L628 ElimStorePlain]: treesize reduction 4, result has 90.5 percent of original size [2021-06-05 09:14:11,942 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:11,942 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:41 [2021-06-05 09:14:11,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:14:11,978 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:11,981 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:11,982 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:11,982 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:14:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:14:12,007 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34502834] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:12,007 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:14:12,007 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 24 [2021-06-05 09:14:12,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519459442] [2021-06-05 09:14:12,008 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 09:14:12,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:14:12,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 09:14:12,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2021-06-05 09:14:12,008 INFO L87 Difference]: Start difference. First operand 17840 states and 37451 transitions. Second operand has 24 states, 24 states have (on average 5.541666666666667) internal successors, (133), 24 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:13,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:14:13,146 INFO L93 Difference]: Finished difference Result 20015 states and 42002 transitions. [2021-06-05 09:14:13,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-06-05 09:14:13,146 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.541666666666667) internal successors, (133), 24 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:14:13,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:14:13,166 INFO L225 Difference]: With dead ends: 20015 [2021-06-05 09:14:13,167 INFO L226 Difference]: Without dead ends: 20015 [2021-06-05 09:14:13,167 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 610.0ms TimeCoverageRelationStatistics Valid=248, Invalid=2302, Unknown=0, NotChecked=0, Total=2550 [2021-06-05 09:14:13,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20015 states. [2021-06-05 09:14:13,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20015 to 17840. [2021-06-05 09:14:13,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17840 states, 17840 states have (on average 2.0992713004484305) internal successors, (37451), 17839 states have internal predecessors, (37451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:13,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17840 states to 17840 states and 37451 transitions. [2021-06-05 09:14:13,430 INFO L78 Accepts]: Start accepts. Automaton has 17840 states and 37451 transitions. Word has length 95 [2021-06-05 09:14:13,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:14:13,430 INFO L482 AbstractCegarLoop]: Abstraction has 17840 states and 37451 transitions. [2021-06-05 09:14:13,430 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 5.541666666666667) internal successors, (133), 24 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:13,430 INFO L276 IsEmpty]: Start isEmpty. Operand 17840 states and 37451 transitions. [2021-06-05 09:14:13,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:14:13,445 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:14:13,445 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:14:13,646 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable75 [2021-06-05 09:14:13,647 INFO L430 AbstractCegarLoop]: === Iteration 74 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:14:13,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:14:13,647 INFO L82 PathProgramCache]: Analyzing trace with hash -268665120, now seen corresponding path program 50 times [2021-06-05 09:14:13,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:14:13,647 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867775905] [2021-06-05 09:14:13,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:14:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:13,783 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:14:13,783 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:14:13,783 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867775905] [2021-06-05 09:14:13,783 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867775905] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:13,783 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001294875] [2021-06-05 09:14:13,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:13,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:14:13,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:14:13,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 52 conjunts are in the unsatisfiable core [2021-06-05 09:14:13,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:14:13,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 09:14:13,885 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:13,886 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:13,886 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:13,886 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 09:14:13,919 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:14:13,920 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 09:14:13,921 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:13,924 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:13,925 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:13,925 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2021-06-05 09:14:13,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:14:13,965 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:13,971 INFO L628 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2021-06-05 09:14:13,972 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:14:13,972 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2021-06-05 09:14:14,034 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:14:14,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:14:14,036 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:14,042 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:14,044 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:14,044 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2021-06-05 09:14:14,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:14:14,061 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:14,067 INFO L628 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2021-06-05 09:14:14,068 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:14:14,068 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2021-06-05 09:14:14,092 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:14:14,115 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:14:14,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:14:14,117 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:14,125 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:14,126 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:14,126 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2021-06-05 09:14:14,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:14:14,163 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:14,171 INFO L628 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2021-06-05 09:14:14,172 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:14:14,172 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2021-06-05 09:14:14,213 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-06-05 09:14:14,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 09:14:14,214 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:14,219 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:14,220 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:14,220 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:11 [2021-06-05 09:14:14,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:14:14,243 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:14,250 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:14,250 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:14,250 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2021-06-05 09:14:14,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-06-05 09:14:14,283 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:14,295 INFO L628 ElimStorePlain]: treesize reduction 4, result has 88.2 percent of original size [2021-06-05 09:14:14,296 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:14,296 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:30 [2021-06-05 09:14:14,365 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:14:14,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 22 [2021-06-05 09:14:14,366 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:14,371 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:14,372 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:14,372 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:12 [2021-06-05 09:14:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 29 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 09:14:14,430 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001294875] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:14,430 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:14:14,431 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2021-06-05 09:14:14,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157633461] [2021-06-05 09:14:14,431 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 09:14:14,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:14:14,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 09:14:14,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2021-06-05 09:14:14,432 INFO L87 Difference]: Start difference. First operand 17840 states and 37451 transitions. Second operand has 26 states, 26 states have (on average 6.538461538461538) internal successors, (170), 26 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:20,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:14:20,889 INFO L93 Difference]: Finished difference Result 34128 states and 71426 transitions. [2021-06-05 09:14:20,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2021-06-05 09:14:20,890 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.538461538461538) internal successors, (170), 26 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:14:20,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:14:20,930 INFO L225 Difference]: With dead ends: 34128 [2021-06-05 09:14:20,930 INFO L226 Difference]: Without dead ends: 34128 [2021-06-05 09:14:20,932 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10892 ImplicationChecksByTransitivity, 3785.2ms TimeCoverageRelationStatistics Valid=1716, Invalid=27014, Unknown=0, NotChecked=0, Total=28730 [2021-06-05 09:14:20,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34128 states. [2021-06-05 09:14:21,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34128 to 20023. [2021-06-05 09:14:21,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20023 states, 20023 states have (on average 2.094840932927134) internal successors, (41945), 20022 states have internal predecessors, (41945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:21,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20023 states to 20023 states and 41945 transitions. [2021-06-05 09:14:21,240 INFO L78 Accepts]: Start accepts. Automaton has 20023 states and 41945 transitions. Word has length 95 [2021-06-05 09:14:21,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:14:21,240 INFO L482 AbstractCegarLoop]: Abstraction has 20023 states and 41945 transitions. [2021-06-05 09:14:21,240 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 6.538461538461538) internal successors, (170), 26 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:21,240 INFO L276 IsEmpty]: Start isEmpty. Operand 20023 states and 41945 transitions. [2021-06-05 09:14:21,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:14:21,256 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:14:21,256 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:14:21,457 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,68 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:21,457 INFO L430 AbstractCegarLoop]: === Iteration 75 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:14:21,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:14:21,457 INFO L82 PathProgramCache]: Analyzing trace with hash -2114499654, now seen corresponding path program 51 times [2021-06-05 09:14:21,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:14:21,457 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500400474] [2021-06-05 09:14:21,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:14:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:21,677 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 31 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 09:14:21,677 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:14:21,677 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500400474] [2021-06-05 09:14:21,677 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500400474] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:21,677 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109405303] [2021-06-05 09:14:21,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:21,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 09:14:21,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:14:21,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 09:14:21,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:14:21,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:14:21,822 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:21,824 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:21,824 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:21,824 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2021-06-05 09:14:21,894 INFO L354 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-06-05 09:14:21,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2021-06-05 09:14:21,895 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:21,903 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:21,905 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:21,905 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:13 [2021-06-05 09:14:21,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-06-05 09:14:21,927 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:21,928 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:21,928 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:21,928 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2021-06-05 09:14:21,970 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-06-05 09:14:21,971 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109405303] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:14:21,971 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:14:21,971 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 20 [2021-06-05 09:14:21,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796438144] [2021-06-05 09:14:21,971 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 09:14:21,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:14:21,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 09:14:21,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2021-06-05 09:14:21,972 INFO L87 Difference]: Start difference. First operand 20023 states and 41945 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:22,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:14:22,254 INFO L93 Difference]: Finished difference Result 20877 states and 43868 transitions. [2021-06-05 09:14:22,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:14:22,254 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:14:22,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:14:22,276 INFO L225 Difference]: With dead ends: 20877 [2021-06-05 09:14:22,276 INFO L226 Difference]: Without dead ends: 20877 [2021-06-05 09:14:22,276 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 348.7ms TimeCoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2021-06-05 09:14:22,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20877 states. [2021-06-05 09:14:22,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20877 to 20034. [2021-06-05 09:14:22,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20034 states, 20034 states have (on average 2.095337925526605) internal successors, (41978), 20033 states have internal predecessors, (41978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:22,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20034 states to 20034 states and 41978 transitions. [2021-06-05 09:14:22,506 INFO L78 Accepts]: Start accepts. Automaton has 20034 states and 41978 transitions. Word has length 95 [2021-06-05 09:14:22,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:14:22,506 INFO L482 AbstractCegarLoop]: Abstraction has 20034 states and 41978 transitions. [2021-06-05 09:14:22,506 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:22,507 INFO L276 IsEmpty]: Start isEmpty. Operand 20034 states and 41978 transitions. [2021-06-05 09:14:22,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:14:22,523 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:14:22,523 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:14:22,733 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2021-06-05 09:14:22,733 INFO L430 AbstractCegarLoop]: === Iteration 76 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:14:22,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:14:22,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1110457482, now seen corresponding path program 52 times [2021-06-05 09:14:22,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:14:22,733 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484217266] [2021-06-05 09:14:22,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:14:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:22,867 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 31 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 09:14:22,867 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:14:22,867 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484217266] [2021-06-05 09:14:22,867 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484217266] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:22,867 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899817656] [2021-06-05 09:14:22,867 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:22,949 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:14:22,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:14:22,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 39 conjunts are in the unsatisfiable core [2021-06-05 09:14:22,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:14:23,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:14:23,174 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:23,180 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:23,181 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:23,181 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:14:23,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:14:23,206 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:23,210 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:23,210 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:23,210 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:14:23,236 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:14:23,236 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899817656] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:23,236 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:14:23,236 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 24 [2021-06-05 09:14:23,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754934643] [2021-06-05 09:14:23,237 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 09:14:23,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:14:23,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 09:14:23,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2021-06-05 09:14:23,237 INFO L87 Difference]: Start difference. First operand 20034 states and 41978 transitions. Second operand has 24 states, 24 states have (on average 5.541666666666667) internal successors, (133), 24 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:14:24,798 INFO L93 Difference]: Finished difference Result 23985 states and 50192 transitions. [2021-06-05 09:14:24,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-06-05 09:14:24,799 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.541666666666667) internal successors, (133), 24 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:14:24,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:14:24,824 INFO L225 Difference]: With dead ends: 23985 [2021-06-05 09:14:24,824 INFO L226 Difference]: Without dead ends: 23985 [2021-06-05 09:14:24,824 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1487 ImplicationChecksByTransitivity, 849.9ms TimeCoverageRelationStatistics Valid=375, Invalid=4317, Unknown=0, NotChecked=0, Total=4692 [2021-06-05 09:14:24,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23985 states. [2021-06-05 09:14:25,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23985 to 20007. [2021-06-05 09:14:25,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20007 states, 20007 states have (on average 2.095016744139551) internal successors, (41915), 20006 states have internal predecessors, (41915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20007 states to 20007 states and 41915 transitions. [2021-06-05 09:14:25,189 INFO L78 Accepts]: Start accepts. Automaton has 20007 states and 41915 transitions. Word has length 95 [2021-06-05 09:14:25,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:14:25,190 INFO L482 AbstractCegarLoop]: Abstraction has 20007 states and 41915 transitions. [2021-06-05 09:14:25,190 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 5.541666666666667) internal successors, (133), 24 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:25,190 INFO L276 IsEmpty]: Start isEmpty. Operand 20007 states and 41915 transitions. [2021-06-05 09:14:25,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:14:25,209 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:14:25,209 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:14:25,410 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,70 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:25,410 INFO L430 AbstractCegarLoop]: === Iteration 77 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:14:25,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:14:25,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1643012038, now seen corresponding path program 53 times [2021-06-05 09:14:25,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:14:25,411 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779263505] [2021-06-05 09:14:25,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:14:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:25,560 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 09:14:25,560 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:14:25,560 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779263505] [2021-06-05 09:14:25,560 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779263505] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:25,560 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760686541] [2021-06-05 09:14:25,560 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:25,667 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 09:14:25,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:14:25,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 39 conjunts are in the unsatisfiable core [2021-06-05 09:14:25,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:14:25,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:14:25,917 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:25,923 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:25,924 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:25,924 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:14:25,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:14:25,951 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:25,955 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:25,956 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:25,956 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:14:25,983 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:14:25,984 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760686541] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:25,984 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:14:25,984 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 24 [2021-06-05 09:14:25,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740351206] [2021-06-05 09:14:25,984 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 09:14:25,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:14:25,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 09:14:25,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2021-06-05 09:14:25,985 INFO L87 Difference]: Start difference. First operand 20007 states and 41915 transitions. Second operand has 24 states, 24 states have (on average 5.541666666666667) internal successors, (133), 24 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:27,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:14:27,280 INFO L93 Difference]: Finished difference Result 23418 states and 49071 transitions. [2021-06-05 09:14:27,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-06-05 09:14:27,281 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.541666666666667) internal successors, (133), 24 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:14:27,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:14:27,306 INFO L225 Difference]: With dead ends: 23418 [2021-06-05 09:14:27,306 INFO L226 Difference]: Without dead ends: 23418 [2021-06-05 09:14:27,306 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1021 ImplicationChecksByTransitivity, 780.4ms TimeCoverageRelationStatistics Valid=340, Invalid=3082, Unknown=0, NotChecked=0, Total=3422 [2021-06-05 09:14:27,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23418 states. [2021-06-05 09:14:27,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23418 to 20798. [2021-06-05 09:14:27,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20798 states, 20798 states have (on average 2.09467256466968) internal successors, (43565), 20797 states have internal predecessors, (43565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:27,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20798 states to 20798 states and 43565 transitions. [2021-06-05 09:14:27,574 INFO L78 Accepts]: Start accepts. Automaton has 20798 states and 43565 transitions. Word has length 95 [2021-06-05 09:14:27,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:14:27,574 INFO L482 AbstractCegarLoop]: Abstraction has 20798 states and 43565 transitions. [2021-06-05 09:14:27,574 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 5.541666666666667) internal successors, (133), 24 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:27,574 INFO L276 IsEmpty]: Start isEmpty. Operand 20798 states and 43565 transitions. [2021-06-05 09:14:27,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:14:27,592 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:14:27,592 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:14:27,793 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2021-06-05 09:14:27,793 INFO L430 AbstractCegarLoop]: === Iteration 78 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:14:27,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:14:27,793 INFO L82 PathProgramCache]: Analyzing trace with hash -514252989, now seen corresponding path program 54 times [2021-06-05 09:14:27,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:14:27,793 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972694931] [2021-06-05 09:14:27,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:14:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:27,929 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:14:27,929 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:14:27,929 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972694931] [2021-06-05 09:14:27,929 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972694931] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:27,929 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992210978] [2021-06-05 09:14:27,929 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:28,058 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 09:14:28,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:14:28,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 39 conjunts are in the unsatisfiable core [2021-06-05 09:14:28,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:14:28,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:14:28,320 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:28,326 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:28,326 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:28,326 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:14:28,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:14:28,351 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:28,355 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:28,355 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:28,355 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:14:28,381 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:14:28,381 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992210978] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:28,381 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:14:28,382 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 24 [2021-06-05 09:14:28,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248367602] [2021-06-05 09:14:28,382 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 09:14:28,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:14:28,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 09:14:28,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2021-06-05 09:14:28,382 INFO L87 Difference]: Start difference. First operand 20798 states and 43565 transitions. Second operand has 24 states, 24 states have (on average 5.541666666666667) internal successors, (133), 24 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:29,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:14:29,546 INFO L93 Difference]: Finished difference Result 25495 states and 53393 transitions. [2021-06-05 09:14:29,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-06-05 09:14:29,546 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.541666666666667) internal successors, (133), 24 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:14:29,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:14:29,577 INFO L225 Difference]: With dead ends: 25495 [2021-06-05 09:14:29,577 INFO L226 Difference]: Without dead ends: 25495 [2021-06-05 09:14:29,577 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 639.7ms TimeCoverageRelationStatistics Valid=216, Invalid=2136, Unknown=0, NotChecked=0, Total=2352 [2021-06-05 09:14:29,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25495 states. [2021-06-05 09:14:29,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25495 to 21238. [2021-06-05 09:14:29,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21238 states, 21238 states have (on average 2.0946416800075336) internal successors, (44486), 21237 states have internal predecessors, (44486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:29,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21238 states to 21238 states and 44486 transitions. [2021-06-05 09:14:29,845 INFO L78 Accepts]: Start accepts. Automaton has 21238 states and 44486 transitions. Word has length 95 [2021-06-05 09:14:29,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:14:29,845 INFO L482 AbstractCegarLoop]: Abstraction has 21238 states and 44486 transitions. [2021-06-05 09:14:29,845 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 5.541666666666667) internal successors, (133), 24 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:29,845 INFO L276 IsEmpty]: Start isEmpty. Operand 21238 states and 44486 transitions. [2021-06-05 09:14:29,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:14:29,862 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:14:29,862 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:14:30,063 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,72 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:30,063 INFO L430 AbstractCegarLoop]: === Iteration 79 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:14:30,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:14:30,063 INFO L82 PathProgramCache]: Analyzing trace with hash 618385348, now seen corresponding path program 55 times [2021-06-05 09:14:30,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:14:30,064 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950816634] [2021-06-05 09:14:30,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:14:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:30,174 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 31 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 09:14:30,174 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:14:30,174 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950816634] [2021-06-05 09:14:30,174 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950816634] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:30,174 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037758031] [2021-06-05 09:14:30,174 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:30,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 39 conjunts are in the unsatisfiable core [2021-06-05 09:14:30,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:14:30,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:14:30,524 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:30,531 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:30,532 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:30,532 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:14:30,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:14:30,562 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:30,566 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:30,567 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:30,567 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:14:30,597 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:14:30,597 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037758031] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:30,597 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:14:30,598 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 24 [2021-06-05 09:14:30,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611217641] [2021-06-05 09:14:30,598 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 09:14:30,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:14:30,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 09:14:30,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2021-06-05 09:14:30,598 INFO L87 Difference]: Start difference. First operand 21238 states and 44486 transitions. Second operand has 24 states, 24 states have (on average 5.666666666666667) internal successors, (136), 24 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:32,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:14:32,030 INFO L93 Difference]: Finished difference Result 28795 states and 60354 transitions. [2021-06-05 09:14:32,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-06-05 09:14:32,030 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.666666666666667) internal successors, (136), 24 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:14:32,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:14:32,062 INFO L225 Difference]: With dead ends: 28795 [2021-06-05 09:14:32,062 INFO L226 Difference]: Without dead ends: 28795 [2021-06-05 09:14:32,063 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1019 ImplicationChecksByTransitivity, 759.4ms TimeCoverageRelationStatistics Valid=300, Invalid=3122, Unknown=0, NotChecked=0, Total=3422 [2021-06-05 09:14:32,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28795 states. [2021-06-05 09:14:32,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28795 to 23180. [2021-06-05 09:14:32,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23180 states, 23180 states have (on average 2.0977566867989648) internal successors, (48626), 23179 states have internal predecessors, (48626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:32,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23180 states to 23180 states and 48626 transitions. [2021-06-05 09:14:32,364 INFO L78 Accepts]: Start accepts. Automaton has 23180 states and 48626 transitions. Word has length 95 [2021-06-05 09:14:32,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:14:32,364 INFO L482 AbstractCegarLoop]: Abstraction has 23180 states and 48626 transitions. [2021-06-05 09:14:32,364 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 5.666666666666667) internal successors, (136), 24 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:32,364 INFO L276 IsEmpty]: Start isEmpty. Operand 23180 states and 48626 transitions. [2021-06-05 09:14:32,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:14:32,383 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:14:32,383 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:14:32,583 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,73 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:32,583 INFO L430 AbstractCegarLoop]: === Iteration 80 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:14:32,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:14:32,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1311819972, now seen corresponding path program 56 times [2021-06-05 09:14:32,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:14:32,584 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167335892] [2021-06-05 09:14:32,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:14:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:32,711 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 31 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 09:14:32,711 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:14:32,711 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167335892] [2021-06-05 09:14:32,711 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167335892] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:32,711 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405228362] [2021-06-05 09:14:32,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:32,906 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:14:32,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:14:32,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 39 conjunts are in the unsatisfiable core [2021-06-05 09:14:32,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:14:33,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:14:33,207 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:33,213 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:33,213 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:33,213 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:14:33,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:14:33,239 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:33,243 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:33,244 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:33,244 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:14:33,270 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:14:33,270 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405228362] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:33,271 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:14:33,271 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 25 [2021-06-05 09:14:33,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115050241] [2021-06-05 09:14:33,271 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 09:14:33,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:14:33,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 09:14:33,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2021-06-05 09:14:33,271 INFO L87 Difference]: Start difference. First operand 23180 states and 48626 transitions. Second operand has 25 states, 25 states have (on average 5.44) internal successors, (136), 25 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:34,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:14:34,827 INFO L93 Difference]: Finished difference Result 31192 states and 65504 transitions. [2021-06-05 09:14:34,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-06-05 09:14:34,827 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.44) internal successors, (136), 25 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:14:34,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:14:34,866 INFO L225 Difference]: With dead ends: 31192 [2021-06-05 09:14:34,866 INFO L226 Difference]: Without dead ends: 31192 [2021-06-05 09:14:34,867 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1498 ImplicationChecksByTransitivity, 942.0ms TimeCoverageRelationStatistics Valid=399, Invalid=4431, Unknown=0, NotChecked=0, Total=4830 [2021-06-05 09:14:34,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31192 states. [2021-06-05 09:14:35,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31192 to 22268. [2021-06-05 09:14:35,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22268 states, 22268 states have (on average 2.0938566552901023) internal successors, (46626), 22267 states have internal predecessors, (46626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:35,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22268 states to 22268 states and 46626 transitions. [2021-06-05 09:14:35,196 INFO L78 Accepts]: Start accepts. Automaton has 22268 states and 46626 transitions. Word has length 95 [2021-06-05 09:14:35,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:14:35,197 INFO L482 AbstractCegarLoop]: Abstraction has 22268 states and 46626 transitions. [2021-06-05 09:14:35,197 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 5.44) internal successors, (136), 25 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:35,197 INFO L276 IsEmpty]: Start isEmpty. Operand 22268 states and 46626 transitions. [2021-06-05 09:14:35,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:14:35,215 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:14:35,215 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:14:35,415 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,74 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:35,415 INFO L430 AbstractCegarLoop]: === Iteration 81 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:14:35,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:14:35,416 INFO L82 PathProgramCache]: Analyzing trace with hash -963431228, now seen corresponding path program 57 times [2021-06-05 09:14:35,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:14:35,416 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790330332] [2021-06-05 09:14:35,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:14:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:35,550 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:14:35,550 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:14:35,550 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790330332] [2021-06-05 09:14:35,550 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790330332] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:35,550 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135257586] [2021-06-05 09:14:35,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:35,669 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 09:14:35,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:14:35,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 38 conjunts are in the unsatisfiable core [2021-06-05 09:14:35,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:14:35,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:14:35,741 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:35,744 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:35,745 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:35,745 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2021-06-05 09:14:35,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-06-05 09:14:35,764 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:35,766 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:35,766 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:35,766 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2021-06-05 09:14:35,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2021-06-05 09:14:35,906 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:35,910 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:35,911 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:35,911 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2021-06-05 09:14:35,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2021-06-05 09:14:35,955 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:35,957 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:35,958 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:35,958 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:14 [2021-06-05 09:14:35,991 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 23 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 09:14:35,992 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135257586] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:35,992 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:14:35,992 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2021-06-05 09:14:35,992 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350796909] [2021-06-05 09:14:35,992 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 09:14:35,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:14:35,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 09:14:35,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2021-06-05 09:14:35,993 INFO L87 Difference]: Start difference. First operand 22268 states and 46626 transitions. Second operand has 23 states, 23 states have (on average 7.173913043478261) internal successors, (165), 23 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:37,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:14:37,912 INFO L93 Difference]: Finished difference Result 28018 states and 58358 transitions. [2021-06-05 09:14:37,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-06-05 09:14:37,912 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.173913043478261) internal successors, (165), 23 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:14:37,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:14:37,945 INFO L225 Difference]: With dead ends: 28018 [2021-06-05 09:14:37,945 INFO L226 Difference]: Without dead ends: 28018 [2021-06-05 09:14:37,946 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 1380.9ms TimeCoverageRelationStatistics Valid=516, Invalid=3644, Unknown=0, NotChecked=0, Total=4160 [2021-06-05 09:14:37,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28018 states. [2021-06-05 09:14:38,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28018 to 23205. [2021-06-05 09:14:38,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23205 states, 23205 states have (on average 2.0852833441068737) internal successors, (48389), 23204 states have internal predecessors, (48389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:38,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23205 states to 23205 states and 48389 transitions. [2021-06-05 09:14:38,254 INFO L78 Accepts]: Start accepts. Automaton has 23205 states and 48389 transitions. Word has length 95 [2021-06-05 09:14:38,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:14:38,254 INFO L482 AbstractCegarLoop]: Abstraction has 23205 states and 48389 transitions. [2021-06-05 09:14:38,254 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 7.173913043478261) internal successors, (165), 23 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:38,254 INFO L276 IsEmpty]: Start isEmpty. Operand 23205 states and 48389 transitions. [2021-06-05 09:14:38,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 09:14:38,273 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:14:38,273 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:14:38,473 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,75 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:38,474 INFO L430 AbstractCegarLoop]: === Iteration 82 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:14:38,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:14:38,474 INFO L82 PathProgramCache]: Analyzing trace with hash 971422819, now seen corresponding path program 58 times [2021-06-05 09:14:38,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:14:38,474 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023068868] [2021-06-05 09:14:38,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:14:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:38,611 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:14:38,611 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:14:38,611 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023068868] [2021-06-05 09:14:38,611 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023068868] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:38,611 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575782291] [2021-06-05 09:14:38,611 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:38,683 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:14:38,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:14:38,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 44 conjunts are in the unsatisfiable core [2021-06-05 09:14:38,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:14:38,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:14:38,942 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:38,948 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:38,949 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:38,949 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:14:38,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:14:38,974 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:38,978 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:38,979 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:38,979 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:14:39,006 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:14:39,006 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575782291] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:39,006 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:14:39,006 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 24 [2021-06-05 09:14:39,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092656460] [2021-06-05 09:14:39,006 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 09:14:39,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:14:39,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 09:14:39,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2021-06-05 09:14:39,007 INFO L87 Difference]: Start difference. First operand 23205 states and 48389 transitions. Second operand has 24 states, 24 states have (on average 5.541666666666667) internal successors, (133), 24 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:40,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:14:40,327 INFO L93 Difference]: Finished difference Result 26384 states and 54972 transitions. [2021-06-05 09:14:40,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-06-05 09:14:40,328 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.541666666666667) internal successors, (133), 24 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-06-05 09:14:40,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:14:40,357 INFO L225 Difference]: With dead ends: 26384 [2021-06-05 09:14:40,357 INFO L226 Difference]: Without dead ends: 26384 [2021-06-05 09:14:40,357 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 702.8ms TimeCoverageRelationStatistics Valid=260, Invalid=2602, Unknown=0, NotChecked=0, Total=2862 [2021-06-05 09:14:40,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26384 states. [2021-06-05 09:14:40,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26384 to 23185. [2021-06-05 09:14:40,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23185 states, 23185 states have (on average 2.0851843864567607) internal successors, (48345), 23184 states have internal predecessors, (48345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23185 states to 23185 states and 48345 transitions. [2021-06-05 09:14:40,640 INFO L78 Accepts]: Start accepts. Automaton has 23185 states and 48345 transitions. Word has length 95 [2021-06-05 09:14:40,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:14:40,640 INFO L482 AbstractCegarLoop]: Abstraction has 23185 states and 48345 transitions. [2021-06-05 09:14:40,640 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 5.541666666666667) internal successors, (133), 24 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:40,640 INFO L276 IsEmpty]: Start isEmpty. Operand 23185 states and 48345 transitions. [2021-06-05 09:14:40,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-06-05 09:14:40,660 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:14:40,660 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:14:40,861 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,76 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:40,861 INFO L430 AbstractCegarLoop]: === Iteration 83 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:14:40,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:14:40,861 INFO L82 PathProgramCache]: Analyzing trace with hash -393230846, now seen corresponding path program 59 times [2021-06-05 09:14:40,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:14:40,861 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753497198] [2021-06-05 09:14:40,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:14:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:40,991 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-06-05 09:14:40,992 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:14:40,992 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753497198] [2021-06-05 09:14:40,992 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753497198] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:40,992 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518025276] [2021-06-05 09:14:40,992 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:41,223 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-06-05 09:14:41,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:14:41,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 50 conjunts are in the unsatisfiable core [2021-06-05 09:14:41,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:14:41,371 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2021-06-05 09:14:41,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:14:41,678 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:41,685 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:41,686 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:41,686 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:14:41,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:14:41,713 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:41,717 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:41,717 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:41,717 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:14:41,744 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:14:41,745 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518025276] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:41,745 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:14:41,745 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20] total 28 [2021-06-05 09:14:41,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444857065] [2021-06-05 09:14:41,745 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 09:14:41,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:14:41,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 09:14:41,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2021-06-05 09:14:41,745 INFO L87 Difference]: Start difference. First operand 23185 states and 48345 transitions. Second operand has 28 states, 28 states have (on average 5.857142857142857) internal successors, (164), 28 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:43,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:14:43,425 INFO L93 Difference]: Finished difference Result 32137 states and 67040 transitions. [2021-06-05 09:14:43,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-06-05 09:14:43,425 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.857142857142857) internal successors, (164), 28 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2021-06-05 09:14:43,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:14:43,463 INFO L225 Difference]: With dead ends: 32137 [2021-06-05 09:14:43,463 INFO L226 Difference]: Without dead ends: 32137 [2021-06-05 09:14:43,464 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1668 ImplicationChecksByTransitivity, 946.0ms TimeCoverageRelationStatistics Valid=377, Invalid=4879, Unknown=0, NotChecked=0, Total=5256 [2021-06-05 09:14:43,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32137 states. [2021-06-05 09:14:43,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32137 to 25445. [2021-06-05 09:14:43,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25445 states, 25445 states have (on average 2.0883081155433287) internal successors, (53137), 25444 states have internal predecessors, (53137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:43,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25445 states to 25445 states and 53137 transitions. [2021-06-05 09:14:43,816 INFO L78 Accepts]: Start accepts. Automaton has 25445 states and 53137 transitions. Word has length 110 [2021-06-05 09:14:43,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:14:43,816 INFO L482 AbstractCegarLoop]: Abstraction has 25445 states and 53137 transitions. [2021-06-05 09:14:43,816 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 5.857142857142857) internal successors, (164), 28 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:43,816 INFO L276 IsEmpty]: Start isEmpty. Operand 25445 states and 53137 transitions. [2021-06-05 09:14:43,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-06-05 09:14:43,836 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:14:43,836 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:14:44,045 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,77 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:44,045 INFO L430 AbstractCegarLoop]: === Iteration 84 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:14:44,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:14:44,045 INFO L82 PathProgramCache]: Analyzing trace with hash -83205102, now seen corresponding path program 60 times [2021-06-05 09:14:44,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:14:44,045 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574569896] [2021-06-05 09:14:44,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:14:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:44,191 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 18 proven. 47 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-05 09:14:44,192 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:14:44,192 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574569896] [2021-06-05 09:14:44,192 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574569896] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:44,192 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569857785] [2021-06-05 09:14:44,192 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:44,259 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-06-05 09:14:44,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:14:44,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 09:14:44,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:14:44,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:14:44,368 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:44,369 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:44,370 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:44,370 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2021-06-05 09:14:44,435 INFO L354 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-06-05 09:14:44,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2021-06-05 09:14:44,436 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:44,444 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:44,446 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:44,446 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:13 [2021-06-05 09:14:44,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-06-05 09:14:44,468 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:44,469 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:44,470 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:44,470 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2021-06-05 09:14:44,510 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-06-05 09:14:44,510 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569857785] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:14:44,510 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:14:44,510 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 20 [2021-06-05 09:14:44,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778843078] [2021-06-05 09:14:44,510 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 09:14:44,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:14:44,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 09:14:44,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2021-06-05 09:14:44,511 INFO L87 Difference]: Start difference. First operand 25445 states and 53137 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:44,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:14:44,794 INFO L93 Difference]: Finished difference Result 27299 states and 57124 transitions. [2021-06-05 09:14:44,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 09:14:44,795 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2021-06-05 09:14:44,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:14:44,826 INFO L225 Difference]: With dead ends: 27299 [2021-06-05 09:14:44,826 INFO L226 Difference]: Without dead ends: 27299 [2021-06-05 09:14:44,826 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 249.2ms TimeCoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2021-06-05 09:14:44,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27299 states. [2021-06-05 09:14:45,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27299 to 25336. [2021-06-05 09:14:45,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25336 states, 25336 states have (on average 2.0860435743605934) internal successors, (52852), 25335 states have internal predecessors, (52852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:45,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25336 states to 25336 states and 52852 transitions. [2021-06-05 09:14:45,207 INFO L78 Accepts]: Start accepts. Automaton has 25336 states and 52852 transitions. Word has length 110 [2021-06-05 09:14:45,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:14:45,207 INFO L482 AbstractCegarLoop]: Abstraction has 25336 states and 52852 transitions. [2021-06-05 09:14:45,207 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:45,207 INFO L276 IsEmpty]: Start isEmpty. Operand 25336 states and 52852 transitions. [2021-06-05 09:14:45,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-06-05 09:14:45,227 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:14:45,227 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:14:45,427 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 78 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable86 [2021-06-05 09:14:45,428 INFO L430 AbstractCegarLoop]: === Iteration 85 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:14:45,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:14:45,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1801376092, now seen corresponding path program 61 times [2021-06-05 09:14:45,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:14:45,428 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148817976] [2021-06-05 09:14:45,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:14:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:45,578 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 6 proven. 61 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-06-05 09:14:45,578 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:14:45,578 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148817976] [2021-06-05 09:14:45,578 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148817976] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:45,579 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460175790] [2021-06-05 09:14:45,579 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:45,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 55 conjunts are in the unsatisfiable core [2021-06-05 09:14:45,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:14:46,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:14:46,049 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:46,055 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:46,056 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:46,056 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:14:46,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:14:46,090 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:46,093 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:46,094 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:46,094 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:14:46,123 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 6 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:14:46,123 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460175790] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:46,123 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:14:46,123 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20] total 28 [2021-06-05 09:14:46,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744352466] [2021-06-05 09:14:46,124 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 09:14:46,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:14:46,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 09:14:46,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2021-06-05 09:14:46,124 INFO L87 Difference]: Start difference. First operand 25336 states and 52852 transitions. Second operand has 28 states, 28 states have (on average 5.964285714285714) internal successors, (167), 28 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:47,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:14:47,737 INFO L93 Difference]: Finished difference Result 31326 states and 65143 transitions. [2021-06-05 09:14:47,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-06-05 09:14:47,737 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.964285714285714) internal successors, (167), 28 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2021-06-05 09:14:47,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:14:47,773 INFO L225 Difference]: With dead ends: 31326 [2021-06-05 09:14:47,773 INFO L226 Difference]: Without dead ends: 31326 [2021-06-05 09:14:47,773 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1939 ImplicationChecksByTransitivity, 1119.6ms TimeCoverageRelationStatistics Valid=453, Invalid=5553, Unknown=0, NotChecked=0, Total=6006 [2021-06-05 09:14:47,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31326 states. [2021-06-05 09:14:48,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31326 to 24728. [2021-06-05 09:14:48,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24728 states, 24728 states have (on average 2.082618893561954) internal successors, (51499), 24727 states have internal predecessors, (51499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:48,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24728 states to 24728 states and 51499 transitions. [2021-06-05 09:14:48,117 INFO L78 Accepts]: Start accepts. Automaton has 24728 states and 51499 transitions. Word has length 110 [2021-06-05 09:14:48,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:14:48,117 INFO L482 AbstractCegarLoop]: Abstraction has 24728 states and 51499 transitions. [2021-06-05 09:14:48,117 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 5.964285714285714) internal successors, (167), 28 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:48,117 INFO L276 IsEmpty]: Start isEmpty. Operand 24728 states and 51499 transitions. [2021-06-05 09:14:48,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-06-05 09:14:48,137 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:14:48,137 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:14:48,337 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,79 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:48,338 INFO L430 AbstractCegarLoop]: === Iteration 86 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:14:48,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:14:48,338 INFO L82 PathProgramCache]: Analyzing trace with hash -2072420186, now seen corresponding path program 62 times [2021-06-05 09:14:48,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:14:48,338 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017333761] [2021-06-05 09:14:48,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:14:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:48,489 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 17 proven. 63 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-06-05 09:14:48,490 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:14:48,490 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017333761] [2021-06-05 09:14:48,490 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017333761] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:48,490 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245101483] [2021-06-05 09:14:48,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:48,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:14:48,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:14:48,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 45 conjunts are in the unsatisfiable core [2021-06-05 09:14:48,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:14:49,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:14:49,010 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:49,016 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:49,016 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:49,016 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:14:49,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:14:49,042 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:49,046 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:49,046 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:49,046 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:14:49,074 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 17 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:14:49,074 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245101483] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:49,074 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:14:49,074 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20] total 28 [2021-06-05 09:14:49,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578632369] [2021-06-05 09:14:49,074 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 09:14:49,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:14:49,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 09:14:49,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2021-06-05 09:14:49,075 INFO L87 Difference]: Start difference. First operand 24728 states and 51499 transitions. Second operand has 28 states, 28 states have (on average 6.178571428571429) internal successors, (173), 28 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:51,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:14:51,046 INFO L93 Difference]: Finished difference Result 30943 states and 64399 transitions. [2021-06-05 09:14:51,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2021-06-05 09:14:51,047 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.178571428571429) internal successors, (173), 28 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2021-06-05 09:14:51,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:14:51,080 INFO L225 Difference]: With dead ends: 30943 [2021-06-05 09:14:51,080 INFO L226 Difference]: Without dead ends: 30943 [2021-06-05 09:14:51,081 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2101 ImplicationChecksByTransitivity, 1278.9ms TimeCoverageRelationStatistics Valid=480, Invalid=6000, Unknown=0, NotChecked=0, Total=6480 [2021-06-05 09:14:51,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30943 states. [2021-06-05 09:14:51,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30943 to 27479. [2021-06-05 09:14:51,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27479 states, 27479 states have (on average 2.082499363150042) internal successors, (57225), 27478 states have internal predecessors, (57225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:51,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27479 states to 27479 states and 57225 transitions. [2021-06-05 09:14:51,433 INFO L78 Accepts]: Start accepts. Automaton has 27479 states and 57225 transitions. Word has length 110 [2021-06-05 09:14:51,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:14:51,433 INFO L482 AbstractCegarLoop]: Abstraction has 27479 states and 57225 transitions. [2021-06-05 09:14:51,433 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 6.178571428571429) internal successors, (173), 28 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:51,433 INFO L276 IsEmpty]: Start isEmpty. Operand 27479 states and 57225 transitions. [2021-06-05 09:14:51,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-06-05 09:14:51,456 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:14:51,457 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:14:51,657 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88,80 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:51,657 INFO L430 AbstractCegarLoop]: === Iteration 87 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:14:51,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:14:51,658 INFO L82 PathProgramCache]: Analyzing trace with hash 2108611293, now seen corresponding path program 63 times [2021-06-05 09:14:51,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:14:51,658 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604177832] [2021-06-05 09:14:51,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:14:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:51,786 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 53 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-06-05 09:14:51,786 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:14:51,786 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604177832] [2021-06-05 09:14:51,787 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604177832] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:51,787 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79147910] [2021-06-05 09:14:51,787 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:51,950 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 09:14:51,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:14:51,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 44 conjunts are in the unsatisfiable core [2021-06-05 09:14:51,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:14:52,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:14:52,031 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:52,034 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:52,035 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:52,035 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2021-06-05 09:14:52,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-06-05 09:14:52,055 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:52,056 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:52,056 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:52,056 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2021-06-05 09:14:52,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-06-05 09:14:52,278 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:52,282 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:52,282 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:52,282 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2021-06-05 09:14:52,320 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 09:14:52,321 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:52,323 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:52,323 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:52,323 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:12 [2021-06-05 09:14:52,350 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 39 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:14:52,350 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79147910] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:52,350 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:14:52,351 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2021-06-05 09:14:52,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565464916] [2021-06-05 09:14:52,351 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 09:14:52,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:14:52,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 09:14:52,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2021-06-05 09:14:52,351 INFO L87 Difference]: Start difference. First operand 27479 states and 57225 transitions. Second operand has 25 states, 25 states have (on average 7.72) internal successors, (193), 25 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:54,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:14:54,577 INFO L93 Difference]: Finished difference Result 37162 states and 77376 transitions. [2021-06-05 09:14:54,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-06-05 09:14:54,577 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 7.72) internal successors, (193), 25 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2021-06-05 09:14:54,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:14:54,620 INFO L225 Difference]: With dead ends: 37162 [2021-06-05 09:14:54,620 INFO L226 Difference]: Without dead ends: 37162 [2021-06-05 09:14:54,621 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 147 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1429 ImplicationChecksByTransitivity, 1562.2ms TimeCoverageRelationStatistics Valid=545, Invalid=4857, Unknown=0, NotChecked=0, Total=5402 [2021-06-05 09:14:54,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37162 states. [2021-06-05 09:14:55,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37162 to 28773. [2021-06-05 09:14:55,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28773 states, 28773 states have (on average 2.0838980989121745) internal successors, (59960), 28772 states have internal predecessors, (59960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:55,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28773 states to 28773 states and 59960 transitions. [2021-06-05 09:14:55,071 INFO L78 Accepts]: Start accepts. Automaton has 28773 states and 59960 transitions. Word has length 110 [2021-06-05 09:14:55,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:14:55,072 INFO L482 AbstractCegarLoop]: Abstraction has 28773 states and 59960 transitions. [2021-06-05 09:14:55,072 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 7.72) internal successors, (193), 25 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:14:55,072 INFO L276 IsEmpty]: Start isEmpty. Operand 28773 states and 59960 transitions. [2021-06-05 09:14:55,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-06-05 09:14:55,101 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:14:55,101 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:14:55,302 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 81 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable89 [2021-06-05 09:14:55,302 INFO L430 AbstractCegarLoop]: === Iteration 88 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:14:55,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:14:55,302 INFO L82 PathProgramCache]: Analyzing trace with hash -2136779024, now seen corresponding path program 64 times [2021-06-05 09:14:55,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:14:55,302 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805899682] [2021-06-05 09:14:55,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:14:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:14:55,457 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 17 proven. 64 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:14:55,458 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:14:55,458 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805899682] [2021-06-05 09:14:55,458 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805899682] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:55,458 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174260794] [2021-06-05 09:14:55,458 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:14:55,546 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:14:55,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:14:55,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 89 conjunts are in the unsatisfiable core [2021-06-05 09:14:55,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:14:55,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 09:14:55,584 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:55,588 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:55,588 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:55,588 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:14:55,690 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:14:55,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 09:14:55,692 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:55,697 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:55,698 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:55,698 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2021-06-05 09:14:55,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:14:55,726 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:55,736 INFO L628 ElimStorePlain]: treesize reduction 4, result has 81.0 percent of original size [2021-06-05 09:14:55,737 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:14:55,737 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:17 [2021-06-05 09:14:55,766 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:14:55,789 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:14:55,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:14:55,790 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:55,799 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:55,800 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:55,801 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2021-06-05 09:14:55,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:14:55,896 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:55,907 INFO L628 ElimStorePlain]: treesize reduction 4, result has 81.0 percent of original size [2021-06-05 09:14:55,908 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:14:55,908 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:17 [2021-06-05 09:14:55,939 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:14:55,962 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:14:55,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:14:55,964 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:55,973 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:55,974 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:55,974 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2021-06-05 09:14:56,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:14:56,089 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:56,100 INFO L628 ElimStorePlain]: treesize reduction 4, result has 81.0 percent of original size [2021-06-05 09:14:56,101 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:14:56,101 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:17 [2021-06-05 09:14:56,158 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:14:56,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:14:56,159 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:56,169 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:56,171 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:56,171 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2021-06-05 09:14:56,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:14:56,205 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:56,222 INFO L628 ElimStorePlain]: treesize reduction 8, result has 80.5 percent of original size [2021-06-05 09:14:56,223 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:56,223 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:33 [2021-06-05 09:14:56,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:14:56,342 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:56,357 INFO L628 ElimStorePlain]: treesize reduction 4, result has 87.9 percent of original size [2021-06-05 09:14:56,358 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:14:56,358 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:29 [2021-06-05 09:14:56,401 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:14:56,415 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-06-05 09:14:56,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 09:14:56,417 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:56,426 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:14:56,427 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:56,427 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:26 [2021-06-05 09:14:56,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2021-06-05 09:14:56,466 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:14:56,478 INFO L628 ElimStorePlain]: treesize reduction 4, result has 85.7 percent of original size [2021-06-05 09:14:56,479 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:14:56,479 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:24 [2021-06-05 09:14:56,572 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 17 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:14:56,573 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174260794] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:14:56,573 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:14:56,573 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 27] total 38 [2021-06-05 09:14:56,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313143958] [2021-06-05 09:14:56,573 INFO L462 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-06-05 09:14:56,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:14:56,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-06-05 09:14:56,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 09:14:56,574 INFO L87 Difference]: Start difference. First operand 28773 states and 59960 transitions. Second operand has 38 states, 38 states have (on average 4.815789473684211) internal successors, (183), 38 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:00,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:00,854 INFO L93 Difference]: Finished difference Result 32690 states and 67979 transitions. [2021-06-05 09:15:00,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2021-06-05 09:15:00,855 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 4.815789473684211) internal successors, (183), 38 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2021-06-05 09:15:00,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:00,891 INFO L225 Difference]: With dead ends: 32690 [2021-06-05 09:15:00,891 INFO L226 Difference]: Without dead ends: 32690 [2021-06-05 09:15:00,892 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4108 ImplicationChecksByTransitivity, 1982.1ms TimeCoverageRelationStatistics Valid=639, Invalid=11133, Unknown=0, NotChecked=0, Total=11772 [2021-06-05 09:15:00,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32690 states. [2021-06-05 09:15:01,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32690 to 22421. [2021-06-05 09:15:01,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22421 states, 22421 states have (on average 2.074974354399893) internal successors, (46523), 22420 states have internal predecessors, (46523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:01,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22421 states to 22421 states and 46523 transitions. [2021-06-05 09:15:01,209 INFO L78 Accepts]: Start accepts. Automaton has 22421 states and 46523 transitions. Word has length 110 [2021-06-05 09:15:01,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:01,209 INFO L482 AbstractCegarLoop]: Abstraction has 22421 states and 46523 transitions. [2021-06-05 09:15:01,209 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 38 states, 38 states have (on average 4.815789473684211) internal successors, (183), 38 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:01,209 INFO L276 IsEmpty]: Start isEmpty. Operand 22421 states and 46523 transitions. [2021-06-05 09:15:01,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-06-05 09:15:01,225 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:01,226 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:01,426 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,82 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:15:01,426 INFO L430 AbstractCegarLoop]: === Iteration 89 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:01,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:01,427 INFO L82 PathProgramCache]: Analyzing trace with hash -131436364, now seen corresponding path program 65 times [2021-06-05 09:15:01,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:01,427 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598580528] [2021-06-05 09:15:01,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:01,563 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 6 proven. 67 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:01,563 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:01,563 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598580528] [2021-06-05 09:15:01,563 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598580528] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:15:01,563 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631287803] [2021-06-05 09:15:01,563 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:15:01,764 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 09:15:01,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:15:01,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 64 conjunts are in the unsatisfiable core [2021-06-05 09:15:01,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:15:01,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 09:15:01,828 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:01,830 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:01,830 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:01,830 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 09:15:01,885 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:15:01,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 09:15:01,886 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:01,891 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:01,892 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:01,892 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2021-06-05 09:15:01,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:15:01,919 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:01,925 INFO L628 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2021-06-05 09:15:01,926 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:15:01,926 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2021-06-05 09:15:01,950 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:01,951 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:01,953 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:01,974 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:15:01,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:15:01,976 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:01,983 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:01,984 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:01,984 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2021-06-05 09:15:02,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:15:02,013 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:02,018 INFO L628 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2021-06-05 09:15:02,019 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:15:02,019 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2021-06-05 09:15:02,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:02,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:02,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:02,053 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:15:02,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:15:02,054 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:02,061 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:02,062 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:02,062 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2021-06-05 09:15:02,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:15:02,086 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:02,092 INFO L628 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2021-06-05 09:15:02,093 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:15:02,093 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2021-06-05 09:15:02,156 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:15:02,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:15:02,160 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:02,167 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:02,169 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:02,169 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2021-06-05 09:15:02,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:15:02,199 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:02,207 INFO L628 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2021-06-05 09:15:02,208 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:15:02,208 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2021-06-05 09:15:02,240 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:02,254 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-06-05 09:15:02,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 09:15:02,256 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:02,260 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:02,261 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:02,261 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:11 [2021-06-05 09:15:02,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:15:02,284 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:02,289 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:02,290 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:02,290 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2021-06-05 09:15:02,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:15:02,318 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:02,326 INFO L628 ElimStorePlain]: treesize reduction 4, result has 83.3 percent of original size [2021-06-05 09:15:02,327 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:02,327 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2021-06-05 09:15:02,386 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:15:02,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2021-06-05 09:15:02,388 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:02,391 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:02,392 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:02,392 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:5 [2021-06-05 09:15:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 48 proven. 30 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-05 09:15:02,442 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631287803] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:15:02,442 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:15:02,442 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2021-06-05 09:15:02,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468794210] [2021-06-05 09:15:02,442 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 09:15:02,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:02,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 09:15:02,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2021-06-05 09:15:02,443 INFO L87 Difference]: Start difference. First operand 22421 states and 46523 transitions. Second operand has 26 states, 26 states have (on average 7.1923076923076925) internal successors, (187), 26 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:08,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:08,407 INFO L93 Difference]: Finished difference Result 36372 states and 75446 transitions. [2021-06-05 09:15:08,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2021-06-05 09:15:08,407 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.1923076923076925) internal successors, (187), 26 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2021-06-05 09:15:08,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:08,450 INFO L225 Difference]: With dead ends: 36372 [2021-06-05 09:15:08,450 INFO L226 Difference]: Without dead ends: 36372 [2021-06-05 09:15:08,453 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10874 ImplicationChecksByTransitivity, 4070.7ms TimeCoverageRelationStatistics Valid=1752, Invalid=26978, Unknown=0, NotChecked=0, Total=28730 [2021-06-05 09:15:08,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36372 states. [2021-06-05 09:15:08,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36372 to 24577. [2021-06-05 09:15:08,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24577 states, 24577 states have (on average 2.073646091874517) internal successors, (50964), 24576 states have internal predecessors, (50964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:08,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24577 states to 24577 states and 50964 transitions. [2021-06-05 09:15:08,845 INFO L78 Accepts]: Start accepts. Automaton has 24577 states and 50964 transitions. Word has length 110 [2021-06-05 09:15:08,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:08,845 INFO L482 AbstractCegarLoop]: Abstraction has 24577 states and 50964 transitions. [2021-06-05 09:15:08,845 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 7.1923076923076925) internal successors, (187), 26 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:08,845 INFO L276 IsEmpty]: Start isEmpty. Operand 24577 states and 50964 transitions. [2021-06-05 09:15:08,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-06-05 09:15:08,865 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:08,865 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:09,065 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,83 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:15:09,065 INFO L430 AbstractCegarLoop]: === Iteration 90 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:09,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:09,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1568246004, now seen corresponding path program 66 times [2021-06-05 09:15:09,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:09,066 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645872057] [2021-06-05 09:15:09,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 18 proven. 55 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:09,223 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:09,224 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645872057] [2021-06-05 09:15:09,224 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645872057] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:15:09,224 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898551987] [2021-06-05 09:15:09,224 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:15:09,336 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 09:15:09,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:15:09,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 70 conjunts are in the unsatisfiable core [2021-06-05 09:15:09,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:15:09,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 09:15:09,365 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:09,367 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:09,367 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:09,367 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 09:15:09,431 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:15:09,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 09:15:09,433 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:09,439 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:09,439 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:09,440 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2021-06-05 09:15:09,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:15:09,468 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:09,476 INFO L628 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2021-06-05 09:15:09,477 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:15:09,477 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2021-06-05 09:15:09,503 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:09,527 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:15:09,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:15:09,528 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:09,536 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:09,537 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:09,538 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2021-06-05 09:15:09,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:15:09,584 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:09,590 INFO L628 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2021-06-05 09:15:09,591 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:15:09,591 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2021-06-05 09:15:09,618 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:09,620 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:09,621 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:09,642 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:15:09,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:15:09,644 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:09,650 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:09,652 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:09,652 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2021-06-05 09:15:09,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:15:09,674 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:09,680 INFO L628 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2021-06-05 09:15:09,681 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:15:09,681 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2021-06-05 09:15:09,769 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:15:09,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:15:09,771 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:09,781 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:09,783 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:09,783 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2021-06-05 09:15:09,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:15:09,799 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:09,809 INFO L628 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2021-06-05 09:15:09,811 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:15:09,811 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2021-06-05 09:15:09,820 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:09,836 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-06-05 09:15:09,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 09:15:09,838 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:09,844 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:09,845 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:09,845 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:11 [2021-06-05 09:15:09,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:15:09,994 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:10,003 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:10,004 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:10,004 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2021-06-05 09:15:10,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-06-05 09:15:10,050 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:10,066 INFO L628 ElimStorePlain]: treesize reduction 4, result has 88.9 percent of original size [2021-06-05 09:15:10,066 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:10,067 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2021-06-05 09:15:10,159 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:15:10,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 24 [2021-06-05 09:15:10,161 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:10,167 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:10,168 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:10,168 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:14 [2021-06-05 09:15:10,235 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 52 proven. 29 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 09:15:10,235 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898551987] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:15:10,236 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:15:10,236 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2021-06-05 09:15:10,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975665866] [2021-06-05 09:15:10,236 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 09:15:10,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:10,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 09:15:10,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2021-06-05 09:15:10,237 INFO L87 Difference]: Start difference. First operand 24577 states and 50964 transitions. Second operand has 27 states, 27 states have (on average 7.0) internal successors, (189), 27 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:16,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:16,195 INFO L93 Difference]: Finished difference Result 27745 states and 57004 transitions. [2021-06-05 09:15:16,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2021-06-05 09:15:16,196 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 7.0) internal successors, (189), 27 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2021-06-05 09:15:16,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:16,196 INFO L225 Difference]: With dead ends: 27745 [2021-06-05 09:15:16,196 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 09:15:16,198 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9630 ImplicationChecksByTransitivity, 4170.4ms TimeCoverageRelationStatistics Valid=1644, Invalid=24762, Unknown=0, NotChecked=0, Total=26406 [2021-06-05 09:15:16,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 09:15:16,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 09:15:16,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:16,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 09:15:16,199 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 110 [2021-06-05 09:15:16,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:16,199 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 09:15:16,199 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 7.0) internal successors, (189), 27 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:16,199 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 09:15:16,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 09:15:16,399 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,84 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:15:16,400 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2021-06-05 09:15:16,402 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 09:15:16,402 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 09:15:16,402 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 09:15:16,402 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 09:15:16,402 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 09:15:16,402 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 09:15:16,402 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 09:15:16,402 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 09:15:16,402 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 09:15:16,404 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 91 transitions, 187 flow [2021-06-05 09:15:16,417 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1042 states, 1034 states have (on average 2.3123791102514506) internal successors, (2391), 1041 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:16,418 INFO L276 IsEmpty]: Start isEmpty. Operand has 1042 states, 1034 states have (on average 2.3123791102514506) internal successors, (2391), 1041 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:16,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-06-05 09:15:16,419 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:16,419 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:16,419 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 09:15:16,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:16,420 INFO L82 PathProgramCache]: Analyzing trace with hash 859182306, now seen corresponding path program 1 times [2021-06-05 09:15:16,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:16,420 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096194172] [2021-06-05 09:15:16,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 09:15:16,424 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 09:15:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 09:15:16,427 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 09:15:16,449 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 09:15:16,449 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 09:15:16,450 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2021-06-05 09:15:16,450 INFO L315 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2021-06-05 09:15:16,451 WARN L242 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 09:15:16,451 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-06-05 09:15:16,464 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,464 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,464 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,464 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,464 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,465 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,465 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,465 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,465 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,465 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,465 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,465 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,465 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,465 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,465 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,465 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,465 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,465 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,466 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,466 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,466 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,466 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,466 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,466 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,466 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,466 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,466 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,466 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,467 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,467 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,467 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,467 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,467 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,467 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,467 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,467 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,469 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,469 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,469 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,469 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,469 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,469 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,469 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,469 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,469 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,469 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,469 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,469 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,470 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,470 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,471 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,471 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,471 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,471 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,471 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,471 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,471 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,471 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,471 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,471 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,472 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,472 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,472 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,472 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,472 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,472 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,472 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,472 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,472 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,472 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,474 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,474 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,474 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,475 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,475 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,475 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,475 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,475 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,475 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,475 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,475 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,475 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,475 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,475 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,475 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,475 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,476 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,479 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,479 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,480 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,480 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,480 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,480 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,481 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,481 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,481 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,481 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,481 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,482 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,482 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,483 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,483 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,483 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~#l~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,483 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_~l.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,483 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,483 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,483 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,483 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,483 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_fetch_and_inc_#in~l.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,483 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 09:15:16,484 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 09:15:16,486 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-05 09:15:16,486 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 09:15:16,486 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 09:15:16,486 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 09:15:16,486 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 09:15:16,486 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 09:15:16,486 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 09:15:16,486 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 09:15:16,487 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 09:15:16,492 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 106 places, 120 transitions, 252 flow [2021-06-05 09:15:18,020 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 23766 states, 23748 states have (on average 3.5231598450395825) internal successors, (83668), 23765 states have internal predecessors, (83668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:18,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 23766 states, 23748 states have (on average 3.5231598450395825) internal successors, (83668), 23765 states have internal predecessors, (83668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:18,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-06-05 09:15:18,057 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:18,057 INFO L521 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] [2021-06-05 09:15:18,057 INFO L430 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:18,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:18,057 INFO L82 PathProgramCache]: Analyzing trace with hash -660100155, now seen corresponding path program 1 times [2021-06-05 09:15:18,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:18,058 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327016858] [2021-06-05 09:15:18,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:15:18,064 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:18,064 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327016858] [2021-06-05 09:15:18,064 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327016858] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:18,065 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:18,065 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 09:15:18,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605973143] [2021-06-05 09:15:18,065 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 09:15:18,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:18,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 09:15:18,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 09:15:18,106 INFO L87 Difference]: Start difference. First operand has 23766 states, 23748 states have (on average 3.5231598450395825) internal successors, (83668), 23765 states have internal predecessors, (83668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:18,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:18,201 INFO L93 Difference]: Finished difference Result 12564 states and 38685 transitions. [2021-06-05 09:15:18,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 09:15:18,201 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-06-05 09:15:18,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:18,260 INFO L225 Difference]: With dead ends: 12564 [2021-06-05 09:15:18,261 INFO L226 Difference]: Without dead ends: 12564 [2021-06-05 09:15:18,261 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 09:15:18,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12564 states. [2021-06-05 09:15:18,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12564 to 12564. [2021-06-05 09:15:18,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12564 states, 12560 states have (on average 3.080015923566879) internal successors, (38685), 12563 states have internal predecessors, (38685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:18,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12564 states to 12564 states and 38685 transitions. [2021-06-05 09:15:18,700 INFO L78 Accepts]: Start accepts. Automaton has 12564 states and 38685 transitions. Word has length 25 [2021-06-05 09:15:18,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:18,700 INFO L482 AbstractCegarLoop]: Abstraction has 12564 states and 38685 transitions. [2021-06-05 09:15:18,700 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:18,700 INFO L276 IsEmpty]: Start isEmpty. Operand 12564 states and 38685 transitions. [2021-06-05 09:15:18,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-06-05 09:15:18,701 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:18,701 INFO L521 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] [2021-06-05 09:15:18,701 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2021-06-05 09:15:18,701 INFO L430 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:18,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:18,701 INFO L82 PathProgramCache]: Analyzing trace with hash -829015263, now seen corresponding path program 1 times [2021-06-05 09:15:18,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:18,701 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779877915] [2021-06-05 09:15:18,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:18,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 09:15:18,713 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:18,713 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779877915] [2021-06-05 09:15:18,713 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779877915] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:18,713 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:18,713 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 09:15:18,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105130165] [2021-06-05 09:15:18,714 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 09:15:18,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:18,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 09:15:18,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 09:15:18,714 INFO L87 Difference]: Start difference. First operand 12564 states and 38685 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:18,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:18,844 INFO L93 Difference]: Finished difference Result 15078 states and 46207 transitions. [2021-06-05 09:15:18,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 09:15:18,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-06-05 09:15:18,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:18,886 INFO L225 Difference]: With dead ends: 15078 [2021-06-05 09:15:18,887 INFO L226 Difference]: Without dead ends: 15057 [2021-06-05 09:15:18,887 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 09:15:19,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15057 states. [2021-06-05 09:15:19,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15057 to 13755. [2021-06-05 09:15:19,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13755 states, 13755 states have (on average 3.0719738276990185) internal successors, (42255), 13754 states have internal predecessors, (42255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:19,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13755 states to 13755 states and 42255 transitions. [2021-06-05 09:15:19,226 INFO L78 Accepts]: Start accepts. Automaton has 13755 states and 42255 transitions. Word has length 30 [2021-06-05 09:15:19,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:19,226 INFO L482 AbstractCegarLoop]: Abstraction has 13755 states and 42255 transitions. [2021-06-05 09:15:19,226 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:19,226 INFO L276 IsEmpty]: Start isEmpty. Operand 13755 states and 42255 transitions. [2021-06-05 09:15:19,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-06-05 09:15:19,232 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:19,232 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:19,232 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2021-06-05 09:15:19,232 INFO L430 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:19,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:19,232 INFO L82 PathProgramCache]: Analyzing trace with hash 697647839, now seen corresponding path program 1 times [2021-06-05 09:15:19,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:19,233 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851017076] [2021-06-05 09:15:19,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:19,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:15:19,295 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:19,295 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851017076] [2021-06-05 09:15:19,295 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851017076] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:19,295 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:19,295 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 09:15:19,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396528878] [2021-06-05 09:15:19,296 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 09:15:19,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:19,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 09:15:19,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 09:15:19,296 INFO L87 Difference]: Start difference. First operand 13755 states and 42255 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:19,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:19,490 INFO L93 Difference]: Finished difference Result 21466 states and 66146 transitions. [2021-06-05 09:15:19,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 09:15:19,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-06-05 09:15:19,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:19,537 INFO L225 Difference]: With dead ends: 21466 [2021-06-05 09:15:19,537 INFO L226 Difference]: Without dead ends: 21466 [2021-06-05 09:15:19,537 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 50.5ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-06-05 09:15:19,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21466 states. [2021-06-05 09:15:19,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21466 to 16054. [2021-06-05 09:15:19,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16054 states, 16054 states have (on average 3.065715709480503) internal successors, (49217), 16053 states have internal predecessors, (49217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:19,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16054 states to 16054 states and 49217 transitions. [2021-06-05 09:15:19,961 INFO L78 Accepts]: Start accepts. Automaton has 16054 states and 49217 transitions. Word has length 50 [2021-06-05 09:15:19,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:19,961 INFO L482 AbstractCegarLoop]: Abstraction has 16054 states and 49217 transitions. [2021-06-05 09:15:19,961 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:19,961 INFO L276 IsEmpty]: Start isEmpty. Operand 16054 states and 49217 transitions. [2021-06-05 09:15:19,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-06-05 09:15:19,968 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:19,968 INFO L521 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:19,968 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2021-06-05 09:15:19,968 INFO L430 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:19,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:19,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1903997161, now seen corresponding path program 2 times [2021-06-05 09:15:19,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:19,969 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701973478] [2021-06-05 09:15:19,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:20,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:15:20,032 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:20,032 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701973478] [2021-06-05 09:15:20,032 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701973478] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:20,032 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:20,032 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 09:15:20,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528423687] [2021-06-05 09:15:20,033 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 09:15:20,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:20,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 09:15:20,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 09:15:20,033 INFO L87 Difference]: Start difference. First operand 16054 states and 49217 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:20,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:20,252 INFO L93 Difference]: Finished difference Result 21358 states and 65858 transitions. [2021-06-05 09:15:20,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 09:15:20,253 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-06-05 09:15:20,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:20,293 INFO L225 Difference]: With dead ends: 21358 [2021-06-05 09:15:20,293 INFO L226 Difference]: Without dead ends: 21358 [2021-06-05 09:15:20,294 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 54.3ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-06-05 09:15:20,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21358 states. [2021-06-05 09:15:20,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21358 to 17176. [2021-06-05 09:15:20,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17176 states, 17176 states have (on average 3.0591523055426175) internal successors, (52544), 17175 states have internal predecessors, (52544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:20,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17176 states to 17176 states and 52544 transitions. [2021-06-05 09:15:20,910 INFO L78 Accepts]: Start accepts. Automaton has 17176 states and 52544 transitions. Word has length 50 [2021-06-05 09:15:20,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:20,911 INFO L482 AbstractCegarLoop]: Abstraction has 17176 states and 52544 transitions. [2021-06-05 09:15:20,911 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:20,911 INFO L276 IsEmpty]: Start isEmpty. Operand 17176 states and 52544 transitions. [2021-06-05 09:15:20,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-06-05 09:15:20,919 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:20,919 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:20,919 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2021-06-05 09:15:20,919 INFO L430 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:20,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:20,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1364835039, now seen corresponding path program 1 times [2021-06-05 09:15:20,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:20,920 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555931935] [2021-06-05 09:15:20,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:20,983 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:15:20,984 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:20,984 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555931935] [2021-06-05 09:15:20,984 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555931935] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:20,984 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:20,984 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 09:15:20,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783487445] [2021-06-05 09:15:20,984 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 09:15:20,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:20,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 09:15:20,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 09:15:20,985 INFO L87 Difference]: Start difference. First operand 17176 states and 52544 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:21,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:21,414 INFO L93 Difference]: Finished difference Result 20150 states and 61814 transitions. [2021-06-05 09:15:21,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 09:15:21,414 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-06-05 09:15:21,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:21,445 INFO L225 Difference]: With dead ends: 20150 [2021-06-05 09:15:21,445 INFO L226 Difference]: Without dead ends: 20150 [2021-06-05 09:15:21,445 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 53.1ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-06-05 09:15:21,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20150 states. [2021-06-05 09:15:21,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20150 to 18428. [2021-06-05 09:15:21,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18428 states, 18428 states have (on average 3.059691773388322) internal successors, (56384), 18427 states have internal predecessors, (56384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:21,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18428 states to 18428 states and 56384 transitions. [2021-06-05 09:15:21,895 INFO L78 Accepts]: Start accepts. Automaton has 18428 states and 56384 transitions. Word has length 51 [2021-06-05 09:15:21,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:21,896 INFO L482 AbstractCegarLoop]: Abstraction has 18428 states and 56384 transitions. [2021-06-05 09:15:21,896 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:21,896 INFO L276 IsEmpty]: Start isEmpty. Operand 18428 states and 56384 transitions. [2021-06-05 09:15:21,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 09:15:21,906 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:21,906 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:21,907 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-06-05 09:15:21,907 INFO L430 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:21,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:21,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1188576970, now seen corresponding path program 2 times [2021-06-05 09:15:21,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:21,907 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722369940] [2021-06-05 09:15:21,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-06-05 09:15:22,042 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:22,042 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722369940] [2021-06-05 09:15:22,043 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722369940] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:15:22,043 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924680133] [2021-06-05 09:15:22,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:15:22,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 09:15:22,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:15:22,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 37 conjunts are in the unsatisfiable core [2021-06-05 09:15:22,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:15:22,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 09:15:22,147 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:22,151 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:22,152 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:22,152 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:15:22,208 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:15:22,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 09:15:22,210 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:22,217 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:22,218 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:15:22,219 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:21 [2021-06-05 09:15:22,437 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2021-06-05 09:15:22,437 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 09:15:22,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 09:15:22,440 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:22,448 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:22,449 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:22,449 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2021-06-05 09:15:22,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:15:22,473 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:22,478 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:22,479 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:22,479 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2021-06-05 09:15:22,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 09:15:22,514 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:22,521 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:22,522 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:22,523 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2021-06-05 09:15:22,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 09:15:22,545 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:22,548 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:22,548 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:22,549 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2021-06-05 09:15:22,566 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-06-05 09:15:22,566 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924680133] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:15:22,566 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:15:22,567 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 17 [2021-06-05 09:15:22,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373005095] [2021-06-05 09:15:22,567 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 09:15:22,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:22,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 09:15:22,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2021-06-05 09:15:22,567 INFO L87 Difference]: Start difference. First operand 18428 states and 56384 transitions. Second operand has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:23,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:23,167 INFO L93 Difference]: Finished difference Result 21400 states and 65589 transitions. [2021-06-05 09:15:23,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 09:15:23,168 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-06-05 09:15:23,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:23,204 INFO L225 Difference]: With dead ends: 21400 [2021-06-05 09:15:23,204 INFO L226 Difference]: Without dead ends: 21400 [2021-06-05 09:15:23,205 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 263.6ms TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2021-06-05 09:15:23,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21400 states. [2021-06-05 09:15:23,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21400 to 18828. [2021-06-05 09:15:23,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18828 states, 18828 states have (on average 3.063203739111961) internal successors, (57674), 18827 states have internal predecessors, (57674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:23,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18828 states to 18828 states and 57674 transitions. [2021-06-05 09:15:23,703 INFO L78 Accepts]: Start accepts. Automaton has 18828 states and 57674 transitions. Word has length 59 [2021-06-05 09:15:23,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:23,703 INFO L482 AbstractCegarLoop]: Abstraction has 18828 states and 57674 transitions. [2021-06-05 09:15:23,703 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:23,704 INFO L276 IsEmpty]: Start isEmpty. Operand 18828 states and 57674 transitions. [2021-06-05 09:15:23,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 09:15:23,714 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:23,714 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:23,915 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 85 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable99 [2021-06-05 09:15:23,915 INFO L430 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:23,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:23,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1740475462, now seen corresponding path program 3 times [2021-06-05 09:15:23,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:23,916 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851303920] [2021-06-05 09:15:23,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:24,012 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-06-05 09:15:24,012 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:24,012 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851303920] [2021-06-05 09:15:24,012 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851303920] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:15:24,013 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371351051] [2021-06-05 09:15:24,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:15:24,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 09:15:24,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:15:24,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 32 conjunts are in the unsatisfiable core [2021-06-05 09:15:24,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:15:24,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 09:15:24,101 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:24,105 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:24,106 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:24,106 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:15:24,154 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:15:24,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 09:15:24,156 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:24,161 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:24,162 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:24,162 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2021-06-05 09:15:24,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:15:24,206 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:24,211 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:24,212 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:24,212 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2021-06-05 09:15:24,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 09:15:24,240 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:24,247 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:24,248 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:24,248 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2021-06-05 09:15:24,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 09:15:24,269 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:24,272 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:24,272 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:24,272 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2021-06-05 09:15:24,289 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-06-05 09:15:24,290 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371351051] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:15:24,290 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:15:24,290 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-06-05 09:15:24,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283770689] [2021-06-05 09:15:24,290 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 09:15:24,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:24,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 09:15:24,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:15:24,290 INFO L87 Difference]: Start difference. First operand 18828 states and 57674 transitions. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:24,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:24,767 INFO L93 Difference]: Finished difference Result 21842 states and 67078 transitions. [2021-06-05 09:15:24,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 09:15:24,768 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-06-05 09:15:24,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:24,808 INFO L225 Difference]: With dead ends: 21842 [2021-06-05 09:15:24,808 INFO L226 Difference]: Without dead ends: 21842 [2021-06-05 09:15:24,808 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 149.6ms TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2021-06-05 09:15:24,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21842 states. [2021-06-05 09:15:25,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21842 to 19228. [2021-06-05 09:15:25,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19228 states, 19228 states have (on average 3.0665695860203868) internal successors, (58964), 19227 states have internal predecessors, (58964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:25,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19228 states to 19228 states and 58964 transitions. [2021-06-05 09:15:25,302 INFO L78 Accepts]: Start accepts. Automaton has 19228 states and 58964 transitions. Word has length 59 [2021-06-05 09:15:25,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:25,303 INFO L482 AbstractCegarLoop]: Abstraction has 19228 states and 58964 transitions. [2021-06-05 09:15:25,303 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:25,303 INFO L276 IsEmpty]: Start isEmpty. Operand 19228 states and 58964 transitions. [2021-06-05 09:15:25,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 09:15:25,316 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:25,317 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:25,528 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2021-06-05 09:15:25,528 INFO L430 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:25,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:25,529 INFO L82 PathProgramCache]: Analyzing trace with hash -771389332, now seen corresponding path program 4 times [2021-06-05 09:15:25,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:25,529 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627199678] [2021-06-05 09:15:25,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:25,658 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-06-05 09:15:25,658 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:25,658 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627199678] [2021-06-05 09:15:25,658 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627199678] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:15:25,658 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39459924] [2021-06-05 09:15:25,658 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:15:25,726 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:15:25,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:15:25,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 35 conjunts are in the unsatisfiable core [2021-06-05 09:15:25,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:15:25,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 09:15:25,751 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:25,755 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:25,756 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:25,756 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:15:25,813 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:15:25,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 09:15:25,815 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:25,822 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:25,824 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:15:25,824 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:21 [2021-06-05 09:15:25,931 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 09:15:25,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 09:15:25,933 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:25,940 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:25,941 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:25,941 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2021-06-05 09:15:25,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:15:25,973 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:25,978 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:25,978 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:25,979 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2021-06-05 09:15:26,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 09:15:26,003 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:26,009 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:26,010 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:26,010 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2021-06-05 09:15:26,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 09:15:26,028 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:26,031 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:26,031 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:26,031 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2021-06-05 09:15:26,051 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-06-05 09:15:26,052 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39459924] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:15:26,052 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:15:26,052 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2021-06-05 09:15:26,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600264616] [2021-06-05 09:15:26,052 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 09:15:26,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:26,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 09:15:26,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:15:26,053 INFO L87 Difference]: Start difference. First operand 19228 states and 58964 transitions. Second operand has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:26,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:26,528 INFO L93 Difference]: Finished difference Result 21872 states and 67131 transitions. [2021-06-05 09:15:26,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 09:15:26,529 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-06-05 09:15:26,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:26,563 INFO L225 Difference]: With dead ends: 21872 [2021-06-05 09:15:26,563 INFO L226 Difference]: Without dead ends: 21872 [2021-06-05 09:15:26,563 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 195.5ms TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2021-06-05 09:15:26,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21872 states. [2021-06-05 09:15:26,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21872 to 18808. [2021-06-05 09:15:26,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18808 states, 18808 states have (on average 3.063696299447044) internal successors, (57622), 18807 states have internal predecessors, (57622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:26,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18808 states to 18808 states and 57622 transitions. [2021-06-05 09:15:26,961 INFO L78 Accepts]: Start accepts. Automaton has 18808 states and 57622 transitions. Word has length 59 [2021-06-05 09:15:26,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:26,961 INFO L482 AbstractCegarLoop]: Abstraction has 18808 states and 57622 transitions. [2021-06-05 09:15:26,962 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:26,962 INFO L276 IsEmpty]: Start isEmpty. Operand 18808 states and 57622 transitions. [2021-06-05 09:15:26,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-05 09:15:26,976 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:26,976 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:27,200 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 87 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable101 [2021-06-05 09:15:27,200 INFO L430 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:27,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:27,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1694249734, now seen corresponding path program 5 times [2021-06-05 09:15:27,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:27,201 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004715738] [2021-06-05 09:15:27,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:27,308 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-06-05 09:15:27,308 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:27,308 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004715738] [2021-06-05 09:15:27,308 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004715738] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:15:27,308 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048167024] [2021-06-05 09:15:27,309 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:15:27,365 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 09:15:27,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:15:27,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 42 conjunts are in the unsatisfiable core [2021-06-05 09:15:27,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:15:27,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 09:15:27,385 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:27,389 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:27,390 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:27,390 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:15:27,450 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:15:27,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 09:15:27,452 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:27,458 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:27,459 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:15:27,459 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:21 [2021-06-05 09:15:27,513 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 09:15:27,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 09:15:27,515 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:27,522 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:27,523 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:27,523 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2021-06-05 09:15:27,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:15:27,544 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:27,549 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:27,550 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:27,550 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2021-06-05 09:15:27,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 09:15:27,677 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:27,683 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:27,684 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:27,684 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2021-06-05 09:15:27,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 09:15:27,711 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:15:27,714 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:15:27,714 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:15:27,714 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2021-06-05 09:15:27,736 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-06-05 09:15:27,736 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048167024] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:15:27,736 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:15:27,736 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2021-06-05 09:15:27,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059354977] [2021-06-05 09:15:27,736 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 09:15:27,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:27,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 09:15:27,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2021-06-05 09:15:27,737 INFO L87 Difference]: Start difference. First operand 18808 states and 57622 transitions. Second operand has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:28,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:28,856 INFO L93 Difference]: Finished difference Result 21226 states and 65164 transitions. [2021-06-05 09:15:28,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 09:15:28,856 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-06-05 09:15:28,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:28,890 INFO L225 Difference]: With dead ends: 21226 [2021-06-05 09:15:28,890 INFO L226 Difference]: Without dead ends: 21226 [2021-06-05 09:15:28,890 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 318.0ms TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2021-06-05 09:15:29,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21226 states. [2021-06-05 09:15:29,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21226 to 18388. [2021-06-05 09:15:29,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18388 states, 18388 states have (on average 3.0606917554927127) internal successors, (56280), 18387 states have internal predecessors, (56280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:29,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18388 states to 18388 states and 56280 transitions. [2021-06-05 09:15:29,295 INFO L78 Accepts]: Start accepts. Automaton has 18388 states and 56280 transitions. Word has length 59 [2021-06-05 09:15:29,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:29,295 INFO L482 AbstractCegarLoop]: Abstraction has 18388 states and 56280 transitions. [2021-06-05 09:15:29,295 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 17 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:29,295 INFO L276 IsEmpty]: Start isEmpty. Operand 18388 states and 56280 transitions. [2021-06-05 09:15:29,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:15:29,307 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:29,307 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:29,507 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 88 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2021-06-05 09:15:29,508 INFO L430 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:29,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:29,508 INFO L82 PathProgramCache]: Analyzing trace with hash -615353354, now seen corresponding path program 1 times [2021-06-05 09:15:29,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:29,508 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037997459] [2021-06-05 09:15:29,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:29,585 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:29,585 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:29,586 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037997459] [2021-06-05 09:15:29,586 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037997459] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:29,586 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:29,586 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 09:15:29,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680145974] [2021-06-05 09:15:29,586 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 09:15:29,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:29,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 09:15:29,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 09:15:29,587 INFO L87 Difference]: Start difference. First operand 18388 states and 56280 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:29,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:29,878 INFO L93 Difference]: Finished difference Result 20282 states and 62374 transitions. [2021-06-05 09:15:29,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 09:15:29,878 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:15:29,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:30,063 INFO L225 Difference]: With dead ends: 20282 [2021-06-05 09:15:30,063 INFO L226 Difference]: Without dead ends: 20282 [2021-06-05 09:15:30,063 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 62.9ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:15:30,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20282 states. [2021-06-05 09:15:30,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20282 to 18916. [2021-06-05 09:15:30,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18916 states, 18916 states have (on average 3.0636498202579827) internal successors, (57952), 18915 states have internal predecessors, (57952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:30,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18916 states to 18916 states and 57952 transitions. [2021-06-05 09:15:30,540 INFO L78 Accepts]: Start accepts. Automaton has 18916 states and 57952 transitions. Word has length 63 [2021-06-05 09:15:30,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:30,541 INFO L482 AbstractCegarLoop]: Abstraction has 18916 states and 57952 transitions. [2021-06-05 09:15:30,541 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:30,541 INFO L276 IsEmpty]: Start isEmpty. Operand 18916 states and 57952 transitions. [2021-06-05 09:15:30,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:15:30,554 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:30,554 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:30,554 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2021-06-05 09:15:30,554 INFO L430 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:30,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:30,554 INFO L82 PathProgramCache]: Analyzing trace with hash 491573329, now seen corresponding path program 1 times [2021-06-05 09:15:30,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:30,554 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156059823] [2021-06-05 09:15:30,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:30,643 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:30,643 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:30,643 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156059823] [2021-06-05 09:15:30,643 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156059823] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:30,643 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:30,643 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:15:30,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026365472] [2021-06-05 09:15:30,643 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:15:30,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:30,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:15:30,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:15:30,644 INFO L87 Difference]: Start difference. First operand 18916 states and 57952 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:31,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:31,066 INFO L93 Difference]: Finished difference Result 21124 states and 64943 transitions. [2021-06-05 09:15:31,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 09:15:31,067 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:15:31,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:31,099 INFO L225 Difference]: With dead ends: 21124 [2021-06-05 09:15:31,100 INFO L226 Difference]: Without dead ends: 21124 [2021-06-05 09:15:31,100 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 108.9ms TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:15:31,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21124 states. [2021-06-05 09:15:31,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21124 to 19266. [2021-06-05 09:15:31,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19266 states, 19266 states have (on average 3.064310183743382) internal successors, (59037), 19265 states have internal predecessors, (59037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:31,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19266 states to 19266 states and 59037 transitions. [2021-06-05 09:15:31,626 INFO L78 Accepts]: Start accepts. Automaton has 19266 states and 59037 transitions. Word has length 63 [2021-06-05 09:15:31,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:31,627 INFO L482 AbstractCegarLoop]: Abstraction has 19266 states and 59037 transitions. [2021-06-05 09:15:31,627 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:31,627 INFO L276 IsEmpty]: Start isEmpty. Operand 19266 states and 59037 transitions. [2021-06-05 09:15:31,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:15:31,641 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:31,641 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:31,641 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-06-05 09:15:31,641 INFO L430 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:31,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:31,642 INFO L82 PathProgramCache]: Analyzing trace with hash -2116440532, now seen corresponding path program 2 times [2021-06-05 09:15:31,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:31,642 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407362132] [2021-06-05 09:15:31,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:31,740 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:31,740 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407362132] [2021-06-05 09:15:31,740 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407362132] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:31,741 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:31,741 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:15:31,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170374369] [2021-06-05 09:15:31,741 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:15:31,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:31,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:15:31,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:15:31,741 INFO L87 Difference]: Start difference. First operand 19266 states and 59037 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:32,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:32,214 INFO L93 Difference]: Finished difference Result 21534 states and 66238 transitions. [2021-06-05 09:15:32,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:15:32,214 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:15:32,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:32,247 INFO L225 Difference]: With dead ends: 21534 [2021-06-05 09:15:32,247 INFO L226 Difference]: Without dead ends: 21534 [2021-06-05 09:15:32,247 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 104.0ms TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:15:32,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21534 states. [2021-06-05 09:15:32,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21534 to 19316. [2021-06-05 09:15:32,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19316 states, 19316 states have (on average 3.064402567819424) internal successors, (59192), 19315 states have internal predecessors, (59192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:32,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19316 states to 19316 states and 59192 transitions. [2021-06-05 09:15:32,594 INFO L78 Accepts]: Start accepts. Automaton has 19316 states and 59192 transitions. Word has length 63 [2021-06-05 09:15:32,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:32,594 INFO L482 AbstractCegarLoop]: Abstraction has 19316 states and 59192 transitions. [2021-06-05 09:15:32,594 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:32,594 INFO L276 IsEmpty]: Start isEmpty. Operand 19316 states and 59192 transitions. [2021-06-05 09:15:32,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:15:32,608 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:32,608 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:32,608 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2021-06-05 09:15:32,608 INFO L430 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:32,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:32,609 INFO L82 PathProgramCache]: Analyzing trace with hash -161387891, now seen corresponding path program 2 times [2021-06-05 09:15:32,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:32,609 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469719655] [2021-06-05 09:15:32,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:32,789 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:32,789 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:32,789 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469719655] [2021-06-05 09:15:32,789 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469719655] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:32,789 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:32,789 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 09:15:32,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87555090] [2021-06-05 09:15:32,790 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 09:15:32,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:32,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 09:15:32,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 09:15:32,790 INFO L87 Difference]: Start difference. First operand 19316 states and 59192 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:33,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:33,041 INFO L93 Difference]: Finished difference Result 21258 states and 65426 transitions. [2021-06-05 09:15:33,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 09:15:33,042 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:15:33,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:33,077 INFO L225 Difference]: With dead ends: 21258 [2021-06-05 09:15:33,077 INFO L226 Difference]: Without dead ends: 21258 [2021-06-05 09:15:33,077 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 53.1ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:15:33,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21258 states. [2021-06-05 09:15:33,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21258 to 19732. [2021-06-05 09:15:33,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19732 states, 19732 states have (on average 3.0664909791202106) internal successors, (60508), 19731 states have internal predecessors, (60508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:33,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19732 states to 19732 states and 60508 transitions. [2021-06-05 09:15:33,577 INFO L78 Accepts]: Start accepts. Automaton has 19732 states and 60508 transitions. Word has length 63 [2021-06-05 09:15:33,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:33,577 INFO L482 AbstractCegarLoop]: Abstraction has 19732 states and 60508 transitions. [2021-06-05 09:15:33,577 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:33,577 INFO L276 IsEmpty]: Start isEmpty. Operand 19732 states and 60508 transitions. [2021-06-05 09:15:33,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:15:33,591 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:33,591 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:33,592 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2021-06-05 09:15:33,592 INFO L430 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:33,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:33,592 INFO L82 PathProgramCache]: Analyzing trace with hash 898568609, now seen corresponding path program 3 times [2021-06-05 09:15:33,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:33,592 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165981229] [2021-06-05 09:15:33,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:33,678 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:33,678 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:33,678 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165981229] [2021-06-05 09:15:33,678 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165981229] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:33,678 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:33,678 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:15:33,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144431022] [2021-06-05 09:15:33,678 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:15:33,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:33,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:15:33,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:15:33,679 INFO L87 Difference]: Start difference. First operand 19732 states and 60508 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:34,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:34,059 INFO L93 Difference]: Finished difference Result 21630 states and 66578 transitions. [2021-06-05 09:15:34,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:15:34,059 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:15:34,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:34,094 INFO L225 Difference]: With dead ends: 21630 [2021-06-05 09:15:34,094 INFO L226 Difference]: Without dead ends: 21630 [2021-06-05 09:15:34,094 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 92.0ms TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:15:34,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21630 states. [2021-06-05 09:15:34,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21630 to 19732. [2021-06-05 09:15:34,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19732 states, 19732 states have (on average 3.0664909791202106) internal successors, (60508), 19731 states have internal predecessors, (60508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:34,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19732 states to 19732 states and 60508 transitions. [2021-06-05 09:15:34,627 INFO L78 Accepts]: Start accepts. Automaton has 19732 states and 60508 transitions. Word has length 63 [2021-06-05 09:15:34,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:34,627 INFO L482 AbstractCegarLoop]: Abstraction has 19732 states and 60508 transitions. [2021-06-05 09:15:34,627 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:34,627 INFO L276 IsEmpty]: Start isEmpty. Operand 19732 states and 60508 transitions. [2021-06-05 09:15:34,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:15:34,642 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:34,642 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:34,642 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2021-06-05 09:15:34,642 INFO L430 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:34,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:34,642 INFO L82 PathProgramCache]: Analyzing trace with hash 744579248, now seen corresponding path program 3 times [2021-06-05 09:15:34,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:34,642 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063600273] [2021-06-05 09:15:34,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:34,745 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:34,745 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:34,745 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063600273] [2021-06-05 09:15:34,745 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063600273] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:34,745 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:34,745 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:15:34,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624391250] [2021-06-05 09:15:34,745 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:15:34,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:34,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:15:34,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:15:34,746 INFO L87 Difference]: Start difference. First operand 19732 states and 60508 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:35,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:35,231 INFO L93 Difference]: Finished difference Result 22840 states and 70229 transitions. [2021-06-05 09:15:35,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 09:15:35,231 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:15:35,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:35,266 INFO L225 Difference]: With dead ends: 22840 [2021-06-05 09:15:35,266 INFO L226 Difference]: Without dead ends: 22840 [2021-06-05 09:15:35,266 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 122.7ms TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:15:35,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22840 states. [2021-06-05 09:15:35,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22840 to 20282. [2021-06-05 09:15:35,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20282 states, 20282 states have (on average 3.0698649048417317) internal successors, (62263), 20281 states have internal predecessors, (62263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:35,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20282 states to 20282 states and 62263 transitions. [2021-06-05 09:15:35,781 INFO L78 Accepts]: Start accepts. Automaton has 20282 states and 62263 transitions. Word has length 63 [2021-06-05 09:15:35,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:35,781 INFO L482 AbstractCegarLoop]: Abstraction has 20282 states and 62263 transitions. [2021-06-05 09:15:35,781 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:35,781 INFO L276 IsEmpty]: Start isEmpty. Operand 20282 states and 62263 transitions. [2021-06-05 09:15:35,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:15:35,797 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:35,797 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:35,797 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2021-06-05 09:15:35,797 INFO L430 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:35,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:35,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1344252942, now seen corresponding path program 4 times [2021-06-05 09:15:35,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:35,798 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383261052] [2021-06-05 09:15:35,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:35,884 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:35,884 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:35,884 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383261052] [2021-06-05 09:15:35,884 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383261052] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:35,884 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:35,884 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:15:35,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788785623] [2021-06-05 09:15:35,885 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:15:35,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:35,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:15:35,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:15:35,885 INFO L87 Difference]: Start difference. First operand 20282 states and 62263 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:36,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:36,230 INFO L93 Difference]: Finished difference Result 22370 states and 68852 transitions. [2021-06-05 09:15:36,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:15:36,231 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:15:36,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:36,265 INFO L225 Difference]: With dead ends: 22370 [2021-06-05 09:15:36,265 INFO L226 Difference]: Without dead ends: 22370 [2021-06-05 09:15:36,265 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 95.5ms TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:15:36,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22370 states. [2021-06-05 09:15:36,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22370 to 20292. [2021-06-05 09:15:36,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20292 states, 20292 states have (on average 3.069879755568697) internal successors, (62294), 20291 states have internal predecessors, (62294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:36,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20292 states to 20292 states and 62294 transitions. [2021-06-05 09:15:36,820 INFO L78 Accepts]: Start accepts. Automaton has 20292 states and 62294 transitions. Word has length 63 [2021-06-05 09:15:36,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:36,821 INFO L482 AbstractCegarLoop]: Abstraction has 20292 states and 62294 transitions. [2021-06-05 09:15:36,821 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:36,821 INFO L276 IsEmpty]: Start isEmpty. Operand 20292 states and 62294 transitions. [2021-06-05 09:15:36,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:15:36,837 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:36,837 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:36,837 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2021-06-05 09:15:36,837 INFO L430 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:36,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:36,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1670756199, now seen corresponding path program 4 times [2021-06-05 09:15:36,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:36,837 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056102808] [2021-06-05 09:15:36,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:36,925 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:36,925 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:36,926 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056102808] [2021-06-05 09:15:36,926 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056102808] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:36,926 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:36,926 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:15:36,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552872336] [2021-06-05 09:15:36,926 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:15:36,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:36,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:15:36,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:15:36,926 INFO L87 Difference]: Start difference. First operand 20292 states and 62294 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:37,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:37,506 INFO L93 Difference]: Finished difference Result 22250 states and 68540 transitions. [2021-06-05 09:15:37,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:15:37,507 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:15:37,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:37,543 INFO L225 Difference]: With dead ends: 22250 [2021-06-05 09:15:37,543 INFO L226 Difference]: Without dead ends: 22250 [2021-06-05 09:15:37,543 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 94.5ms TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:15:37,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22250 states. [2021-06-05 09:15:37,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22250 to 20282. [2021-06-05 09:15:37,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20282 states, 20282 states have (on average 3.0698649048417317) internal successors, (62263), 20281 states have internal predecessors, (62263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:37,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20282 states to 20282 states and 62263 transitions. [2021-06-05 09:15:37,939 INFO L78 Accepts]: Start accepts. Automaton has 20282 states and 62263 transitions. Word has length 63 [2021-06-05 09:15:37,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:37,939 INFO L482 AbstractCegarLoop]: Abstraction has 20282 states and 62263 transitions. [2021-06-05 09:15:37,939 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:37,940 INFO L276 IsEmpty]: Start isEmpty. Operand 20282 states and 62263 transitions. [2021-06-05 09:15:37,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:15:37,959 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:37,959 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:37,959 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2021-06-05 09:15:37,959 INFO L430 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:37,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:37,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1860169629, now seen corresponding path program 5 times [2021-06-05 09:15:37,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:37,960 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313628186] [2021-06-05 09:15:37,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:38,060 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:38,061 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:38,061 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313628186] [2021-06-05 09:15:38,061 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313628186] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:38,061 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:38,061 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:15:38,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139848039] [2021-06-05 09:15:38,062 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:15:38,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:38,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:15:38,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:15:38,063 INFO L87 Difference]: Start difference. First operand 20282 states and 62263 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:38,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:38,589 INFO L93 Difference]: Finished difference Result 22492 states and 69269 transitions. [2021-06-05 09:15:38,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 09:15:38,590 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:15:38,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:38,628 INFO L225 Difference]: With dead ends: 22492 [2021-06-05 09:15:38,628 INFO L226 Difference]: Without dead ends: 22492 [2021-06-05 09:15:38,628 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 109.4ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:15:38,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22492 states. [2021-06-05 09:15:39,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22492 to 20162. [2021-06-05 09:15:39,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20162 states, 20162 states have (on average 3.069685547068743) internal successors, (61891), 20161 states have internal predecessors, (61891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20162 states to 20162 states and 61891 transitions. [2021-06-05 09:15:39,098 INFO L78 Accepts]: Start accepts. Automaton has 20162 states and 61891 transitions. Word has length 63 [2021-06-05 09:15:39,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:39,098 INFO L482 AbstractCegarLoop]: Abstraction has 20162 states and 61891 transitions. [2021-06-05 09:15:39,099 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:39,099 INFO L276 IsEmpty]: Start isEmpty. Operand 20162 states and 61891 transitions. [2021-06-05 09:15:39,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:15:39,113 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:39,113 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:39,114 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2021-06-05 09:15:39,114 INFO L430 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:39,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:39,114 INFO L82 PathProgramCache]: Analyzing trace with hash 146186922, now seen corresponding path program 5 times [2021-06-05 09:15:39,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:39,114 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298931776] [2021-06-05 09:15:39,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:39,228 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:39,228 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:39,228 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298931776] [2021-06-05 09:15:39,229 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298931776] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:39,229 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:39,229 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:15:39,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661180109] [2021-06-05 09:15:39,231 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:15:39,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:39,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:15:39,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:15:39,231 INFO L87 Difference]: Start difference. First operand 20162 states and 61891 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:39,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:39,811 INFO L93 Difference]: Finished difference Result 22320 states and 68717 transitions. [2021-06-05 09:15:39,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:15:39,812 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:15:39,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:39,847 INFO L225 Difference]: With dead ends: 22320 [2021-06-05 09:15:39,847 INFO L226 Difference]: Without dead ends: 22320 [2021-06-05 09:15:39,847 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 120.8ms TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:15:39,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22320 states. [2021-06-05 09:15:40,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22320 to 20172. [2021-06-05 09:15:40,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20172 states, 20172 states have (on average 3.069700575054531) internal successors, (61922), 20171 states have internal predecessors, (61922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20172 states to 20172 states and 61922 transitions. [2021-06-05 09:15:40,224 INFO L78 Accepts]: Start accepts. Automaton has 20172 states and 61922 transitions. Word has length 63 [2021-06-05 09:15:40,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:40,224 INFO L482 AbstractCegarLoop]: Abstraction has 20172 states and 61922 transitions. [2021-06-05 09:15:40,224 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:40,224 INFO L276 IsEmpty]: Start isEmpty. Operand 20172 states and 61922 transitions. [2021-06-05 09:15:40,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:15:40,238 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:40,238 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:40,238 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2021-06-05 09:15:40,238 INFO L430 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:40,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:40,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1133771233, now seen corresponding path program 6 times [2021-06-05 09:15:40,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:40,239 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764596266] [2021-06-05 09:15:40,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:40,336 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:40,336 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764596266] [2021-06-05 09:15:40,337 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764596266] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:40,337 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:40,337 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:15:40,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280196768] [2021-06-05 09:15:40,337 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:15:40,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:40,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:15:40,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:15:40,338 INFO L87 Difference]: Start difference. First operand 20172 states and 61922 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:40,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:40,913 INFO L93 Difference]: Finished difference Result 22672 states and 69817 transitions. [2021-06-05 09:15:40,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:15:40,914 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:15:40,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:40,950 INFO L225 Difference]: With dead ends: 22672 [2021-06-05 09:15:40,950 INFO L226 Difference]: Without dead ends: 22672 [2021-06-05 09:15:40,950 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 103.6ms TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:15:41,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22672 states. [2021-06-05 09:15:41,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22672 to 20132. [2021-06-05 09:15:41,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20132 states, 20132 states have (on average 3.0696403735346713) internal successors, (61798), 20131 states have internal predecessors, (61798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:41,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20132 states to 20132 states and 61798 transitions. [2021-06-05 09:15:41,324 INFO L78 Accepts]: Start accepts. Automaton has 20132 states and 61798 transitions. Word has length 63 [2021-06-05 09:15:41,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:41,324 INFO L482 AbstractCegarLoop]: Abstraction has 20132 states and 61798 transitions. [2021-06-05 09:15:41,324 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:41,324 INFO L276 IsEmpty]: Start isEmpty. Operand 20132 states and 61798 transitions. [2021-06-05 09:15:41,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:15:41,337 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:41,337 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:41,338 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2021-06-05 09:15:41,338 INFO L430 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:41,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:41,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1054936251, now seen corresponding path program 7 times [2021-06-05 09:15:41,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:41,338 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236015175] [2021-06-05 09:15:41,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:41,455 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:41,455 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:41,455 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236015175] [2021-06-05 09:15:41,455 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236015175] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:41,455 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:41,456 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 09:15:41,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773541392] [2021-06-05 09:15:41,456 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 09:15:41,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:41,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 09:15:41,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:15:41,456 INFO L87 Difference]: Start difference. First operand 20132 states and 61798 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:41,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:41,999 INFO L93 Difference]: Finished difference Result 22322 states and 68774 transitions. [2021-06-05 09:15:42,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:15:42,000 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:15:42,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:42,032 INFO L225 Difference]: With dead ends: 22322 [2021-06-05 09:15:42,032 INFO L226 Difference]: Without dead ends: 22322 [2021-06-05 09:15:42,033 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 120.8ms TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:15:42,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22322 states. [2021-06-05 09:15:42,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22322 to 20696. [2021-06-05 09:15:42,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20696 states, 20696 states have (on average 3.0704483958252804) internal successors, (63546), 20695 states have internal predecessors, (63546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:42,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20696 states to 20696 states and 63546 transitions. [2021-06-05 09:15:42,403 INFO L78 Accepts]: Start accepts. Automaton has 20696 states and 63546 transitions. Word has length 63 [2021-06-05 09:15:42,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:42,404 INFO L482 AbstractCegarLoop]: Abstraction has 20696 states and 63546 transitions. [2021-06-05 09:15:42,404 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:42,404 INFO L276 IsEmpty]: Start isEmpty. Operand 20696 states and 63546 transitions. [2021-06-05 09:15:42,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:15:42,420 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:42,420 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:42,421 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2021-06-05 09:15:42,421 INFO L430 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:42,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:42,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1644367924, now seen corresponding path program 6 times [2021-06-05 09:15:42,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:42,422 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123368106] [2021-06-05 09:15:42,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:42,487 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:42,488 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:42,488 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123368106] [2021-06-05 09:15:42,488 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123368106] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:42,488 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:42,488 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-05 09:15:42,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136086126] [2021-06-05 09:15:42,488 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 09:15:42,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:42,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 09:15:42,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-06-05 09:15:42,488 INFO L87 Difference]: Start difference. First operand 20696 states and 63546 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:42,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:42,715 INFO L93 Difference]: Finished difference Result 21000 states and 64506 transitions. [2021-06-05 09:15:42,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 09:15:42,716 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:15:42,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:42,960 INFO L225 Difference]: With dead ends: 21000 [2021-06-05 09:15:42,960 INFO L226 Difference]: Without dead ends: 21000 [2021-06-05 09:15:42,960 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 52.7ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-06-05 09:15:43,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21000 states. [2021-06-05 09:15:43,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21000 to 21000. [2021-06-05 09:15:43,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21000 states, 21000 states have (on average 3.0717142857142856) internal successors, (64506), 20999 states have internal predecessors, (64506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:43,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21000 states to 21000 states and 64506 transitions. [2021-06-05 09:15:43,385 INFO L78 Accepts]: Start accepts. Automaton has 21000 states and 64506 transitions. Word has length 63 [2021-06-05 09:15:43,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:43,385 INFO L482 AbstractCegarLoop]: Abstraction has 21000 states and 64506 transitions. [2021-06-05 09:15:43,385 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:43,385 INFO L276 IsEmpty]: Start isEmpty. Operand 21000 states and 64506 transitions. [2021-06-05 09:15:43,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:15:43,399 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:43,399 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:43,399 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2021-06-05 09:15:43,399 INFO L430 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:43,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:43,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1431138379, now seen corresponding path program 1 times [2021-06-05 09:15:43,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:43,400 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243863490] [2021-06-05 09:15:43,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:43,545 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:43,545 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:43,546 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243863490] [2021-06-05 09:15:43,546 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243863490] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:43,546 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:43,546 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 09:15:43,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930717437] [2021-06-05 09:15:43,546 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 09:15:43,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:43,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 09:15:43,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:15:43,547 INFO L87 Difference]: Start difference. First operand 21000 states and 64506 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:44,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:44,061 INFO L93 Difference]: Finished difference Result 22130 states and 67899 transitions. [2021-06-05 09:15:44,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 09:15:44,061 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:15:44,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:44,108 INFO L225 Difference]: With dead ends: 22130 [2021-06-05 09:15:44,108 INFO L226 Difference]: Without dead ends: 22130 [2021-06-05 09:15:44,108 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 152.9ms TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:15:44,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22130 states. [2021-06-05 09:15:44,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22130 to 21080. [2021-06-05 09:15:44,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21080 states, 21080 states have (on average 3.071821631878558) internal successors, (64754), 21079 states have internal predecessors, (64754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21080 states to 21080 states and 64754 transitions. [2021-06-05 09:15:44,775 INFO L78 Accepts]: Start accepts. Automaton has 21080 states and 64754 transitions. Word has length 63 [2021-06-05 09:15:44,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:44,775 INFO L482 AbstractCegarLoop]: Abstraction has 21080 states and 64754 transitions. [2021-06-05 09:15:44,776 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:44,776 INFO L276 IsEmpty]: Start isEmpty. Operand 21080 states and 64754 transitions. [2021-06-05 09:15:44,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:15:44,791 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:44,791 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:44,791 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2021-06-05 09:15:44,791 INFO L430 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:44,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:44,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1887052595, now seen corresponding path program 8 times [2021-06-05 09:15:44,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:44,791 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65658895] [2021-06-05 09:15:44,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:44,909 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:44,909 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:44,909 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65658895] [2021-06-05 09:15:44,909 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65658895] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:44,909 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:44,909 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 09:15:44,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475748635] [2021-06-05 09:15:44,909 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 09:15:44,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:44,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 09:15:44,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:15:44,910 INFO L87 Difference]: Start difference. First operand 21080 states and 64754 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:45,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:45,460 INFO L93 Difference]: Finished difference Result 21670 states and 66583 transitions. [2021-06-05 09:15:45,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 09:15:45,460 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:15:45,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:45,501 INFO L225 Difference]: With dead ends: 21670 [2021-06-05 09:15:45,501 INFO L226 Difference]: Without dead ends: 21670 [2021-06-05 09:15:45,501 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 130.4ms TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:15:45,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21670 states. [2021-06-05 09:15:45,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21670 to 21090. [2021-06-05 09:15:45,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21090 states, 21090 states have (on average 3.0718349928876245) internal successors, (64785), 21089 states have internal predecessors, (64785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:45,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21090 states to 21090 states and 64785 transitions. [2021-06-05 09:15:45,992 INFO L78 Accepts]: Start accepts. Automaton has 21090 states and 64785 transitions. Word has length 63 [2021-06-05 09:15:45,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:45,992 INFO L482 AbstractCegarLoop]: Abstraction has 21090 states and 64785 transitions. [2021-06-05 09:15:45,992 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:45,992 INFO L276 IsEmpty]: Start isEmpty. Operand 21090 states and 64785 transitions. [2021-06-05 09:15:46,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:15:46,007 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:46,008 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:46,008 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2021-06-05 09:15:46,008 INFO L430 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:46,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:46,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1111044443, now seen corresponding path program 2 times [2021-06-05 09:15:46,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:46,008 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567432255] [2021-06-05 09:15:46,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:46,093 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:46,093 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:46,093 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567432255] [2021-06-05 09:15:46,093 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567432255] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:46,094 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:46,094 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:15:46,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914919939] [2021-06-05 09:15:46,094 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:15:46,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:46,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:15:46,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:15:46,094 INFO L87 Difference]: Start difference. First operand 21090 states and 64785 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:46,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:46,447 INFO L93 Difference]: Finished difference Result 21750 states and 66831 transitions. [2021-06-05 09:15:46,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 09:15:46,447 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:15:46,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:46,481 INFO L225 Difference]: With dead ends: 21750 [2021-06-05 09:15:46,481 INFO L226 Difference]: Without dead ends: 21750 [2021-06-05 09:15:46,482 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 79.5ms TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-06-05 09:15:46,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21750 states. [2021-06-05 09:15:46,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21750 to 21130. [2021-06-05 09:15:46,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21130 states, 21130 states have (on average 3.071888310459063) internal successors, (64909), 21129 states have internal predecessors, (64909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:47,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21130 states to 21130 states and 64909 transitions. [2021-06-05 09:15:47,024 INFO L78 Accepts]: Start accepts. Automaton has 21130 states and 64909 transitions. Word has length 63 [2021-06-05 09:15:47,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:47,024 INFO L482 AbstractCegarLoop]: Abstraction has 21130 states and 64909 transitions. [2021-06-05 09:15:47,024 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:47,024 INFO L276 IsEmpty]: Start isEmpty. Operand 21130 states and 64909 transitions. [2021-06-05 09:15:47,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:15:47,042 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:47,042 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:47,042 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2021-06-05 09:15:47,042 INFO L430 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:47,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:47,042 INFO L82 PathProgramCache]: Analyzing trace with hash -916016680, now seen corresponding path program 7 times [2021-06-05 09:15:47,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:47,043 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640176244] [2021-06-05 09:15:47,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:47,124 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:47,124 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640176244] [2021-06-05 09:15:47,124 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640176244] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:47,124 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:47,124 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:15:47,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602212896] [2021-06-05 09:15:47,124 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:15:47,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:47,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:15:47,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:15:47,125 INFO L87 Difference]: Start difference. First operand 21130 states and 64909 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:47,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:47,463 INFO L93 Difference]: Finished difference Result 21776 states and 66850 transitions. [2021-06-05 09:15:47,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 09:15:47,463 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:15:47,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:47,496 INFO L225 Difference]: With dead ends: 21776 [2021-06-05 09:15:47,496 INFO L226 Difference]: Without dead ends: 21776 [2021-06-05 09:15:47,496 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 80.4ms TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-06-05 09:15:47,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21776 states. [2021-06-05 09:15:47,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21776 to 21145. [2021-06-05 09:15:47,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21145 states, 21145 states have (on average 3.071884606289903) internal successors, (64955), 21144 states have internal predecessors, (64955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:47,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21145 states to 21145 states and 64955 transitions. [2021-06-05 09:15:47,885 INFO L78 Accepts]: Start accepts. Automaton has 21145 states and 64955 transitions. Word has length 63 [2021-06-05 09:15:47,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:47,885 INFO L482 AbstractCegarLoop]: Abstraction has 21145 states and 64955 transitions. [2021-06-05 09:15:47,885 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:47,885 INFO L276 IsEmpty]: Start isEmpty. Operand 21145 states and 64955 transitions. [2021-06-05 09:15:48,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:15:48,094 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:48,094 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:48,094 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2021-06-05 09:15:48,094 INFO L430 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:48,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:48,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1609905729, now seen corresponding path program 9 times [2021-06-05 09:15:48,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:48,095 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206943774] [2021-06-05 09:15:48,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:48,203 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:48,203 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:48,203 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206943774] [2021-06-05 09:15:48,203 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206943774] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:48,203 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:48,203 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:15:48,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114158634] [2021-06-05 09:15:48,204 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:15:48,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:48,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:15:48,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:15:48,204 INFO L87 Difference]: Start difference. First operand 21145 states and 64955 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:48,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:48,562 INFO L93 Difference]: Finished difference Result 21896 states and 67222 transitions. [2021-06-05 09:15:48,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 09:15:48,562 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:15:48,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:48,597 INFO L225 Difference]: With dead ends: 21896 [2021-06-05 09:15:48,597 INFO L226 Difference]: Without dead ends: 21896 [2021-06-05 09:15:48,597 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 100.8ms TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-06-05 09:15:48,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21896 states. [2021-06-05 09:15:48,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21896 to 21135. [2021-06-05 09:15:49,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21135 states, 21135 states have (on average 3.0718713035249587) internal successors, (64924), 21134 states have internal predecessors, (64924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:49,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21135 states to 21135 states and 64924 transitions. [2021-06-05 09:15:49,054 INFO L78 Accepts]: Start accepts. Automaton has 21135 states and 64924 transitions. Word has length 63 [2021-06-05 09:15:49,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:49,054 INFO L482 AbstractCegarLoop]: Abstraction has 21135 states and 64924 transitions. [2021-06-05 09:15:49,054 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:49,054 INFO L276 IsEmpty]: Start isEmpty. Operand 21135 states and 64924 transitions. [2021-06-05 09:15:49,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:15:49,068 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:49,068 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:49,068 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2021-06-05 09:15:49,068 INFO L430 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:49,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:49,069 INFO L82 PathProgramCache]: Analyzing trace with hash -957139867, now seen corresponding path program 3 times [2021-06-05 09:15:49,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:49,069 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100769145] [2021-06-05 09:15:49,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:49,177 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:49,177 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:49,177 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100769145] [2021-06-05 09:15:49,177 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100769145] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:49,177 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:49,177 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 09:15:49,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418542519] [2021-06-05 09:15:49,178 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 09:15:49,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:49,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 09:15:49,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:15:49,178 INFO L87 Difference]: Start difference. First operand 21135 states and 64924 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:49,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:49,657 INFO L93 Difference]: Finished difference Result 22744 states and 69890 transitions. [2021-06-05 09:15:49,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:15:49,657 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:15:49,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:49,688 INFO L225 Difference]: With dead ends: 22744 [2021-06-05 09:15:49,688 INFO L226 Difference]: Without dead ends: 22744 [2021-06-05 09:15:49,688 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 109.7ms TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:15:49,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22744 states. [2021-06-05 09:15:49,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22744 to 21148. [2021-06-05 09:15:50,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21148 states, 21148 states have (on average 3.0718744089275583) internal successors, (64964), 21147 states have internal predecessors, (64964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:50,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21148 states to 21148 states and 64964 transitions. [2021-06-05 09:15:50,060 INFO L78 Accepts]: Start accepts. Automaton has 21148 states and 64964 transitions. Word has length 63 [2021-06-05 09:15:50,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:50,060 INFO L482 AbstractCegarLoop]: Abstraction has 21148 states and 64964 transitions. [2021-06-05 09:15:50,060 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:50,060 INFO L276 IsEmpty]: Start isEmpty. Operand 21148 states and 64964 transitions. [2021-06-05 09:15:50,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:15:50,076 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:50,077 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:50,077 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2021-06-05 09:15:50,077 INFO L430 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:50,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:50,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1933916189, now seen corresponding path program 10 times [2021-06-05 09:15:50,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:50,077 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122077535] [2021-06-05 09:15:50,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:50,186 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:50,186 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:50,186 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122077535] [2021-06-05 09:15:50,186 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122077535] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:50,186 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:50,187 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 09:15:50,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871531761] [2021-06-05 09:15:50,187 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 09:15:50,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:50,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 09:15:50,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:15:50,187 INFO L87 Difference]: Start difference. First operand 21148 states and 64964 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:50,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:50,538 INFO L93 Difference]: Finished difference Result 22744 states and 69890 transitions. [2021-06-05 09:15:50,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:15:50,538 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:15:50,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:50,574 INFO L225 Difference]: With dead ends: 22744 [2021-06-05 09:15:50,574 INFO L226 Difference]: Without dead ends: 22744 [2021-06-05 09:15:50,574 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 110.7ms TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:15:50,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22744 states. [2021-06-05 09:15:50,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22744 to 21148. [2021-06-05 09:15:51,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21148 states, 21148 states have (on average 3.0718744089275583) internal successors, (64964), 21147 states have internal predecessors, (64964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:51,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21148 states to 21148 states and 64964 transitions. [2021-06-05 09:15:51,048 INFO L78 Accepts]: Start accepts. Automaton has 21148 states and 64964 transitions. Word has length 63 [2021-06-05 09:15:51,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:51,049 INFO L482 AbstractCegarLoop]: Abstraction has 21148 states and 64964 transitions. [2021-06-05 09:15:51,049 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:51,049 INFO L276 IsEmpty]: Start isEmpty. Operand 21148 states and 64964 transitions. [2021-06-05 09:15:51,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:15:51,065 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:51,065 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:51,065 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2021-06-05 09:15:51,065 INFO L430 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:51,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:51,065 INFO L82 PathProgramCache]: Analyzing trace with hash -307250896, now seen corresponding path program 8 times [2021-06-05 09:15:51,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:51,065 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387312238] [2021-06-05 09:15:51,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:51,192 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:51,192 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:51,192 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387312238] [2021-06-05 09:15:51,192 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387312238] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:51,193 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:51,193 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 09:15:51,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643098987] [2021-06-05 09:15:51,193 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 09:15:51,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:51,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 09:15:51,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-06-05 09:15:51,193 INFO L87 Difference]: Start difference. First operand 21148 states and 64964 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:51,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:51,696 INFO L93 Difference]: Finished difference Result 22884 states and 70324 transitions. [2021-06-05 09:15:51,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 09:15:51,696 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:15:51,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:51,730 INFO L225 Difference]: With dead ends: 22884 [2021-06-05 09:15:51,730 INFO L226 Difference]: Without dead ends: 22884 [2021-06-05 09:15:51,730 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 131.2ms TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:15:51,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22884 states. [2021-06-05 09:15:52,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22884 to 21268. [2021-06-05 09:15:52,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21268 states, 21268 states have (on average 3.072503291329697) internal successors, (65346), 21267 states have internal predecessors, (65346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21268 states to 21268 states and 65346 transitions. [2021-06-05 09:15:52,210 INFO L78 Accepts]: Start accepts. Automaton has 21268 states and 65346 transitions. Word has length 63 [2021-06-05 09:15:52,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:52,210 INFO L482 AbstractCegarLoop]: Abstraction has 21268 states and 65346 transitions. [2021-06-05 09:15:52,210 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:52,210 INFO L276 IsEmpty]: Start isEmpty. Operand 21268 states and 65346 transitions. [2021-06-05 09:15:52,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:15:52,226 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:52,226 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:52,226 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2021-06-05 09:15:52,227 INFO L430 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:52,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:52,227 INFO L82 PathProgramCache]: Analyzing trace with hash 589324887, now seen corresponding path program 4 times [2021-06-05 09:15:52,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:52,227 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636198425] [2021-06-05 09:15:52,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:52,344 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:52,344 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:52,344 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636198425] [2021-06-05 09:15:52,344 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636198425] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:52,344 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:52,344 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:15:52,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584576055] [2021-06-05 09:15:52,345 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:15:52,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:52,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:15:52,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:15:52,345 INFO L87 Difference]: Start difference. First operand 21268 states and 65346 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:52,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:52,721 INFO L93 Difference]: Finished difference Result 22638 states and 69593 transitions. [2021-06-05 09:15:52,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:15:52,722 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:15:52,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:52,755 INFO L225 Difference]: With dead ends: 22638 [2021-06-05 09:15:52,755 INFO L226 Difference]: Without dead ends: 22638 [2021-06-05 09:15:52,755 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 130.3ms TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:15:52,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22638 states. [2021-06-05 09:15:53,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22638 to 21388. [2021-06-05 09:15:53,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21388 states, 21388 states have (on average 3.0731251168879745) internal successors, (65728), 21387 states have internal predecessors, (65728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:53,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21388 states to 21388 states and 65728 transitions. [2021-06-05 09:15:53,159 INFO L78 Accepts]: Start accepts. Automaton has 21388 states and 65728 transitions. Word has length 63 [2021-06-05 09:15:53,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:53,160 INFO L482 AbstractCegarLoop]: Abstraction has 21388 states and 65728 transitions. [2021-06-05 09:15:53,160 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:53,160 INFO L276 IsEmpty]: Start isEmpty. Operand 21388 states and 65728 transitions. [2021-06-05 09:15:53,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:15:53,318 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:53,318 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:53,318 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2021-06-05 09:15:53,318 INFO L430 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:53,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:53,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1293265778, now seen corresponding path program 9 times [2021-06-05 09:15:53,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:53,319 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994827422] [2021-06-05 09:15:53,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:53,500 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:53,500 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:53,501 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994827422] [2021-06-05 09:15:53,501 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994827422] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:53,501 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:53,501 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 09:15:53,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786573120] [2021-06-05 09:15:53,501 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 09:15:53,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:53,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 09:15:53,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:15:53,502 INFO L87 Difference]: Start difference. First operand 21388 states and 65728 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:53,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:53,934 INFO L93 Difference]: Finished difference Result 22954 states and 70551 transitions. [2021-06-05 09:15:53,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:15:53,935 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:15:53,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:53,973 INFO L225 Difference]: With dead ends: 22954 [2021-06-05 09:15:53,974 INFO L226 Difference]: Without dead ends: 22954 [2021-06-05 09:15:53,974 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 168.3ms TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:15:54,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22954 states. [2021-06-05 09:15:54,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22954 to 21828. [2021-06-05 09:15:54,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21828 states, 21828 states have (on average 3.0754993586219537) internal successors, (67132), 21827 states have internal predecessors, (67132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:54,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21828 states to 21828 states and 67132 transitions. [2021-06-05 09:15:54,457 INFO L78 Accepts]: Start accepts. Automaton has 21828 states and 67132 transitions. Word has length 63 [2021-06-05 09:15:54,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:54,457 INFO L482 AbstractCegarLoop]: Abstraction has 21828 states and 67132 transitions. [2021-06-05 09:15:54,457 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:54,457 INFO L276 IsEmpty]: Start isEmpty. Operand 21828 states and 67132 transitions. [2021-06-05 09:15:54,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:15:54,474 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:54,474 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:54,474 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2021-06-05 09:15:54,474 INFO L430 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:54,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:54,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1656037714, now seen corresponding path program 10 times [2021-06-05 09:15:54,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:54,475 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341343901] [2021-06-05 09:15:54,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:54,583 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:54,583 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:54,584 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341343901] [2021-06-05 09:15:54,584 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341343901] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:54,584 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:54,584 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:15:54,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865999594] [2021-06-05 09:15:54,584 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:15:54,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:54,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:15:54,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:15:54,585 INFO L87 Difference]: Start difference. First operand 21828 states and 67132 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:55,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:55,085 INFO L93 Difference]: Finished difference Result 22589 states and 69430 transitions. [2021-06-05 09:15:55,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 09:15:55,086 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:15:55,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:55,119 INFO L225 Difference]: With dead ends: 22589 [2021-06-05 09:15:55,120 INFO L226 Difference]: Without dead ends: 22589 [2021-06-05 09:15:55,120 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 102.7ms TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-06-05 09:15:55,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22589 states. [2021-06-05 09:15:55,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22589 to 21828. [2021-06-05 09:15:55,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21828 states, 21828 states have (on average 3.0754993586219537) internal successors, (67132), 21827 states have internal predecessors, (67132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:55,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21828 states to 21828 states and 67132 transitions. [2021-06-05 09:15:55,516 INFO L78 Accepts]: Start accepts. Automaton has 21828 states and 67132 transitions. Word has length 63 [2021-06-05 09:15:55,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:55,516 INFO L482 AbstractCegarLoop]: Abstraction has 21828 states and 67132 transitions. [2021-06-05 09:15:55,516 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:55,516 INFO L276 IsEmpty]: Start isEmpty. Operand 21828 states and 67132 transitions. [2021-06-05 09:15:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:15:55,533 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:55,533 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:55,533 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2021-06-05 09:15:55,533 INFO L430 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:55,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:55,534 INFO L82 PathProgramCache]: Analyzing trace with hash 962148665, now seen corresponding path program 11 times [2021-06-05 09:15:55,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:55,534 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483213912] [2021-06-05 09:15:55,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:55,627 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:55,627 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:55,627 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483213912] [2021-06-05 09:15:55,627 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483213912] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:55,627 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:55,627 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:15:55,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575146854] [2021-06-05 09:15:55,628 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:15:55,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:55,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:15:55,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:15:55,628 INFO L87 Difference]: Start difference. First operand 21828 states and 67132 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:56,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:56,016 INFO L93 Difference]: Finished difference Result 22509 states and 69182 transitions. [2021-06-05 09:15:56,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 09:15:56,016 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:15:56,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:56,053 INFO L225 Difference]: With dead ends: 22509 [2021-06-05 09:15:56,053 INFO L226 Difference]: Without dead ends: 22509 [2021-06-05 09:15:56,054 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 96.7ms TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-06-05 09:15:56,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22509 states. [2021-06-05 09:15:56,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22509 to 21733. [2021-06-05 09:15:56,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21733 states, 21733 states have (on average 3.0754152671053236) internal successors, (66838), 21732 states have internal predecessors, (66838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:56,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21733 states to 21733 states and 66838 transitions. [2021-06-05 09:15:56,533 INFO L78 Accepts]: Start accepts. Automaton has 21733 states and 66838 transitions. Word has length 63 [2021-06-05 09:15:56,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:56,534 INFO L482 AbstractCegarLoop]: Abstraction has 21733 states and 66838 transitions. [2021-06-05 09:15:56,534 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:56,534 INFO L276 IsEmpty]: Start isEmpty. Operand 21733 states and 66838 transitions. [2021-06-05 09:15:56,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:15:56,552 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:56,552 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:56,552 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2021-06-05 09:15:56,552 INFO L430 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:56,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:56,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1649767882, now seen corresponding path program 11 times [2021-06-05 09:15:56,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:56,553 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962259797] [2021-06-05 09:15:56,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:56,647 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:56,647 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:56,647 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962259797] [2021-06-05 09:15:56,647 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962259797] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:56,647 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:56,647 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:15:56,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136348239] [2021-06-05 09:15:56,647 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:15:56,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:56,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:15:56,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:15:56,648 INFO L87 Difference]: Start difference. First operand 21733 states and 66838 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:57,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:57,050 INFO L93 Difference]: Finished difference Result 22943 states and 70469 transitions. [2021-06-05 09:15:57,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 09:15:57,051 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:15:57,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:57,085 INFO L225 Difference]: With dead ends: 22943 [2021-06-05 09:15:57,085 INFO L226 Difference]: Without dead ends: 22943 [2021-06-05 09:15:57,085 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 101.8ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:15:57,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22943 states. [2021-06-05 09:15:57,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22943 to 21293. [2021-06-05 09:15:57,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21293 states, 21293 states have (on average 3.0730286948762506) internal successors, (65434), 21292 states have internal predecessors, (65434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:57,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21293 states to 21293 states and 65434 transitions. [2021-06-05 09:15:57,624 INFO L78 Accepts]: Start accepts. Automaton has 21293 states and 65434 transitions. Word has length 63 [2021-06-05 09:15:57,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:57,624 INFO L482 AbstractCegarLoop]: Abstraction has 21293 states and 65434 transitions. [2021-06-05 09:15:57,624 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:57,624 INFO L276 IsEmpty]: Start isEmpty. Operand 21293 states and 65434 transitions. [2021-06-05 09:15:57,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:15:57,641 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:57,641 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:57,641 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2021-06-05 09:15:57,641 INFO L430 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:57,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:57,641 INFO L82 PathProgramCache]: Analyzing trace with hash -51548276, now seen corresponding path program 12 times [2021-06-05 09:15:57,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:57,642 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659071329] [2021-06-05 09:15:57,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:57,741 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:57,741 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:57,741 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659071329] [2021-06-05 09:15:57,742 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659071329] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:57,742 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:57,742 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:15:57,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808915074] [2021-06-05 09:15:57,742 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:15:57,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:57,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:15:57,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:15:57,742 INFO L87 Difference]: Start difference. First operand 21293 states and 65434 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:58,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:58,164 INFO L93 Difference]: Finished difference Result 22883 states and 70273 transitions. [2021-06-05 09:15:58,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:15:58,164 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:15:58,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:58,198 INFO L225 Difference]: With dead ends: 22883 [2021-06-05 09:15:58,198 INFO L226 Difference]: Without dead ends: 22883 [2021-06-05 09:15:58,199 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 106.4ms TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:15:58,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22883 states. [2021-06-05 09:15:58,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22883 to 21093. [2021-06-05 09:15:58,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21093 states, 21093 states have (on average 3.072298866922676) internal successors, (64804), 21092 states have internal predecessors, (64804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:58,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21093 states to 21093 states and 64804 transitions. [2021-06-05 09:15:58,602 INFO L78 Accepts]: Start accepts. Automaton has 21093 states and 64804 transitions. Word has length 63 [2021-06-05 09:15:58,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:58,602 INFO L482 AbstractCegarLoop]: Abstraction has 21093 states and 64804 transitions. [2021-06-05 09:15:58,602 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:58,602 INFO L276 IsEmpty]: Start isEmpty. Operand 21093 states and 64804 transitions. [2021-06-05 09:15:58,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:15:58,618 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:58,619 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:58,619 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2021-06-05 09:15:58,619 INFO L430 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:58,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:58,619 INFO L82 PathProgramCache]: Analyzing trace with hash -349414939, now seen corresponding path program 12 times [2021-06-05 09:15:58,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:58,619 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849701269] [2021-06-05 09:15:58,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:58,720 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:58,720 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:58,720 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849701269] [2021-06-05 09:15:58,720 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849701269] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:58,720 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:58,721 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:15:58,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116357783] [2021-06-05 09:15:58,721 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:15:58,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:58,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:15:58,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:15:58,722 INFO L87 Difference]: Start difference. First operand 21093 states and 64804 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:59,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:15:59,281 INFO L93 Difference]: Finished difference Result 22413 states and 68826 transitions. [2021-06-05 09:15:59,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 09:15:59,281 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:15:59,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:15:59,316 INFO L225 Difference]: With dead ends: 22413 [2021-06-05 09:15:59,317 INFO L226 Difference]: Without dead ends: 22413 [2021-06-05 09:15:59,317 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 111.8ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:15:59,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22413 states. [2021-06-05 09:15:59,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22413 to 21093. [2021-06-05 09:15:59,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21093 states, 21093 states have (on average 3.072298866922676) internal successors, (64804), 21092 states have internal predecessors, (64804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:59,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21093 states to 21093 states and 64804 transitions. [2021-06-05 09:15:59,699 INFO L78 Accepts]: Start accepts. Automaton has 21093 states and 64804 transitions. Word has length 63 [2021-06-05 09:15:59,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:15:59,699 INFO L482 AbstractCegarLoop]: Abstraction has 21093 states and 64804 transitions. [2021-06-05 09:15:59,699 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:15:59,700 INFO L276 IsEmpty]: Start isEmpty. Operand 21093 states and 64804 transitions. [2021-06-05 09:15:59,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:15:59,716 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:15:59,716 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:15:59,716 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2021-06-05 09:15:59,716 INFO L430 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:15:59,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:15:59,716 INFO L82 PathProgramCache]: Analyzing trace with hash 482701405, now seen corresponding path program 13 times [2021-06-05 09:15:59,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:15:59,716 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170550435] [2021-06-05 09:15:59,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:15:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:15:59,799 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:15:59,799 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:15:59,799 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170550435] [2021-06-05 09:15:59,799 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170550435] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:15:59,799 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:15:59,799 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:15:59,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879125615] [2021-06-05 09:15:59,800 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:15:59,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:15:59,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:15:59,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:15:59,801 INFO L87 Difference]: Start difference. First operand 21093 states and 64804 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:00,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:00,229 INFO L93 Difference]: Finished difference Result 22483 states and 69043 transitions. [2021-06-05 09:16:00,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:16:00,230 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:16:00,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:00,262 INFO L225 Difference]: With dead ends: 22483 [2021-06-05 09:16:00,262 INFO L226 Difference]: Without dead ends: 22483 [2021-06-05 09:16:00,262 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 92.6ms TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:16:00,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22483 states. [2021-06-05 09:16:00,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22483 to 21053. [2021-06-05 09:16:00,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21053 states, 21053 states have (on average 3.0722462356908755) internal successors, (64680), 21052 states have internal predecessors, (64680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:00,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21053 states to 21053 states and 64680 transitions. [2021-06-05 09:16:00,870 INFO L78 Accepts]: Start accepts. Automaton has 21053 states and 64680 transitions. Word has length 63 [2021-06-05 09:16:00,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:00,870 INFO L482 AbstractCegarLoop]: Abstraction has 21053 states and 64680 transitions. [2021-06-05 09:16:00,870 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:00,870 INFO L276 IsEmpty]: Start isEmpty. Operand 21053 states and 64680 transitions. [2021-06-05 09:16:00,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:16:00,886 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:00,886 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:00,887 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2021-06-05 09:16:00,887 INFO L430 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:00,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:00,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1189882530, now seen corresponding path program 13 times [2021-06-05 09:16:00,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:00,887 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055555159] [2021-06-05 09:16:00,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:00,989 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:16:00,990 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:00,990 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055555159] [2021-06-05 09:16:00,990 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055555159] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:00,990 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:00,990 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:16:00,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975907771] [2021-06-05 09:16:00,990 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:16:00,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:00,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:16:00,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:16:00,991 INFO L87 Difference]: Start difference. First operand 21053 states and 64680 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:01,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:01,339 INFO L93 Difference]: Finished difference Result 21753 states and 66850 transitions. [2021-06-05 09:16:01,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 09:16:01,340 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:16:01,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:01,380 INFO L225 Difference]: With dead ends: 21753 [2021-06-05 09:16:01,380 INFO L226 Difference]: Without dead ends: 21753 [2021-06-05 09:16:01,381 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 99.4ms TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-06-05 09:16:01,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21753 states. [2021-06-05 09:16:01,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21753 to 21063. [2021-06-05 09:16:01,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21063 states, 21063 states have (on average 3.072259412239472) internal successors, (64711), 21062 states have internal predecessors, (64711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:01,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21063 states to 21063 states and 64711 transitions. [2021-06-05 09:16:01,893 INFO L78 Accepts]: Start accepts. Automaton has 21063 states and 64711 transitions. Word has length 63 [2021-06-05 09:16:01,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:01,893 INFO L482 AbstractCegarLoop]: Abstraction has 21063 states and 64711 transitions. [2021-06-05 09:16:01,893 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:01,893 INFO L276 IsEmpty]: Start isEmpty. Operand 21063 states and 64711 transitions. [2021-06-05 09:16:01,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:16:01,909 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:01,909 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:01,909 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2021-06-05 09:16:01,909 INFO L430 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:01,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:01,910 INFO L82 PathProgramCache]: Analyzing trace with hash -293306747, now seen corresponding path program 5 times [2021-06-05 09:16:01,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:01,910 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359248531] [2021-06-05 09:16:01,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:01,990 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:16:01,990 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:01,990 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359248531] [2021-06-05 09:16:01,991 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359248531] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:01,991 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:01,991 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:16:01,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259032469] [2021-06-05 09:16:01,991 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:16:01,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:01,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:16:01,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:16:01,991 INFO L87 Difference]: Start difference. First operand 21063 states and 64711 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:02,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:02,317 INFO L93 Difference]: Finished difference Result 21633 states and 66478 transitions. [2021-06-05 09:16:02,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 09:16:02,318 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:16:02,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:02,348 INFO L225 Difference]: With dead ends: 21633 [2021-06-05 09:16:02,348 INFO L226 Difference]: Without dead ends: 21633 [2021-06-05 09:16:02,348 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 77.9ms TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-06-05 09:16:02,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21633 states. [2021-06-05 09:16:02,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21633 to 21048. [2021-06-05 09:16:02,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21048 states, 21048 states have (on average 3.0722633979475487) internal successors, (64665), 21047 states have internal predecessors, (64665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:02,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21048 states to 21048 states and 64665 transitions. [2021-06-05 09:16:02,707 INFO L78 Accepts]: Start accepts. Automaton has 21048 states and 64665 transitions. Word has length 63 [2021-06-05 09:16:02,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:02,707 INFO L482 AbstractCegarLoop]: Abstraction has 21048 states and 64665 transitions. [2021-06-05 09:16:02,707 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:02,707 INFO L276 IsEmpty]: Start isEmpty. Operand 21048 states and 64665 transitions. [2021-06-05 09:16:02,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:16:02,722 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:02,722 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:02,722 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2021-06-05 09:16:02,722 INFO L430 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:02,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:02,722 INFO L82 PathProgramCache]: Analyzing trace with hash 2114346573, now seen corresponding path program 14 times [2021-06-05 09:16:02,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:02,722 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854245135] [2021-06-05 09:16:02,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:02,816 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:16:02,816 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:02,816 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854245135] [2021-06-05 09:16:02,816 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854245135] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:02,816 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:02,816 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:16:02,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606468760] [2021-06-05 09:16:02,817 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:16:02,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:02,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:16:02,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:16:02,817 INFO L87 Difference]: Start difference. First operand 21048 states and 64665 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:03,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:03,397 INFO L93 Difference]: Finished difference Result 22038 states and 67624 transitions. [2021-06-05 09:16:03,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 09:16:03,398 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:16:03,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:03,431 INFO L225 Difference]: With dead ends: 22038 [2021-06-05 09:16:03,431 INFO L226 Difference]: Without dead ends: 22038 [2021-06-05 09:16:03,431 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 117.5ms TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:16:03,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22038 states. [2021-06-05 09:16:03,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22038 to 20928. [2021-06-05 09:16:03,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20928 states, 20928 states have (on average 3.0721043577981653) internal successors, (64293), 20927 states have internal predecessors, (64293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:03,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20928 states to 20928 states and 64293 transitions. [2021-06-05 09:16:03,810 INFO L78 Accepts]: Start accepts. Automaton has 20928 states and 64293 transitions. Word has length 63 [2021-06-05 09:16:03,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:03,810 INFO L482 AbstractCegarLoop]: Abstraction has 20928 states and 64293 transitions. [2021-06-05 09:16:03,810 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:03,810 INFO L276 IsEmpty]: Start isEmpty. Operand 20928 states and 64293 transitions. [2021-06-05 09:16:03,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:16:03,826 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:03,826 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:03,826 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2021-06-05 09:16:03,827 INFO L430 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:03,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:03,827 INFO L82 PathProgramCache]: Analyzing trace with hash -371728057, now seen corresponding path program 6 times [2021-06-05 09:16:03,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:03,827 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409375883] [2021-06-05 09:16:03,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:03,923 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:16:03,923 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:03,923 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409375883] [2021-06-05 09:16:03,924 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409375883] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:03,924 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:03,924 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:16:03,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600231706] [2021-06-05 09:16:03,924 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:16:03,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:03,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:16:03,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:16:03,924 INFO L87 Difference]: Start difference. First operand 20928 states and 64293 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:04,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:04,259 INFO L93 Difference]: Finished difference Result 21568 states and 66207 transitions. [2021-06-05 09:16:04,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:16:04,259 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:16:04,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:04,292 INFO L225 Difference]: With dead ends: 21568 [2021-06-05 09:16:04,292 INFO L226 Difference]: Without dead ends: 21568 [2021-06-05 09:16:04,292 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 98.8ms TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:16:04,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21568 states. [2021-06-05 09:16:04,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21568 to 20938. [2021-06-05 09:16:04,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20938 states, 20938 states have (on average 3.0721176807718025) internal successors, (64324), 20937 states have internal predecessors, (64324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:04,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20938 states to 20938 states and 64324 transitions. [2021-06-05 09:16:04,737 INFO L78 Accepts]: Start accepts. Automaton has 20938 states and 64324 transitions. Word has length 63 [2021-06-05 09:16:04,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:04,738 INFO L482 AbstractCegarLoop]: Abstraction has 20938 states and 64324 transitions. [2021-06-05 09:16:04,738 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:04,738 INFO L276 IsEmpty]: Start isEmpty. Operand 20938 states and 64324 transitions. [2021-06-05 09:16:04,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:16:04,752 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:04,752 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:04,752 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2021-06-05 09:16:04,752 INFO L430 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:04,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:04,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1348504379, now seen corresponding path program 15 times [2021-06-05 09:16:04,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:04,753 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244111620] [2021-06-05 09:16:04,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:04,840 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:16:04,840 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:04,840 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244111620] [2021-06-05 09:16:04,840 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244111620] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:04,840 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:04,840 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:16:04,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834447094] [2021-06-05 09:16:04,842 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:16:04,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:04,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:16:04,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:16:04,842 INFO L87 Difference]: Start difference. First operand 20938 states and 64324 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:05,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:05,207 INFO L93 Difference]: Finished difference Result 21608 states and 66331 transitions. [2021-06-05 09:16:05,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:16:05,207 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:16:05,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:05,239 INFO L225 Difference]: With dead ends: 21608 [2021-06-05 09:16:05,239 INFO L226 Difference]: Without dead ends: 21608 [2021-06-05 09:16:05,239 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 101.1ms TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:16:05,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21608 states. [2021-06-05 09:16:05,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21608 to 20898. [2021-06-05 09:16:05,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20898 states, 20898 states have (on average 3.07206431237439) internal successors, (64200), 20897 states have internal predecessors, (64200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:05,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20898 states to 20898 states and 64200 transitions. [2021-06-05 09:16:05,743 INFO L78 Accepts]: Start accepts. Automaton has 20898 states and 64200 transitions. Word has length 63 [2021-06-05 09:16:05,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:05,743 INFO L482 AbstractCegarLoop]: Abstraction has 20898 states and 64200 transitions. [2021-06-05 09:16:05,743 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:05,743 INFO L276 IsEmpty]: Start isEmpty. Operand 20898 states and 64200 transitions. [2021-06-05 09:16:05,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:16:05,756 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:05,756 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:05,757 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2021-06-05 09:16:05,757 INFO L430 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:05,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:05,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1677174645, now seen corresponding path program 7 times [2021-06-05 09:16:05,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:05,757 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277672948] [2021-06-05 09:16:05,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:05,840 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:16:05,841 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:05,841 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277672948] [2021-06-05 09:16:05,841 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277672948] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:05,841 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:05,841 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:16:05,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940514741] [2021-06-05 09:16:05,841 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:16:05,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:05,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:16:05,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:16:05,841 INFO L87 Difference]: Start difference. First operand 20898 states and 64200 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:06,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:06,256 INFO L93 Difference]: Finished difference Result 22658 states and 69546 transitions. [2021-06-05 09:16:06,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 09:16:06,256 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:16:06,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:06,290 INFO L225 Difference]: With dead ends: 22658 [2021-06-05 09:16:06,290 INFO L226 Difference]: Without dead ends: 22658 [2021-06-05 09:16:06,290 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 107.5ms TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:16:06,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22658 states. [2021-06-05 09:16:06,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22658 to 21048. [2021-06-05 09:16:06,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21048 states, 21048 states have (on average 3.0722633979475487) internal successors, (64665), 21047 states have internal predecessors, (64665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:06,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21048 states to 21048 states and 64665 transitions. [2021-06-05 09:16:06,674 INFO L78 Accepts]: Start accepts. Automaton has 21048 states and 64665 transitions. Word has length 63 [2021-06-05 09:16:06,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:06,675 INFO L482 AbstractCegarLoop]: Abstraction has 21048 states and 64665 transitions. [2021-06-05 09:16:06,675 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:06,675 INFO L276 IsEmpty]: Start isEmpty. Operand 21048 states and 64665 transitions. [2021-06-05 09:16:06,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:16:06,691 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:06,691 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:06,691 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2021-06-05 09:16:06,691 INFO L430 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:06,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:06,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1757916017, now seen corresponding path program 8 times [2021-06-05 09:16:06,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:06,692 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510877432] [2021-06-05 09:16:06,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:06,787 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:16:06,787 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:06,787 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510877432] [2021-06-05 09:16:06,787 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510877432] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:06,787 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:06,787 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:16:06,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715355037] [2021-06-05 09:16:06,788 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:16:06,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:06,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:16:06,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:16:06,788 INFO L87 Difference]: Start difference. First operand 21048 states and 64665 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:07,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:07,326 INFO L93 Difference]: Finished difference Result 21818 states and 66982 transitions. [2021-06-05 09:16:07,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:16:07,327 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:16:07,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:07,358 INFO L225 Difference]: With dead ends: 21818 [2021-06-05 09:16:07,358 INFO L226 Difference]: Without dead ends: 21818 [2021-06-05 09:16:07,358 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 102.7ms TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:16:07,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21818 states. [2021-06-05 09:16:07,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21818 to 21058. [2021-06-05 09:16:07,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21058 states, 21058 states have (on average 3.072276569474784) internal successors, (64696), 21057 states have internal predecessors, (64696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:07,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21058 states to 21058 states and 64696 transitions. [2021-06-05 09:16:07,738 INFO L78 Accepts]: Start accepts. Automaton has 21058 states and 64696 transitions. Word has length 63 [2021-06-05 09:16:07,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:07,738 INFO L482 AbstractCegarLoop]: Abstraction has 21058 states and 64696 transitions. [2021-06-05 09:16:07,738 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:07,738 INFO L276 IsEmpty]: Start isEmpty. Operand 21058 states and 64696 transitions. [2021-06-05 09:16:07,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:16:07,755 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:07,755 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:07,755 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2021-06-05 09:16:07,755 INFO L430 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:07,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:07,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1560274957, now seen corresponding path program 16 times [2021-06-05 09:16:07,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:07,756 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974286995] [2021-06-05 09:16:07,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:07,843 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:16:07,844 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:07,844 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974286995] [2021-06-05 09:16:07,844 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974286995] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:07,844 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:07,844 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:16:07,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761628215] [2021-06-05 09:16:07,844 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:16:07,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:07,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:16:07,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:16:07,845 INFO L87 Difference]: Start difference. First operand 21058 states and 64696 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:08,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:08,260 INFO L93 Difference]: Finished difference Result 21858 states and 67106 transitions. [2021-06-05 09:16:08,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:16:08,260 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:16:08,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:08,293 INFO L225 Difference]: With dead ends: 21858 [2021-06-05 09:16:08,293 INFO L226 Difference]: Without dead ends: 21858 [2021-06-05 09:16:08,293 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 97.1ms TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:16:08,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21858 states. [2021-06-05 09:16:08,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21858 to 21048. [2021-06-05 09:16:08,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21048 states, 21048 states have (on average 3.0722633979475487) internal successors, (64665), 21047 states have internal predecessors, (64665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:08,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21048 states to 21048 states and 64665 transitions. [2021-06-05 09:16:08,840 INFO L78 Accepts]: Start accepts. Automaton has 21048 states and 64665 transitions. Word has length 63 [2021-06-05 09:16:08,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:08,840 INFO L482 AbstractCegarLoop]: Abstraction has 21048 states and 64665 transitions. [2021-06-05 09:16:08,840 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:08,840 INFO L276 IsEmpty]: Start isEmpty. Operand 21048 states and 64665 transitions. [2021-06-05 09:16:08,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:16:08,856 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:08,856 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:08,856 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2021-06-05 09:16:08,856 INFO L430 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:08,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:08,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1290946202, now seen corresponding path program 14 times [2021-06-05 09:16:08,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:08,857 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306143504] [2021-06-05 09:16:08,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:08,962 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:16:08,962 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:08,962 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306143504] [2021-06-05 09:16:08,962 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306143504] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:08,962 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:08,962 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 09:16:08,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509238285] [2021-06-05 09:16:08,963 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 09:16:08,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:08,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 09:16:08,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:16:08,963 INFO L87 Difference]: Start difference. First operand 21048 states and 64665 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:09,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:09,493 INFO L93 Difference]: Finished difference Result 21834 states and 67080 transitions. [2021-06-05 09:16:09,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 09:16:09,493 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:16:09,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:09,525 INFO L225 Difference]: With dead ends: 21834 [2021-06-05 09:16:09,526 INFO L226 Difference]: Without dead ends: 21834 [2021-06-05 09:16:09,526 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 116.3ms TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:16:09,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21834 states. [2021-06-05 09:16:09,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21834 to 21091. [2021-06-05 09:16:09,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21091 states, 21091 states have (on average 3.0723057228201602) internal successors, (64798), 21090 states have internal predecessors, (64798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21091 states to 21091 states and 64798 transitions. [2021-06-05 09:16:10,027 INFO L78 Accepts]: Start accepts. Automaton has 21091 states and 64798 transitions. Word has length 63 [2021-06-05 09:16:10,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:10,027 INFO L482 AbstractCegarLoop]: Abstraction has 21091 states and 64798 transitions. [2021-06-05 09:16:10,027 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:10,027 INFO L276 IsEmpty]: Start isEmpty. Operand 21091 states and 64798 transitions. [2021-06-05 09:16:10,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:16:10,043 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:10,043 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:10,043 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2021-06-05 09:16:10,043 INFO L430 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:10,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:10,043 INFO L82 PathProgramCache]: Analyzing trace with hash -2107445311, now seen corresponding path program 9 times [2021-06-05 09:16:10,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:10,044 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231068024] [2021-06-05 09:16:10,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:10,159 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:16:10,159 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:10,159 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231068024] [2021-06-05 09:16:10,159 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231068024] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:10,159 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:10,160 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:16:10,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773197028] [2021-06-05 09:16:10,160 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:16:10,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:10,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:16:10,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:16:10,160 INFO L87 Difference]: Start difference. First operand 21091 states and 64798 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:10,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:10,602 INFO L93 Difference]: Finished difference Result 22121 states and 67941 transitions. [2021-06-05 09:16:10,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:16:10,602 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:16:10,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:10,633 INFO L225 Difference]: With dead ends: 22121 [2021-06-05 09:16:10,634 INFO L226 Difference]: Without dead ends: 22121 [2021-06-05 09:16:10,634 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 120.5ms TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:16:10,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22121 states. [2021-06-05 09:16:10,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22121 to 21111. [2021-06-05 09:16:10,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21111 states, 21111 states have (on average 3.0723319596418928) internal successors, (64860), 21110 states have internal predecessors, (64860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:11,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21111 states to 21111 states and 64860 transitions. [2021-06-05 09:16:11,005 INFO L78 Accepts]: Start accepts. Automaton has 21111 states and 64860 transitions. Word has length 63 [2021-06-05 09:16:11,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:11,005 INFO L482 AbstractCegarLoop]: Abstraction has 21111 states and 64860 transitions. [2021-06-05 09:16:11,005 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:11,005 INFO L276 IsEmpty]: Start isEmpty. Operand 21111 states and 64860 transitions. [2021-06-05 09:16:11,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:16:11,021 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:11,021 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:11,021 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2021-06-05 09:16:11,021 INFO L430 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:11,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:11,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1031193819, now seen corresponding path program 10 times [2021-06-05 09:16:11,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:11,021 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824426036] [2021-06-05 09:16:11,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:11,119 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:16:11,120 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:11,120 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824426036] [2021-06-05 09:16:11,120 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824426036] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:11,120 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:11,120 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:16:11,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272255714] [2021-06-05 09:16:11,120 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:16:11,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:11,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:16:11,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:16:11,120 INFO L87 Difference]: Start difference. First operand 21111 states and 64860 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:11,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:11,654 INFO L93 Difference]: Finished difference Result 22101 states and 67879 transitions. [2021-06-05 09:16:11,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:16:11,655 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:16:11,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:11,686 INFO L225 Difference]: With dead ends: 22101 [2021-06-05 09:16:11,686 INFO L226 Difference]: Without dead ends: 22101 [2021-06-05 09:16:11,686 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 133.5ms TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:16:11,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22101 states. [2021-06-05 09:16:11,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22101 to 21231. [2021-06-05 09:16:12,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21231 states, 21231 states have (on average 3.072488342518016) internal successors, (65232), 21230 states have internal predecessors, (65232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:12,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21231 states to 21231 states and 65232 transitions. [2021-06-05 09:16:12,053 INFO L78 Accepts]: Start accepts. Automaton has 21231 states and 65232 transitions. Word has length 63 [2021-06-05 09:16:12,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:12,053 INFO L482 AbstractCegarLoop]: Abstraction has 21231 states and 65232 transitions. [2021-06-05 09:16:12,054 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:12,054 INFO L276 IsEmpty]: Start isEmpty. Operand 21231 states and 65232 transitions. [2021-06-05 09:16:12,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:16:12,070 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:12,070 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:12,070 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2021-06-05 09:16:12,070 INFO L430 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:12,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:12,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1911322439, now seen corresponding path program 11 times [2021-06-05 09:16:12,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:12,070 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150165740] [2021-06-05 09:16:12,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:12,162 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:16:12,162 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:12,162 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150165740] [2021-06-05 09:16:12,162 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150165740] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:12,162 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:12,162 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:16:12,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222473493] [2021-06-05 09:16:12,163 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:16:12,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:12,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:16:12,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:16:12,163 INFO L87 Difference]: Start difference. First operand 21231 states and 65232 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:12,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:12,510 INFO L93 Difference]: Finished difference Result 22587 states and 69404 transitions. [2021-06-05 09:16:12,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 09:16:12,510 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:16:12,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:12,542 INFO L225 Difference]: With dead ends: 22587 [2021-06-05 09:16:12,542 INFO L226 Difference]: Without dead ends: 22587 [2021-06-05 09:16:12,543 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 79.5ms TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-06-05 09:16:12,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22587 states. [2021-06-05 09:16:12,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22587 to 21241. [2021-06-05 09:16:12,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21241 states, 21241 states have (on average 3.072501294665976) internal successors, (65263), 21240 states have internal predecessors, (65263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:13,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21241 states to 21241 states and 65263 transitions. [2021-06-05 09:16:13,019 INFO L78 Accepts]: Start accepts. Automaton has 21241 states and 65263 transitions. Word has length 63 [2021-06-05 09:16:13,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:13,019 INFO L482 AbstractCegarLoop]: Abstraction has 21241 states and 65263 transitions. [2021-06-05 09:16:13,019 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:13,019 INFO L276 IsEmpty]: Start isEmpty. Operand 21241 states and 65263 transitions. [2021-06-05 09:16:13,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:16:13,035 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:13,035 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:13,035 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2021-06-05 09:16:13,035 INFO L430 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:13,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:13,036 INFO L82 PathProgramCache]: Analyzing trace with hash 934546117, now seen corresponding path program 17 times [2021-06-05 09:16:13,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:13,036 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789584191] [2021-06-05 09:16:13,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:13,113 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:16:13,114 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:13,114 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789584191] [2021-06-05 09:16:13,114 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789584191] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:13,114 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:13,114 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:16:13,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18002380] [2021-06-05 09:16:13,114 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:16:13,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:13,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:16:13,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:16:13,114 INFO L87 Difference]: Start difference. First operand 21241 states and 65263 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:13,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:13,469 INFO L93 Difference]: Finished difference Result 22707 states and 69776 transitions. [2021-06-05 09:16:13,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 09:16:13,469 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:16:13,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:13,502 INFO L225 Difference]: With dead ends: 22707 [2021-06-05 09:16:13,502 INFO L226 Difference]: Without dead ends: 22707 [2021-06-05 09:16:13,502 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 77.9ms TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-06-05 09:16:13,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22707 states. [2021-06-05 09:16:13,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22707 to 21230. [2021-06-05 09:16:13,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21230 states, 21230 states have (on average 3.0724917569477155) internal successors, (65229), 21229 states have internal predecessors, (65229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:14,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21230 states to 21230 states and 65229 transitions. [2021-06-05 09:16:14,047 INFO L78 Accepts]: Start accepts. Automaton has 21230 states and 65229 transitions. Word has length 63 [2021-06-05 09:16:14,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:14,047 INFO L482 AbstractCegarLoop]: Abstraction has 21230 states and 65229 transitions. [2021-06-05 09:16:14,047 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:14,047 INFO L276 IsEmpty]: Start isEmpty. Operand 21230 states and 65229 transitions. [2021-06-05 09:16:14,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:16:14,063 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:14,063 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:14,063 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2021-06-05 09:16:14,063 INFO L430 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:14,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:14,064 INFO L82 PathProgramCache]: Analyzing trace with hash 131877339, now seen corresponding path program 12 times [2021-06-05 09:16:14,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:14,064 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236711622] [2021-06-05 09:16:14,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:14,165 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:16:14,165 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:14,165 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236711622] [2021-06-05 09:16:14,165 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236711622] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:14,165 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:14,165 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:16:14,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943653087] [2021-06-05 09:16:14,166 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:16:14,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:14,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:16:14,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:16:14,166 INFO L87 Difference]: Start difference. First operand 21230 states and 65229 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:14,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:14,638 INFO L93 Difference]: Finished difference Result 22710 states and 69747 transitions. [2021-06-05 09:16:14,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 09:16:14,639 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:16:14,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:14,673 INFO L225 Difference]: With dead ends: 22710 [2021-06-05 09:16:14,673 INFO L226 Difference]: Without dead ends: 22710 [2021-06-05 09:16:14,673 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 110.4ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:16:14,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22710 states. [2021-06-05 09:16:14,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22710 to 21110. [2021-06-05 09:16:15,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21110 states, 21110 states have (on average 3.072335386072951) internal successors, (64857), 21109 states have internal predecessors, (64857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:15,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21110 states to 21110 states and 64857 transitions. [2021-06-05 09:16:15,069 INFO L78 Accepts]: Start accepts. Automaton has 21110 states and 64857 transitions. Word has length 63 [2021-06-05 09:16:15,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:15,069 INFO L482 AbstractCegarLoop]: Abstraction has 21110 states and 64857 transitions. [2021-06-05 09:16:15,069 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:15,069 INFO L276 IsEmpty]: Start isEmpty. Operand 21110 states and 64857 transitions. [2021-06-05 09:16:15,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:16:15,086 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:15,086 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:15,086 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2021-06-05 09:16:15,086 INFO L430 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:15,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:15,086 INFO L82 PathProgramCache]: Analyzing trace with hash 51135967, now seen corresponding path program 13 times [2021-06-05 09:16:15,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:15,086 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939448620] [2021-06-05 09:16:15,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:15,171 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:16:15,172 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:15,172 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939448620] [2021-06-05 09:16:15,172 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939448620] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:15,172 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:15,172 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:16:15,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077574009] [2021-06-05 09:16:15,172 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:16:15,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:15,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:16:15,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:16:15,172 INFO L87 Difference]: Start difference. First operand 21110 states and 64857 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:15,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:15,737 INFO L93 Difference]: Finished difference Result 22670 states and 69613 transitions. [2021-06-05 09:16:15,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:16:15,738 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:16:15,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:15,771 INFO L225 Difference]: With dead ends: 22670 [2021-06-05 09:16:15,771 INFO L226 Difference]: Without dead ends: 22670 [2021-06-05 09:16:15,771 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 94.7ms TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:16:15,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22670 states. [2021-06-05 09:16:16,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22670 to 21030. [2021-06-05 09:16:16,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21030 states, 21030 states have (on average 3.072230147408464) internal successors, (64609), 21029 states have internal predecessors, (64609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:16,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21030 states to 21030 states and 64609 transitions. [2021-06-05 09:16:16,158 INFO L78 Accepts]: Start accepts. Automaton has 21030 states and 64609 transitions. Word has length 63 [2021-06-05 09:16:16,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:16,158 INFO L482 AbstractCegarLoop]: Abstraction has 21030 states and 64609 transitions. [2021-06-05 09:16:16,158 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:16,158 INFO L276 IsEmpty]: Start isEmpty. Operand 21030 states and 64609 transitions. [2021-06-05 09:16:16,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:16:16,174 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:16,174 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:16,175 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2021-06-05 09:16:16,175 INFO L430 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:16,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:16,175 INFO L82 PathProgramCache]: Analyzing trace with hash -925640355, now seen corresponding path program 18 times [2021-06-05 09:16:16,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:16,175 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160285149] [2021-06-05 09:16:16,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:16,264 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:16:16,264 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:16,264 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160285149] [2021-06-05 09:16:16,264 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160285149] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:16,265 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:16,265 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:16:16,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912726746] [2021-06-05 09:16:16,265 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:16:16,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:16,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:16:16,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:16:16,265 INFO L87 Difference]: Start difference. First operand 21030 states and 64609 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:16,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:16,745 INFO L93 Difference]: Finished difference Result 21702 states and 66537 transitions. [2021-06-05 09:16:16,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:16:16,745 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:16:16,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:16,778 INFO L225 Difference]: With dead ends: 21702 [2021-06-05 09:16:16,778 INFO L226 Difference]: Without dead ends: 21702 [2021-06-05 09:16:16,778 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 112.7ms TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:16:16,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21702 states. [2021-06-05 09:16:17,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21702 to 20462. [2021-06-05 09:16:17,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20462 states, 20462 states have (on average 3.0697390284429673) internal successors, (62813), 20461 states have internal predecessors, (62813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:17,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20462 states to 20462 states and 62813 transitions. [2021-06-05 09:16:17,261 INFO L78 Accepts]: Start accepts. Automaton has 20462 states and 62813 transitions. Word has length 63 [2021-06-05 09:16:17,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:17,262 INFO L482 AbstractCegarLoop]: Abstraction has 20462 states and 62813 transitions. [2021-06-05 09:16:17,262 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:17,262 INFO L276 IsEmpty]: Start isEmpty. Operand 20462 states and 62813 transitions. [2021-06-05 09:16:17,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:16:17,276 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:17,276 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:17,276 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2021-06-05 09:16:17,276 INFO L430 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:17,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:17,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1997458146, now seen corresponding path program 15 times [2021-06-05 09:16:17,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:17,276 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294408510] [2021-06-05 09:16:17,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:16:17,372 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:17,372 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294408510] [2021-06-05 09:16:17,372 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294408510] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:17,372 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:17,372 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:16:17,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280315186] [2021-06-05 09:16:17,372 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:16:17,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:17,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:16:17,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:16:17,373 INFO L87 Difference]: Start difference. First operand 20462 states and 62813 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:17,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:17,789 INFO L93 Difference]: Finished difference Result 21102 states and 64727 transitions. [2021-06-05 09:16:17,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:16:17,790 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:16:17,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:17,821 INFO L225 Difference]: With dead ends: 21102 [2021-06-05 09:16:17,821 INFO L226 Difference]: Without dead ends: 21102 [2021-06-05 09:16:17,821 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 101.0ms TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:16:17,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21102 states. [2021-06-05 09:16:18,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21102 to 20472. [2021-06-05 09:16:18,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20472 states, 20472 states have (on average 3.069753810082063) internal successors, (62844), 20471 states have internal predecessors, (62844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:18,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20472 states to 20472 states and 62844 transitions. [2021-06-05 09:16:18,202 INFO L78 Accepts]: Start accepts. Automaton has 20472 states and 62844 transitions. Word has length 63 [2021-06-05 09:16:18,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:18,202 INFO L482 AbstractCegarLoop]: Abstraction has 20472 states and 62844 transitions. [2021-06-05 09:16:18,203 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:18,203 INFO L276 IsEmpty]: Start isEmpty. Operand 20472 states and 62844 transitions. [2021-06-05 09:16:18,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:16:18,218 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:18,218 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:18,218 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2021-06-05 09:16:18,218 INFO L430 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:18,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:18,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1100882363, now seen corresponding path program 14 times [2021-06-05 09:16:18,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:18,218 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578903430] [2021-06-05 09:16:18,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:18,304 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:16:18,304 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:18,304 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578903430] [2021-06-05 09:16:18,304 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578903430] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:18,304 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:18,304 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:16:18,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997975521] [2021-06-05 09:16:18,305 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:16:18,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:18,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:16:18,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:16:18,305 INFO L87 Difference]: Start difference. First operand 20472 states and 62844 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:18,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:18,712 INFO L93 Difference]: Finished difference Result 20982 states and 64415 transitions. [2021-06-05 09:16:18,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:16:18,712 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:16:18,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:18,744 INFO L225 Difference]: With dead ends: 20982 [2021-06-05 09:16:18,744 INFO L226 Difference]: Without dead ends: 20982 [2021-06-05 09:16:18,744 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 94.1ms TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:16:18,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20982 states. [2021-06-05 09:16:19,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20982 to 20462. [2021-06-05 09:16:19,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20462 states, 20462 states have (on average 3.0697390284429673) internal successors, (62813), 20461 states have internal predecessors, (62813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:19,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20462 states to 20462 states and 62813 transitions. [2021-06-05 09:16:19,123 INFO L78 Accepts]: Start accepts. Automaton has 20462 states and 62813 transitions. Word has length 63 [2021-06-05 09:16:19,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:19,123 INFO L482 AbstractCegarLoop]: Abstraction has 20462 states and 62813 transitions. [2021-06-05 09:16:19,123 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:19,123 INFO L276 IsEmpty]: Start isEmpty. Operand 20462 states and 62813 transitions. [2021-06-05 09:16:19,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:16:19,137 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:19,137 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:19,137 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2021-06-05 09:16:19,137 INFO L430 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:19,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:19,138 INFO L82 PathProgramCache]: Analyzing trace with hash -24630871, now seen corresponding path program 15 times [2021-06-05 09:16:19,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:19,138 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246238319] [2021-06-05 09:16:19,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:19,235 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:16:19,235 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:19,236 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246238319] [2021-06-05 09:16:19,236 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246238319] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:19,236 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:19,236 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:16:19,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000823302] [2021-06-05 09:16:19,236 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:16:19,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:19,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:16:19,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:16:19,237 INFO L87 Difference]: Start difference. First operand 20462 states and 62813 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:19,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:19,820 INFO L93 Difference]: Finished difference Result 21212 states and 65088 transitions. [2021-06-05 09:16:19,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 09:16:19,821 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:16:19,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:19,859 INFO L225 Difference]: With dead ends: 21212 [2021-06-05 09:16:19,859 INFO L226 Difference]: Without dead ends: 21212 [2021-06-05 09:16:19,860 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 128.7ms TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:16:19,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21212 states. [2021-06-05 09:16:20,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21212 to 20312. [2021-06-05 09:16:20,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20312 states, 20312 states have (on average 3.069515557306026) internal successors, (62348), 20311 states have internal predecessors, (62348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:20,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20312 states to 20312 states and 62348 transitions. [2021-06-05 09:16:20,302 INFO L78 Accepts]: Start accepts. Automaton has 20312 states and 62348 transitions. Word has length 63 [2021-06-05 09:16:20,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:20,302 INFO L482 AbstractCegarLoop]: Abstraction has 20312 states and 62348 transitions. [2021-06-05 09:16:20,302 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:20,302 INFO L276 IsEmpty]: Start isEmpty. Operand 20312 states and 62348 transitions. [2021-06-05 09:16:20,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:16:20,315 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:20,315 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:20,316 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2021-06-05 09:16:20,316 INFO L430 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:20,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:20,316 INFO L82 PathProgramCache]: Analyzing trace with hash 995719964, now seen corresponding path program 16 times [2021-06-05 09:16:20,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:20,316 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433429375] [2021-06-05 09:16:20,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:16:20,406 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:20,406 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433429375] [2021-06-05 09:16:20,406 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433429375] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:20,406 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:20,406 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:16:20,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059743367] [2021-06-05 09:16:20,406 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:16:20,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:20,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:16:20,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:16:20,407 INFO L87 Difference]: Start difference. First operand 20312 states and 62348 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:20,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:20,781 INFO L93 Difference]: Finished difference Result 20992 states and 64386 transitions. [2021-06-05 09:16:20,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:16:20,781 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:16:20,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:20,810 INFO L225 Difference]: With dead ends: 20992 [2021-06-05 09:16:20,811 INFO L226 Difference]: Without dead ends: 20992 [2021-06-05 09:16:20,811 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 100.6ms TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:16:20,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20992 states. [2021-06-05 09:16:21,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20992 to 20312. [2021-06-05 09:16:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20312 states, 20312 states have (on average 3.069515557306026) internal successors, (62348), 20311 states have internal predecessors, (62348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:21,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20312 states to 20312 states and 62348 transitions. [2021-06-05 09:16:21,172 INFO L78 Accepts]: Start accepts. Automaton has 20312 states and 62348 transitions. Word has length 63 [2021-06-05 09:16:21,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:21,172 INFO L482 AbstractCegarLoop]: Abstraction has 20312 states and 62348 transitions. [2021-06-05 09:16:21,172 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:21,172 INFO L276 IsEmpty]: Start isEmpty. Operand 20312 states and 62348 transitions. [2021-06-05 09:16:21,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:16:21,185 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:21,185 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:21,186 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2021-06-05 09:16:21,186 INFO L430 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:21,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:21,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1892295747, now seen corresponding path program 16 times [2021-06-05 09:16:21,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:21,186 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526967456] [2021-06-05 09:16:21,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:21,280 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:16:21,280 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:21,281 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526967456] [2021-06-05 09:16:21,281 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526967456] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:21,281 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:21,281 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:16:21,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719525731] [2021-06-05 09:16:21,281 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:16:21,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:21,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:16:21,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:16:21,282 INFO L87 Difference]: Start difference. First operand 20312 states and 62348 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:21,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:21,882 INFO L93 Difference]: Finished difference Result 20304 states and 62278 transitions. [2021-06-05 09:16:21,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:16:21,882 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:16:21,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:21,911 INFO L225 Difference]: With dead ends: 20304 [2021-06-05 09:16:21,911 INFO L226 Difference]: Without dead ends: 20304 [2021-06-05 09:16:21,911 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 110.6ms TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:16:22,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20304 states. [2021-06-05 09:16:22,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20304 to 19774. [2021-06-05 09:16:22,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19774 states, 19774 states have (on average 3.066906038232022) internal successors, (60645), 19773 states have internal predecessors, (60645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:22,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19774 states to 19774 states and 60645 transitions. [2021-06-05 09:16:22,267 INFO L78 Accepts]: Start accepts. Automaton has 19774 states and 60645 transitions. Word has length 63 [2021-06-05 09:16:22,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:22,267 INFO L482 AbstractCegarLoop]: Abstraction has 19774 states and 60645 transitions. [2021-06-05 09:16:22,267 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:22,267 INFO L276 IsEmpty]: Start isEmpty. Operand 19774 states and 60645 transitions. [2021-06-05 09:16:22,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:16:22,280 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:22,280 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:22,280 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2021-06-05 09:16:22,280 INFO L430 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:22,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:22,280 INFO L82 PathProgramCache]: Analyzing trace with hash 9705082, now seen corresponding path program 17 times [2021-06-05 09:16:22,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:22,281 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35120372] [2021-06-05 09:16:22,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:22,362 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:16:22,363 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:22,363 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35120372] [2021-06-05 09:16:22,363 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35120372] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:22,363 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:22,363 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:16:22,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551713890] [2021-06-05 09:16:22,363 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:16:22,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:22,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:16:22,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:16:22,364 INFO L87 Difference]: Start difference. First operand 19774 states and 60645 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:22,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:22,843 INFO L93 Difference]: Finished difference Result 20934 states and 64131 transitions. [2021-06-05 09:16:22,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 09:16:22,844 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:16:22,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:22,874 INFO L225 Difference]: With dead ends: 20934 [2021-06-05 09:16:22,874 INFO L226 Difference]: Without dead ends: 20934 [2021-06-05 09:16:22,874 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 109.2ms TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:16:22,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20934 states. [2021-06-05 09:16:23,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20934 to 19224. [2021-06-05 09:16:23,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19224 states, 19224 states have (on average 3.063358302122347) internal successors, (58890), 19223 states have internal predecessors, (58890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:23,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19224 states to 19224 states and 58890 transitions. [2021-06-05 09:16:23,334 INFO L78 Accepts]: Start accepts. Automaton has 19224 states and 58890 transitions. Word has length 63 [2021-06-05 09:16:23,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:23,334 INFO L482 AbstractCegarLoop]: Abstraction has 19224 states and 58890 transitions. [2021-06-05 09:16:23,334 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:23,335 INFO L276 IsEmpty]: Start isEmpty. Operand 19224 states and 58890 transitions. [2021-06-05 09:16:23,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:16:23,346 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:23,346 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:23,346 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2021-06-05 09:16:23,346 INFO L430 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:23,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:23,347 INFO L82 PathProgramCache]: Analyzing trace with hash -579746208, now seen corresponding path program 18 times [2021-06-05 09:16:23,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:23,347 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051172188] [2021-06-05 09:16:23,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:23,435 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:16:23,435 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:23,435 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051172188] [2021-06-05 09:16:23,436 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051172188] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:23,436 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:23,436 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:16:23,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491270475] [2021-06-05 09:16:23,436 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:16:23,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:23,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:16:23,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:16:23,436 INFO L87 Difference]: Start difference. First operand 19224 states and 58890 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:23,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:23,825 INFO L93 Difference]: Finished difference Result 20174 states and 61825 transitions. [2021-06-05 09:16:23,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:16:23,826 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:16:23,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:23,855 INFO L225 Difference]: With dead ends: 20174 [2021-06-05 09:16:23,855 INFO L226 Difference]: Without dead ends: 20174 [2021-06-05 09:16:23,855 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 95.4ms TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:16:23,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20174 states. [2021-06-05 09:16:24,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20174 to 19191. [2021-06-05 09:16:24,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19191 states, 19191 states have (on average 3.06331092699703) internal successors, (58788), 19190 states have internal predecessors, (58788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:24,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19191 states to 19191 states and 58788 transitions. [2021-06-05 09:16:24,206 INFO L78 Accepts]: Start accepts. Automaton has 19191 states and 58788 transitions. Word has length 63 [2021-06-05 09:16:24,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:24,206 INFO L482 AbstractCegarLoop]: Abstraction has 19191 states and 58788 transitions. [2021-06-05 09:16:24,206 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:24,206 INFO L276 IsEmpty]: Start isEmpty. Operand 19191 states and 58788 transitions. [2021-06-05 09:16:24,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-05 09:16:24,218 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:24,218 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:24,218 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2021-06-05 09:16:24,218 INFO L430 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:24,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:24,218 INFO L82 PathProgramCache]: Analyzing trace with hash 712672800, now seen corresponding path program 19 times [2021-06-05 09:16:24,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:24,218 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286742591] [2021-06-05 09:16:24,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:24,324 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:16:24,324 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:24,324 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286742591] [2021-06-05 09:16:24,324 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286742591] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:24,324 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:16:24,324 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:16:24,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767394729] [2021-06-05 09:16:24,324 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:16:24,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:24,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:16:24,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:16:24,325 INFO L87 Difference]: Start difference. First operand 19191 states and 58788 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:24,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:24,759 INFO L93 Difference]: Finished difference Result 20453 states and 62645 transitions. [2021-06-05 09:16:24,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:16:24,760 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-06-05 09:16:24,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:24,790 INFO L225 Difference]: With dead ends: 20453 [2021-06-05 09:16:24,790 INFO L226 Difference]: Without dead ends: 20453 [2021-06-05 09:16:24,790 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 112.7ms TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:16:24,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20453 states. [2021-06-05 09:16:25,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20453 to 18532. [2021-06-05 09:16:25,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18532 states, 18532 states have (on average 3.0595726311245413) internal successors, (56700), 18531 states have internal predecessors, (56700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:25,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18532 states to 18532 states and 56700 transitions. [2021-06-05 09:16:25,138 INFO L78 Accepts]: Start accepts. Automaton has 18532 states and 56700 transitions. Word has length 63 [2021-06-05 09:16:25,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:25,138 INFO L482 AbstractCegarLoop]: Abstraction has 18532 states and 56700 transitions. [2021-06-05 09:16:25,138 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:25,138 INFO L276 IsEmpty]: Start isEmpty. Operand 18532 states and 56700 transitions. [2021-06-05 09:16:25,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 09:16:25,150 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:25,150 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:25,150 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2021-06-05 09:16:25,151 INFO L430 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:25,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:25,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1583236427, now seen corresponding path program 1 times [2021-06-05 09:16:25,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:25,151 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116488489] [2021-06-05 09:16:25,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:25,226 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:16:25,226 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:25,226 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116488489] [2021-06-05 09:16:25,226 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116488489] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:25,226 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491285812] [2021-06-05 09:16:25,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:16:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:25,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 09:16:25,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:16:25,425 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:16:25,426 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:25,433 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:25,434 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:25,434 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:16:25,466 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:16:25,467 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:25,470 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:25,471 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:25,471 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:16:25,488 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:16:25,488 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491285812] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:25,488 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:16:25,488 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2021-06-05 09:16:25,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152509766] [2021-06-05 09:16:25,488 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 09:16:25,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:25,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 09:16:25,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:16:25,489 INFO L87 Difference]: Start difference. First operand 18532 states and 56700 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:26,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:26,342 INFO L93 Difference]: Finished difference Result 20329 states and 62111 transitions. [2021-06-05 09:16:26,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 09:16:26,342 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-06-05 09:16:26,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:26,374 INFO L225 Difference]: With dead ends: 20329 [2021-06-05 09:16:26,374 INFO L226 Difference]: Without dead ends: 20329 [2021-06-05 09:16:26,374 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 242.3ms TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2021-06-05 09:16:26,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20329 states. [2021-06-05 09:16:26,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20329 to 19510. [2021-06-05 09:16:26,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19510 states, 19510 states have (on average 3.060123013839057) internal successors, (59703), 19509 states have internal predecessors, (59703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:26,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19510 states to 19510 states and 59703 transitions. [2021-06-05 09:16:26,810 INFO L78 Accepts]: Start accepts. Automaton has 19510 states and 59703 transitions. Word has length 65 [2021-06-05 09:16:26,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:26,811 INFO L482 AbstractCegarLoop]: Abstraction has 19510 states and 59703 transitions. [2021-06-05 09:16:26,811 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:26,811 INFO L276 IsEmpty]: Start isEmpty. Operand 19510 states and 59703 transitions. [2021-06-05 09:16:26,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 09:16:26,824 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:26,824 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:27,024 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156,89 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:16:27,024 INFO L430 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:27,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:27,025 INFO L82 PathProgramCache]: Analyzing trace with hash 88374643, now seen corresponding path program 2 times [2021-06-05 09:16:27,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:27,025 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661419940] [2021-06-05 09:16:27,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:27,106 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:16:27,107 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:27,107 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661419940] [2021-06-05 09:16:27,107 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661419940] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:27,107 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663241307] [2021-06-05 09:16:27,107 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:16:27,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:16:27,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:16:27,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 09:16:27,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:16:27,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:16:27,263 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:27,269 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:27,269 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:27,269 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:16:27,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:16:27,307 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:27,311 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:27,311 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:27,312 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:16:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:16:27,329 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663241307] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:27,330 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:16:27,330 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2021-06-05 09:16:27,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326887656] [2021-06-05 09:16:27,330 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 09:16:27,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:27,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 09:16:27,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:16:27,330 INFO L87 Difference]: Start difference. First operand 19510 states and 59703 transitions. Second operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:28,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:28,125 INFO L93 Difference]: Finished difference Result 21091 states and 64410 transitions. [2021-06-05 09:16:28,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 09:16:28,126 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-06-05 09:16:28,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:28,156 INFO L225 Difference]: With dead ends: 21091 [2021-06-05 09:16:28,156 INFO L226 Difference]: Without dead ends: 21091 [2021-06-05 09:16:28,156 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 206.9ms TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2021-06-05 09:16:28,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21091 states. [2021-06-05 09:16:28,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21091 to 19474. [2021-06-05 09:16:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19474 states, 19474 states have (on average 3.0604395604395602) internal successors, (59599), 19473 states have internal predecessors, (59599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:28,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19474 states to 19474 states and 59599 transitions. [2021-06-05 09:16:28,509 INFO L78 Accepts]: Start accepts. Automaton has 19474 states and 59599 transitions. Word has length 65 [2021-06-05 09:16:28,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:28,509 INFO L482 AbstractCegarLoop]: Abstraction has 19474 states and 59599 transitions. [2021-06-05 09:16:28,509 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 15 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:28,509 INFO L276 IsEmpty]: Start isEmpty. Operand 19474 states and 59599 transitions. [2021-06-05 09:16:28,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 09:16:28,522 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:28,522 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:28,722 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157,90 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:16:28,722 INFO L430 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:28,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:28,722 INFO L82 PathProgramCache]: Analyzing trace with hash -2013541409, now seen corresponding path program 3 times [2021-06-05 09:16:28,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:28,723 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748524711] [2021-06-05 09:16:28,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:28,793 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:16:28,793 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:28,794 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748524711] [2021-06-05 09:16:28,794 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748524711] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:28,794 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792961227] [2021-06-05 09:16:28,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:16:28,854 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 09:16:28,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:16:28,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 09:16:28,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:16:28,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:16:28,960 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:28,965 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:28,966 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:28,966 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:16:29,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:16:29,004 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:29,008 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:29,008 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:29,008 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:16:29,026 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:16:29,026 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792961227] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:29,026 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:16:29,026 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 16 [2021-06-05 09:16:29,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930698418] [2021-06-05 09:16:29,026 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 09:16:29,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:29,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 09:16:29,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:16:29,027 INFO L87 Difference]: Start difference. First operand 19474 states and 59599 transitions. Second operand has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:29,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:29,869 INFO L93 Difference]: Finished difference Result 21894 states and 66825 transitions. [2021-06-05 09:16:29,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 09:16:29,870 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-06-05 09:16:29,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:29,900 INFO L225 Difference]: With dead ends: 21894 [2021-06-05 09:16:29,900 INFO L226 Difference]: Without dead ends: 21894 [2021-06-05 09:16:29,900 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 219.3ms TimeCoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2021-06-05 09:16:30,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21894 states. [2021-06-05 09:16:30,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21894 to 19594. [2021-06-05 09:16:30,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19594 states, 19594 states have (on average 3.058844544248239) internal successors, (59935), 19593 states have internal predecessors, (59935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:30,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19594 states to 19594 states and 59935 transitions. [2021-06-05 09:16:30,255 INFO L78 Accepts]: Start accepts. Automaton has 19594 states and 59935 transitions. Word has length 65 [2021-06-05 09:16:30,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:30,255 INFO L482 AbstractCegarLoop]: Abstraction has 19594 states and 59935 transitions. [2021-06-05 09:16:30,255 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:30,255 INFO L276 IsEmpty]: Start isEmpty. Operand 19594 states and 59935 transitions. [2021-06-05 09:16:30,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 09:16:30,267 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:30,267 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:30,467 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 91 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable158 [2021-06-05 09:16:30,468 INFO L430 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:30,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:30,468 INFO L82 PathProgramCache]: Analyzing trace with hash -175762209, now seen corresponding path program 4 times [2021-06-05 09:16:30,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:30,468 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351815177] [2021-06-05 09:16:30,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:30,546 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:16:30,547 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:30,547 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351815177] [2021-06-05 09:16:30,547 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351815177] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:30,547 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235643833] [2021-06-05 09:16:30,547 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:16:30,608 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:16:30,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:16:30,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 09:16:30,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:16:30,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:16:30,741 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:30,747 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:30,748 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:30,748 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:16:30,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:16:30,768 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:30,772 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:30,772 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:30,772 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:16:30,796 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:16:30,797 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235643833] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:30,797 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:16:30,797 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 17 [2021-06-05 09:16:30,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608208387] [2021-06-05 09:16:30,797 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 09:16:30,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:30,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 09:16:30,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2021-06-05 09:16:30,798 INFO L87 Difference]: Start difference. First operand 19594 states and 59935 transitions. Second operand has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:31,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:31,568 INFO L93 Difference]: Finished difference Result 22728 states and 69280 transitions. [2021-06-05 09:16:31,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 09:16:31,569 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-06-05 09:16:31,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:31,601 INFO L225 Difference]: With dead ends: 22728 [2021-06-05 09:16:31,601 INFO L226 Difference]: Without dead ends: 22728 [2021-06-05 09:16:31,602 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 244.3ms TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2021-06-05 09:16:31,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22728 states. [2021-06-05 09:16:31,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22728 to 20586. [2021-06-05 09:16:31,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20586 states, 20586 states have (on average 3.0573690857864566) internal successors, (62939), 20585 states have internal predecessors, (62939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:31,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20586 states to 20586 states and 62939 transitions. [2021-06-05 09:16:31,974 INFO L78 Accepts]: Start accepts. Automaton has 20586 states and 62939 transitions. Word has length 65 [2021-06-05 09:16:31,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:31,975 INFO L482 AbstractCegarLoop]: Abstraction has 20586 states and 62939 transitions. [2021-06-05 09:16:31,975 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:31,975 INFO L276 IsEmpty]: Start isEmpty. Operand 20586 states and 62939 transitions. [2021-06-05 09:16:31,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 09:16:31,987 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:31,987 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:32,188 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 92 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable159 [2021-06-05 09:16:32,189 INFO L430 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:32,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:32,189 INFO L82 PathProgramCache]: Analyzing trace with hash 597043640, now seen corresponding path program 1 times [2021-06-05 09:16:32,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:32,189 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233448224] [2021-06-05 09:16:32,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:32,262 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:16:32,262 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:32,262 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233448224] [2021-06-05 09:16:32,262 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233448224] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:32,263 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31838709] [2021-06-05 09:16:32,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:16:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:32,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 09:16:32,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:16:32,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:16:32,454 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:32,461 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:32,462 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:32,462 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:16:32,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:16:32,484 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:32,489 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:32,489 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:32,489 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:16:32,514 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:16:32,514 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31838709] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:32,514 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:16:32,514 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2021-06-05 09:16:32,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810306162] [2021-06-05 09:16:32,515 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 09:16:32,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:32,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 09:16:32,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:16:32,515 INFO L87 Difference]: Start difference. First operand 20586 states and 62939 transitions. Second operand has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:33,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:33,390 INFO L93 Difference]: Finished difference Result 24177 states and 73733 transitions. [2021-06-05 09:16:33,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 09:16:33,392 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-06-05 09:16:33,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:33,431 INFO L225 Difference]: With dead ends: 24177 [2021-06-05 09:16:33,431 INFO L226 Difference]: Without dead ends: 24177 [2021-06-05 09:16:33,431 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 283.9ms TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2021-06-05 09:16:33,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24177 states. [2021-06-05 09:16:33,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24177 to 22451. [2021-06-05 09:16:33,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22451 states, 22451 states have (on average 3.058883791367868) internal successors, (68675), 22450 states have internal predecessors, (68675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:33,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22451 states to 22451 states and 68675 transitions. [2021-06-05 09:16:33,846 INFO L78 Accepts]: Start accepts. Automaton has 22451 states and 68675 transitions. Word has length 65 [2021-06-05 09:16:33,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:33,846 INFO L482 AbstractCegarLoop]: Abstraction has 22451 states and 68675 transitions. [2021-06-05 09:16:33,846 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:33,846 INFO L276 IsEmpty]: Start isEmpty. Operand 22451 states and 68675 transitions. [2021-06-05 09:16:33,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 09:16:33,863 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:33,863 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:34,064 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160,93 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:16:34,064 INFO L430 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:34,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:34,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1999618796, now seen corresponding path program 2 times [2021-06-05 09:16:34,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:34,064 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441737843] [2021-06-05 09:16:34,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:34,153 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:16:34,153 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:34,153 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441737843] [2021-06-05 09:16:34,153 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441737843] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:34,153 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900675555] [2021-06-05 09:16:34,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:16:34,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:16:34,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:16:34,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 09:16:34,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:16:34,320 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:16:34,321 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:34,326 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:34,327 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:34,327 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:16:34,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:16:34,350 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:34,354 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:34,354 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:34,355 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:16:34,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:16:34,377 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900675555] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:34,377 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:16:34,378 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 15 [2021-06-05 09:16:34,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983461340] [2021-06-05 09:16:34,378 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 09:16:34,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:34,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 09:16:34,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:16:34,378 INFO L87 Difference]: Start difference. First operand 22451 states and 68675 transitions. Second operand has 15 states, 15 states have (on average 5.0) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:35,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:35,051 INFO L93 Difference]: Finished difference Result 28280 states and 86143 transitions. [2021-06-05 09:16:35,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 09:16:35,051 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.0) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-06-05 09:16:35,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:35,095 INFO L225 Difference]: With dead ends: 28280 [2021-06-05 09:16:35,095 INFO L226 Difference]: Without dead ends: 28280 [2021-06-05 09:16:35,095 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 198.3ms TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2021-06-05 09:16:35,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28280 states. [2021-06-05 09:16:35,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28280 to 22988. [2021-06-05 09:16:35,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22988 states, 22988 states have (on average 3.0532016704367497) internal successors, (70187), 22987 states have internal predecessors, (70187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:35,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22988 states to 22988 states and 70187 transitions. [2021-06-05 09:16:35,545 INFO L78 Accepts]: Start accepts. Automaton has 22988 states and 70187 transitions. Word has length 65 [2021-06-05 09:16:35,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:35,545 INFO L482 AbstractCegarLoop]: Abstraction has 22988 states and 70187 transitions. [2021-06-05 09:16:35,545 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.0) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:35,546 INFO L276 IsEmpty]: Start isEmpty. Operand 22988 states and 70187 transitions. [2021-06-05 09:16:35,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 09:16:35,563 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:35,563 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:35,763 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 94 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable161 [2021-06-05 09:16:35,764 INFO L430 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:35,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:35,764 INFO L82 PathProgramCache]: Analyzing trace with hash 573498816, now seen corresponding path program 3 times [2021-06-05 09:16:35,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:35,764 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255176690] [2021-06-05 09:16:35,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:35,843 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:16:35,843 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:35,843 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255176690] [2021-06-05 09:16:35,843 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255176690] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:35,843 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56400869] [2021-06-05 09:16:35,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:16:35,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 09:16:35,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:16:35,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 09:16:35,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:16:35,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:16:35,956 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:35,959 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:35,959 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:35,959 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2021-06-05 09:16:36,002 INFO L354 Elim1Store]: treesize reduction 19, result has 44.1 percent of original size [2021-06-05 09:16:36,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2021-06-05 09:16:36,003 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:36,010 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:36,012 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:16:36,012 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:27 [2021-06-05 09:16:36,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-06-05 09:16:36,091 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:36,094 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-06-05 09:16:36,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2021-06-05 09:16:36,095 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:36,096 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:36,097 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:36,097 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:56, output treesize:9 [2021-06-05 09:16:36,118 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 09:16:36,118 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56400869] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:36,118 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:16:36,118 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2021-06-05 09:16:36,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331233002] [2021-06-05 09:16:36,119 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-05 09:16:36,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:36,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-05 09:16:36,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:16:36,119 INFO L87 Difference]: Start difference. First operand 22988 states and 70187 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:36,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:36,845 INFO L93 Difference]: Finished difference Result 38244 states and 117470 transitions. [2021-06-05 09:16:36,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 09:16:36,846 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-06-05 09:16:36,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:36,911 INFO L225 Difference]: With dead ends: 38244 [2021-06-05 09:16:36,911 INFO L226 Difference]: Without dead ends: 38244 [2021-06-05 09:16:36,911 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 360.5ms TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2021-06-05 09:16:37,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38244 states. [2021-06-05 09:16:37,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38244 to 26050. [2021-06-05 09:16:37,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26050 states, 26050 states have (on average 3.0872936660268713) internal successors, (80424), 26049 states have internal predecessors, (80424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:37,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26050 states to 26050 states and 80424 transitions. [2021-06-05 09:16:37,584 INFO L78 Accepts]: Start accepts. Automaton has 26050 states and 80424 transitions. Word has length 65 [2021-06-05 09:16:37,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:37,585 INFO L482 AbstractCegarLoop]: Abstraction has 26050 states and 80424 transitions. [2021-06-05 09:16:37,585 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:37,585 INFO L276 IsEmpty]: Start isEmpty. Operand 26050 states and 80424 transitions. [2021-06-05 09:16:37,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 09:16:37,604 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:37,604 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:37,808 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162,95 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:16:37,809 INFO L430 AbstractCegarLoop]: === Iteration 70 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:37,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:37,809 INFO L82 PathProgramCache]: Analyzing trace with hash -226945705, now seen corresponding path program 1 times [2021-06-05 09:16:37,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:37,809 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573423795] [2021-06-05 09:16:37,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:37,903 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:16:37,903 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:37,903 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573423795] [2021-06-05 09:16:37,903 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573423795] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:37,903 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756287773] [2021-06-05 09:16:37,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:16:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:37,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 09:16:37,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:16:38,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:16:38,100 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:38,104 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:38,105 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:38,105 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2021-06-05 09:16:38,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 09:16:38,131 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:38,134 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:38,135 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:38,135 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2021-06-05 09:16:38,153 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:16:38,154 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756287773] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:38,154 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:16:38,154 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 18 [2021-06-05 09:16:38,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480987750] [2021-06-05 09:16:38,154 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 09:16:38,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:38,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 09:16:38,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-06-05 09:16:38,155 INFO L87 Difference]: Start difference. First operand 26050 states and 80424 transitions. Second operand has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:38,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:38,927 INFO L93 Difference]: Finished difference Result 31195 states and 95980 transitions. [2021-06-05 09:16:38,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 09:16:38,927 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-06-05 09:16:38,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:38,980 INFO L225 Difference]: With dead ends: 31195 [2021-06-05 09:16:38,980 INFO L226 Difference]: Without dead ends: 31195 [2021-06-05 09:16:38,980 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 263.0ms TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2021-06-05 09:16:39,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31195 states. [2021-06-05 09:16:39,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31195 to 27255. [2021-06-05 09:16:39,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27255 states, 27255 states have (on average 3.0872500458631444) internal successors, (84143), 27254 states have internal predecessors, (84143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:39,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27255 states to 27255 states and 84143 transitions. [2021-06-05 09:16:39,506 INFO L78 Accepts]: Start accepts. Automaton has 27255 states and 84143 transitions. Word has length 65 [2021-06-05 09:16:39,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:39,506 INFO L482 AbstractCegarLoop]: Abstraction has 27255 states and 84143 transitions. [2021-06-05 09:16:39,507 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:39,507 INFO L276 IsEmpty]: Start isEmpty. Operand 27255 states and 84143 transitions. [2021-06-05 09:16:39,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-06-05 09:16:39,526 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:39,526 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:39,726 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164,96 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:16:39,726 INFO L430 AbstractCegarLoop]: === Iteration 71 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:39,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:39,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1634586704, now seen corresponding path program 4 times [2021-06-05 09:16:39,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:39,727 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056605286] [2021-06-05 09:16:39,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:39,821 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:16:39,821 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:39,821 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056605286] [2021-06-05 09:16:39,821 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056605286] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:39,822 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970546155] [2021-06-05 09:16:39,822 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:16:39,892 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:16:39,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:16:39,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 09:16:39,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:16:39,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:16:39,996 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:40,002 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:40,003 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:40,003 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:16:40,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:16:40,023 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:40,026 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:40,027 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:40,027 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:16:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-06-05 09:16:40,049 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970546155] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:40,049 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:16:40,049 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2021-06-05 09:16:40,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887001386] [2021-06-05 09:16:40,049 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 09:16:40,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:40,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 09:16:40,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:16:40,050 INFO L87 Difference]: Start difference. First operand 27255 states and 84143 transitions. Second operand has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:40,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:40,753 INFO L93 Difference]: Finished difference Result 30482 states and 93881 transitions. [2021-06-05 09:16:40,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 09:16:40,754 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-06-05 09:16:40,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:40,803 INFO L225 Difference]: With dead ends: 30482 [2021-06-05 09:16:40,803 INFO L226 Difference]: Without dead ends: 30482 [2021-06-05 09:16:40,803 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 203.4ms TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2021-06-05 09:16:41,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30482 states. [2021-06-05 09:16:41,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30482 to 27167. [2021-06-05 09:16:41,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27167 states, 27167 states have (on average 3.087532668310818) internal successors, (83879), 27166 states have internal predecessors, (83879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:41,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27167 states to 27167 states and 83879 transitions. [2021-06-05 09:16:41,396 INFO L78 Accepts]: Start accepts. Automaton has 27167 states and 83879 transitions. Word has length 65 [2021-06-05 09:16:41,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:41,397 INFO L482 AbstractCegarLoop]: Abstraction has 27167 states and 83879 transitions. [2021-06-05 09:16:41,397 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:41,397 INFO L276 IsEmpty]: Start isEmpty. Operand 27167 states and 83879 transitions. [2021-06-05 09:16:41,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-06-05 09:16:41,418 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:41,418 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:41,618 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 97 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable165 [2021-06-05 09:16:41,618 INFO L430 AbstractCegarLoop]: === Iteration 72 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:41,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:41,619 INFO L82 PathProgramCache]: Analyzing trace with hash 59286066, now seen corresponding path program 1 times [2021-06-05 09:16:41,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:41,619 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254903349] [2021-06-05 09:16:41,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:41,700 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:16:41,700 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:41,700 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254903349] [2021-06-05 09:16:41,700 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254903349] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:41,700 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516603294] [2021-06-05 09:16:41,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:16:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:41,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 09:16:41,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:16:41,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:16:41,916 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:41,923 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:41,924 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:41,924 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:16:41,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:16:41,947 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:41,952 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:41,953 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:41,953 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:16:41,978 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:16:41,979 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516603294] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:41,979 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:16:41,979 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 16 [2021-06-05 09:16:41,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470958204] [2021-06-05 09:16:41,980 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 09:16:41,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:41,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 09:16:41,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:16:41,980 INFO L87 Difference]: Start difference. First operand 27167 states and 83879 transitions. Second operand has 16 states, 16 states have (on average 5.0) internal successors, (80), 16 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:42,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:42,787 INFO L93 Difference]: Finished difference Result 32787 states and 101143 transitions. [2021-06-05 09:16:42,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 09:16:42,787 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.0) internal successors, (80), 16 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-06-05 09:16:42,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:42,843 INFO L225 Difference]: With dead ends: 32787 [2021-06-05 09:16:42,843 INFO L226 Difference]: Without dead ends: 32787 [2021-06-05 09:16:42,843 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 229.5ms TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2021-06-05 09:16:42,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32787 states. [2021-06-05 09:16:43,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32787 to 28025. [2021-06-05 09:16:43,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28025 states, 28025 states have (on average 3.0858162355040144) internal successors, (86480), 28024 states have internal predecessors, (86480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:43,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28025 states to 28025 states and 86480 transitions. [2021-06-05 09:16:43,419 INFO L78 Accepts]: Start accepts. Automaton has 28025 states and 86480 transitions. Word has length 66 [2021-06-05 09:16:43,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:43,419 INFO L482 AbstractCegarLoop]: Abstraction has 28025 states and 86480 transitions. [2021-06-05 09:16:43,419 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 5.0) internal successors, (80), 16 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:43,419 INFO L276 IsEmpty]: Start isEmpty. Operand 28025 states and 86480 transitions. [2021-06-05 09:16:43,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-06-05 09:16:43,441 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:43,441 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:43,641 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 98 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable166 [2021-06-05 09:16:43,641 INFO L430 AbstractCegarLoop]: === Iteration 73 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:43,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:43,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1458563174, now seen corresponding path program 2 times [2021-06-05 09:16:43,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:43,642 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233453618] [2021-06-05 09:16:43,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:43,716 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:16:43,716 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:43,717 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233453618] [2021-06-05 09:16:43,717 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233453618] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:43,717 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293617576] [2021-06-05 09:16:43,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:16:43,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 09:16:43,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:16:43,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 35 conjunts are in the unsatisfiable core [2021-06-05 09:16:43,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:16:43,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 09:16:43,825 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:43,828 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:43,828 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:43,829 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 09:16:43,845 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:16:43,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 09:16:43,846 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:43,850 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:43,850 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:43,851 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 09:16:43,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:16:43,867 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:43,872 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:43,873 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:43,873 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2021-06-05 09:16:43,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:16:43,894 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:43,903 INFO L628 ElimStorePlain]: treesize reduction 4, result has 83.3 percent of original size [2021-06-05 09:16:43,903 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:43,903 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2021-06-05 09:16:43,984 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:16:43,984 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 20 [2021-06-05 09:16:43,985 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:43,989 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:43,989 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:43,989 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:9 [2021-06-05 09:16:44,015 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-06-05 09:16:44,015 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293617576] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:44,015 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:16:44,015 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2021-06-05 09:16:44,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342509110] [2021-06-05 09:16:44,015 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:16:44,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:44,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:16:44,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-06-05 09:16:44,016 INFO L87 Difference]: Start difference. First operand 28025 states and 86480 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:47,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:47,568 INFO L93 Difference]: Finished difference Result 89878 states and 281548 transitions. [2021-06-05 09:16:47,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 09:16:47,569 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-06-05 09:16:47,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:47,731 INFO L225 Difference]: With dead ends: 89878 [2021-06-05 09:16:47,731 INFO L226 Difference]: Without dead ends: 89878 [2021-06-05 09:16:47,731 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 444.4ms TimeCoverageRelationStatistics Valid=169, Invalid=823, Unknown=0, NotChecked=0, Total=992 [2021-06-05 09:16:48,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89878 states. [2021-06-05 09:16:48,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89878 to 31564. [2021-06-05 09:16:48,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31564 states, 31564 states have (on average 3.1047078950703333) internal successors, (97997), 31563 states have internal predecessors, (97997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:48,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31564 states to 31564 states and 97997 transitions. [2021-06-05 09:16:48,778 INFO L78 Accepts]: Start accepts. Automaton has 31564 states and 97997 transitions. Word has length 66 [2021-06-05 09:16:48,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:48,778 INFO L482 AbstractCegarLoop]: Abstraction has 31564 states and 97997 transitions. [2021-06-05 09:16:48,779 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:48,779 INFO L276 IsEmpty]: Start isEmpty. Operand 31564 states and 97997 transitions. [2021-06-05 09:16:48,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-06-05 09:16:48,802 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:48,802 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:49,002 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167,99 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:16:49,002 INFO L430 AbstractCegarLoop]: === Iteration 74 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:49,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:49,002 INFO L82 PathProgramCache]: Analyzing trace with hash 910370044, now seen corresponding path program 3 times [2021-06-05 09:16:49,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:49,003 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480394078] [2021-06-05 09:16:49,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:49,078 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:16:49,078 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:49,078 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480394078] [2021-06-05 09:16:49,078 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480394078] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:49,078 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115647216] [2021-06-05 09:16:49,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:16:49,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 09:16:49,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:16:49,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 35 conjunts are in the unsatisfiable core [2021-06-05 09:16:49,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:16:49,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 09:16:49,189 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:49,193 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:49,194 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:49,194 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 09:16:49,217 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:16:49,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 09:16:49,219 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:49,224 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:49,225 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:49,225 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 09:16:49,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:16:49,246 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:49,253 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:49,253 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:49,254 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2021-06-05 09:16:49,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-06-05 09:16:49,283 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:49,294 INFO L628 ElimStorePlain]: treesize reduction 4, result has 83.3 percent of original size [2021-06-05 09:16:49,295 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:49,295 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2021-06-05 09:16:49,354 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:16:49,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2021-06-05 09:16:49,356 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:49,359 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:49,360 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:49,360 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:5 [2021-06-05 09:16:49,400 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-06-05 09:16:49,401 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115647216] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:16:49,401 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:16:49,401 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2021-06-05 09:16:49,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465168968] [2021-06-05 09:16:49,401 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 09:16:49,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:49,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 09:16:49,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-06-05 09:16:49,401 INFO L87 Difference]: Start difference. First operand 31564 states and 97997 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:50,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:50,436 INFO L93 Difference]: Finished difference Result 88146 states and 276825 transitions. [2021-06-05 09:16:50,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-05 09:16:50,437 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-06-05 09:16:50,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:50,602 INFO L225 Difference]: With dead ends: 88146 [2021-06-05 09:16:50,602 INFO L226 Difference]: Without dead ends: 88146 [2021-06-05 09:16:50,603 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 440.2ms TimeCoverageRelationStatistics Valid=183, Invalid=939, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 09:16:50,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88146 states. [2021-06-05 09:16:51,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88146 to 31662. [2021-06-05 09:16:51,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31662 states, 31662 states have (on average 3.1077316657191587) internal successors, (98397), 31661 states have internal predecessors, (98397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:51,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31662 states to 31662 states and 98397 transitions. [2021-06-05 09:16:51,639 INFO L78 Accepts]: Start accepts. Automaton has 31662 states and 98397 transitions. Word has length 66 [2021-06-05 09:16:51,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:51,639 INFO L482 AbstractCegarLoop]: Abstraction has 31662 states and 98397 transitions. [2021-06-05 09:16:51,639 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:51,639 INFO L276 IsEmpty]: Start isEmpty. Operand 31662 states and 98397 transitions. [2021-06-05 09:16:51,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-06-05 09:16:51,662 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:51,662 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:51,862 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 100 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable168 [2021-06-05 09:16:51,863 INFO L430 AbstractCegarLoop]: === Iteration 75 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:51,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:51,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1194592090, now seen corresponding path program 4 times [2021-06-05 09:16:51,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:51,863 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114914476] [2021-06-05 09:16:51,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:16:51,940 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:51,941 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114914476] [2021-06-05 09:16:51,941 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114914476] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:51,941 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383030689] [2021-06-05 09:16:51,941 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:16:52,002 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:16:52,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:16:52,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 09:16:52,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:16:52,136 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:16:52,137 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:52,146 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:52,147 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:52,147 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:16:52,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:16:52,177 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:52,182 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:52,183 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:52,183 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:16:52,206 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:16:52,206 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383030689] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:52,207 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:16:52,207 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 16 [2021-06-05 09:16:52,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180687152] [2021-06-05 09:16:52,207 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 09:16:52,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:52,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 09:16:52,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:16:52,207 INFO L87 Difference]: Start difference. First operand 31662 states and 98397 transitions. Second operand has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:52,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:52,995 INFO L93 Difference]: Finished difference Result 37712 states and 117141 transitions. [2021-06-05 09:16:52,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 09:16:52,995 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-06-05 09:16:52,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:53,061 INFO L225 Difference]: With dead ends: 37712 [2021-06-05 09:16:53,061 INFO L226 Difference]: Without dead ends: 37712 [2021-06-05 09:16:53,061 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 219.3ms TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2021-06-05 09:16:53,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37712 states. [2021-06-05 09:16:53,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37712 to 33910. [2021-06-05 09:16:53,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33910 states, 33910 states have (on average 3.1118843998820407) internal successors, (105524), 33909 states have internal predecessors, (105524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33910 states to 33910 states and 105524 transitions. [2021-06-05 09:16:53,747 INFO L78 Accepts]: Start accepts. Automaton has 33910 states and 105524 transitions. Word has length 66 [2021-06-05 09:16:53,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:53,747 INFO L482 AbstractCegarLoop]: Abstraction has 33910 states and 105524 transitions. [2021-06-05 09:16:53,747 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:53,747 INFO L276 IsEmpty]: Start isEmpty. Operand 33910 states and 105524 transitions. [2021-06-05 09:16:53,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-06-05 09:16:53,772 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:53,772 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:53,972 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 101 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable169 [2021-06-05 09:16:53,973 INFO L430 AbstractCegarLoop]: === Iteration 76 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:53,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:53,973 INFO L82 PathProgramCache]: Analyzing trace with hash 182376034, now seen corresponding path program 5 times [2021-06-05 09:16:53,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:53,973 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209403009] [2021-06-05 09:16:53,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:54,050 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:16:54,050 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:54,050 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209403009] [2021-06-05 09:16:54,050 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209403009] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:54,050 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065296275] [2021-06-05 09:16:54,050 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:16:54,122 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 09:16:54,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:16:54,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 09:16:54,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:16:54,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:16:54,232 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:54,238 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:54,239 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:54,239 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:16:54,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:16:54,261 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:54,265 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:54,265 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:54,265 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:16:54,286 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:16:54,286 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065296275] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:54,286 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:16:54,286 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2021-06-05 09:16:54,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645494703] [2021-06-05 09:16:54,286 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 09:16:54,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:54,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 09:16:54,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:16:54,287 INFO L87 Difference]: Start difference. First operand 33910 states and 105524 transitions. Second operand has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:54,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:54,922 INFO L93 Difference]: Finished difference Result 37035 states and 115108 transitions. [2021-06-05 09:16:54,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 09:16:54,923 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-06-05 09:16:54,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:54,986 INFO L225 Difference]: With dead ends: 37035 [2021-06-05 09:16:54,986 INFO L226 Difference]: Without dead ends: 37035 [2021-06-05 09:16:54,986 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 195.8ms TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2021-06-05 09:16:55,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37035 states. [2021-06-05 09:16:55,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37035 to 34248. [2021-06-05 09:16:55,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34248 states, 34248 states have (on average 3.111510161177295) internal successors, (106563), 34247 states have internal predecessors, (106563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:55,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34248 states to 34248 states and 106563 transitions. [2021-06-05 09:16:55,709 INFO L78 Accepts]: Start accepts. Automaton has 34248 states and 106563 transitions. Word has length 66 [2021-06-05 09:16:55,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:55,709 INFO L482 AbstractCegarLoop]: Abstraction has 34248 states and 106563 transitions. [2021-06-05 09:16:55,710 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:55,710 INFO L276 IsEmpty]: Start isEmpty. Operand 34248 states and 106563 transitions. [2021-06-05 09:16:55,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-06-05 09:16:55,735 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:55,735 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:55,935 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable170 [2021-06-05 09:16:55,935 INFO L430 AbstractCegarLoop]: === Iteration 77 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:55,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:55,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1307339496, now seen corresponding path program 6 times [2021-06-05 09:16:55,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:55,936 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673360185] [2021-06-05 09:16:55,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:56,030 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:16:56,030 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:56,030 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673360185] [2021-06-05 09:16:56,030 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673360185] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:56,030 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962072515] [2021-06-05 09:16:56,030 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:16:56,126 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-06-05 09:16:56,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:16:56,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 36 conjunts are in the unsatisfiable core [2021-06-05 09:16:56,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:16:56,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:16:56,245 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:56,252 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:56,253 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:56,253 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2021-06-05 09:16:56,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 09:16:56,274 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:56,278 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:56,278 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:56,278 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2021-06-05 09:16:56,300 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:16:56,300 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962072515] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:56,301 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:16:56,301 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 14 [2021-06-05 09:16:56,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852640050] [2021-06-05 09:16:56,301 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 09:16:56,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:56,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 09:16:56,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-06-05 09:16:56,301 INFO L87 Difference]: Start difference. First operand 34248 states and 106563 transitions. Second operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:57,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:57,072 INFO L93 Difference]: Finished difference Result 37285 states and 115883 transitions. [2021-06-05 09:16:57,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 09:16:57,072 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-06-05 09:16:57,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:57,132 INFO L225 Difference]: With dead ends: 37285 [2021-06-05 09:16:57,132 INFO L226 Difference]: Without dead ends: 37285 [2021-06-05 09:16:57,132 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 233.8ms TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2021-06-05 09:16:57,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37285 states. [2021-06-05 09:16:57,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37285 to 34240. [2021-06-05 09:16:57,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34240 states, 34240 states have (on average 3.1106016355140187) internal successors, (106507), 34239 states have internal predecessors, (106507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:57,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34240 states to 34240 states and 106507 transitions. [2021-06-05 09:16:57,758 INFO L78 Accepts]: Start accepts. Automaton has 34240 states and 106507 transitions. Word has length 66 [2021-06-05 09:16:57,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:16:57,758 INFO L482 AbstractCegarLoop]: Abstraction has 34240 states and 106507 transitions. [2021-06-05 09:16:57,758 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:57,758 INFO L276 IsEmpty]: Start isEmpty. Operand 34240 states and 106507 transitions. [2021-06-05 09:16:57,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-06-05 09:16:57,782 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:16:57,782 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:16:57,982 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171,103 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:16:57,982 INFO L430 AbstractCegarLoop]: === Iteration 78 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:16:57,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:16:57,983 INFO L82 PathProgramCache]: Analyzing trace with hash -806391438, now seen corresponding path program 1 times [2021-06-05 09:16:57,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:16:57,983 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057327910] [2021-06-05 09:16:57,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:16:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:58,077 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:16:58,078 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:16:58,078 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057327910] [2021-06-05 09:16:58,078 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057327910] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:58,078 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412877851] [2021-06-05 09:16:58,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:16:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:16:58,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-05 09:16:58,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:16:58,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 09:16:58,271 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:58,275 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:58,275 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:58,275 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2021-06-05 09:16:58,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 09:16:58,296 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:16:58,298 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:16:58,299 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:16:58,299 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2021-06-05 09:16:58,318 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 09:16:58,318 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412877851] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:16:58,319 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:16:58,319 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 18 [2021-06-05 09:16:58,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205533403] [2021-06-05 09:16:58,319 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 09:16:58,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:16:58,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 09:16:58,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-06-05 09:16:58,319 INFO L87 Difference]: Start difference. First operand 34240 states and 106507 transitions. Second operand has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 18 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:16:59,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:16:59,374 INFO L93 Difference]: Finished difference Result 42084 states and 130703 transitions. [2021-06-05 09:16:59,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 09:16:59,375 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 18 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-06-05 09:16:59,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:16:59,450 INFO L225 Difference]: With dead ends: 42084 [2021-06-05 09:16:59,451 INFO L226 Difference]: Without dead ends: 42084 [2021-06-05 09:16:59,451 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 252.5ms TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2021-06-05 09:16:59,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42084 states. [2021-06-05 09:17:00,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42084 to 34755. [2021-06-05 09:17:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34755 states, 34755 states have (on average 3.110487699611567) internal successors, (108105), 34754 states have internal predecessors, (108105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:00,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34755 states to 34755 states and 108105 transitions. [2021-06-05 09:17:00,208 INFO L78 Accepts]: Start accepts. Automaton has 34755 states and 108105 transitions. Word has length 66 [2021-06-05 09:17:00,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:00,208 INFO L482 AbstractCegarLoop]: Abstraction has 34755 states and 108105 transitions. [2021-06-05 09:17:00,208 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 18 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:00,209 INFO L276 IsEmpty]: Start isEmpty. Operand 34755 states and 108105 transitions. [2021-06-05 09:17:00,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:00,236 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:00,236 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:00,436 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 104 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable172 [2021-06-05 09:17:00,436 INFO L430 AbstractCegarLoop]: === Iteration 79 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:00,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:00,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1884607264, now seen corresponding path program 1 times [2021-06-05 09:17:00,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:00,437 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138795602] [2021-06-05 09:17:00,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:00,517 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:00,517 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:00,517 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138795602] [2021-06-05 09:17:00,517 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138795602] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:00,517 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:00,517 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:00,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163206228] [2021-06-05 09:17:00,518 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:00,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:00,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:00,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:00,518 INFO L87 Difference]: Start difference. First operand 34755 states and 108105 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:01,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:01,002 INFO L93 Difference]: Finished difference Result 37809 states and 117587 transitions. [2021-06-05 09:17:01,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 09:17:01,003 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:01,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:01,063 INFO L225 Difference]: With dead ends: 37809 [2021-06-05 09:17:01,063 INFO L226 Difference]: Without dead ends: 37809 [2021-06-05 09:17:01,063 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 134.2ms TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:17:01,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37809 states. [2021-06-05 09:17:01,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37809 to 34893. [2021-06-05 09:17:01,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34893 states, 34893 states have (on average 3.111283065371278) internal successors, (108562), 34892 states have internal predecessors, (108562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:01,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34893 states to 34893 states and 108562 transitions. [2021-06-05 09:17:01,727 INFO L78 Accepts]: Start accepts. Automaton has 34893 states and 108562 transitions. Word has length 72 [2021-06-05 09:17:01,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:01,727 INFO L482 AbstractCegarLoop]: Abstraction has 34893 states and 108562 transitions. [2021-06-05 09:17:01,727 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:01,727 INFO L276 IsEmpty]: Start isEmpty. Operand 34893 states and 108562 transitions. [2021-06-05 09:17:01,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:01,754 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:01,754 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:01,754 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173 [2021-06-05 09:17:01,754 INFO L430 AbstractCegarLoop]: === Iteration 80 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:01,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:01,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1235140737, now seen corresponding path program 1 times [2021-06-05 09:17:01,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:01,755 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554447692] [2021-06-05 09:17:01,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:01,844 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:01,844 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:01,844 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554447692] [2021-06-05 09:17:01,844 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554447692] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:01,844 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:01,844 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:01,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748869809] [2021-06-05 09:17:01,845 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:01,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:01,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:01,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:01,845 INFO L87 Difference]: Start difference. First operand 34893 states and 108562 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:02,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:02,554 INFO L93 Difference]: Finished difference Result 37370 states and 116180 transitions. [2021-06-05 09:17:02,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 09:17:02,554 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:02,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:02,615 INFO L225 Difference]: With dead ends: 37370 [2021-06-05 09:17:02,615 INFO L226 Difference]: Without dead ends: 37370 [2021-06-05 09:17:02,616 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 241.3ms TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2021-06-05 09:17:02,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37370 states. [2021-06-05 09:17:03,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37370 to 34909. [2021-06-05 09:17:03,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34909 states, 34909 states have (on average 3.1112320605001575) internal successors, (108610), 34908 states have internal predecessors, (108610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:03,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34909 states to 34909 states and 108610 transitions. [2021-06-05 09:17:03,374 INFO L78 Accepts]: Start accepts. Automaton has 34909 states and 108610 transitions. Word has length 72 [2021-06-05 09:17:03,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:03,375 INFO L482 AbstractCegarLoop]: Abstraction has 34909 states and 108610 transitions. [2021-06-05 09:17:03,375 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:03,375 INFO L276 IsEmpty]: Start isEmpty. Operand 34909 states and 108610 transitions. [2021-06-05 09:17:03,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:03,409 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:03,410 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:03,410 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2021-06-05 09:17:03,410 INFO L430 AbstractCegarLoop]: === Iteration 81 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:03,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:03,410 INFO L82 PathProgramCache]: Analyzing trace with hash 49217879, now seen corresponding path program 2 times [2021-06-05 09:17:03,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:03,410 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822210743] [2021-06-05 09:17:03,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:03,506 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:03,506 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:03,506 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822210743] [2021-06-05 09:17:03,506 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822210743] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:03,506 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:03,507 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:03,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105108940] [2021-06-05 09:17:03,507 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:03,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:03,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:03,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:03,507 INFO L87 Difference]: Start difference. First operand 34909 states and 108610 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:04,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:04,285 INFO L93 Difference]: Finished difference Result 36938 states and 114873 transitions. [2021-06-05 09:17:04,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-05 09:17:04,286 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:04,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:04,349 INFO L225 Difference]: With dead ends: 36938 [2021-06-05 09:17:04,349 INFO L226 Difference]: Without dead ends: 36938 [2021-06-05 09:17:04,350 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 281.8ms TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2021-06-05 09:17:04,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36938 states. [2021-06-05 09:17:04,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36938 to 34985. [2021-06-05 09:17:05,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34985 states, 34985 states have (on average 3.112876947263113) internal successors, (108904), 34984 states have internal predecessors, (108904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:05,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34985 states to 34985 states and 108904 transitions. [2021-06-05 09:17:05,107 INFO L78 Accepts]: Start accepts. Automaton has 34985 states and 108904 transitions. Word has length 72 [2021-06-05 09:17:05,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:05,107 INFO L482 AbstractCegarLoop]: Abstraction has 34985 states and 108904 transitions. [2021-06-05 09:17:05,107 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:05,107 INFO L276 IsEmpty]: Start isEmpty. Operand 34985 states and 108904 transitions. [2021-06-05 09:17:05,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:05,134 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:05,134 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:05,135 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175 [2021-06-05 09:17:05,135 INFO L430 AbstractCegarLoop]: === Iteration 82 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:05,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:05,135 INFO L82 PathProgramCache]: Analyzing trace with hash 949695287, now seen corresponding path program 3 times [2021-06-05 09:17:05,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:05,135 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887317851] [2021-06-05 09:17:05,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:05,223 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:05,224 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:05,224 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887317851] [2021-06-05 09:17:05,224 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887317851] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:05,224 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:05,224 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:05,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067493755] [2021-06-05 09:17:05,224 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:05,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:05,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:05,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:05,225 INFO L87 Difference]: Start difference. First operand 34985 states and 108904 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:05,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:05,716 INFO L93 Difference]: Finished difference Result 35980 states and 111938 transitions. [2021-06-05 09:17:05,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 09:17:05,716 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:05,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:05,774 INFO L225 Difference]: With dead ends: 35980 [2021-06-05 09:17:05,774 INFO L226 Difference]: Without dead ends: 35980 [2021-06-05 09:17:05,774 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 144.2ms TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:17:05,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35980 states. [2021-06-05 09:17:06,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35980 to 34925. [2021-06-05 09:17:06,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34925 states, 34925 states have (on average 3.1111811023622047) internal successors, (108658), 34924 states have internal predecessors, (108658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:06,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34925 states to 34925 states and 108658 transitions. [2021-06-05 09:17:06,466 INFO L78 Accepts]: Start accepts. Automaton has 34925 states and 108658 transitions. Word has length 72 [2021-06-05 09:17:06,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:06,466 INFO L482 AbstractCegarLoop]: Abstraction has 34925 states and 108658 transitions. [2021-06-05 09:17:06,466 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:06,466 INFO L276 IsEmpty]: Start isEmpty. Operand 34925 states and 108658 transitions. [2021-06-05 09:17:06,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:06,495 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:06,495 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:06,495 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2021-06-05 09:17:06,495 INFO L430 AbstractCegarLoop]: === Iteration 83 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:06,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:06,496 INFO L82 PathProgramCache]: Analyzing trace with hash 970748952, now seen corresponding path program 2 times [2021-06-05 09:17:06,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:06,496 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110087035] [2021-06-05 09:17:06,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:06,577 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:06,577 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:06,577 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110087035] [2021-06-05 09:17:06,577 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110087035] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:06,577 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:06,578 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:06,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366050966] [2021-06-05 09:17:06,578 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:06,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:06,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:06,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:06,578 INFO L87 Difference]: Start difference. First operand 34925 states and 108658 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:07,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:07,213 INFO L93 Difference]: Finished difference Result 37418 states and 116376 transitions. [2021-06-05 09:17:07,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 09:17:07,214 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:07,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:07,278 INFO L225 Difference]: With dead ends: 37418 [2021-06-05 09:17:07,278 INFO L226 Difference]: Without dead ends: 37418 [2021-06-05 09:17:07,278 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 191.9ms TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-06-05 09:17:07,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37418 states. [2021-06-05 09:17:08,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37418 to 34973. [2021-06-05 09:17:08,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34973 states, 34973 states have (on average 3.11114288165156) internal successors, (108806), 34972 states have internal predecessors, (108806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:08,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34973 states to 34973 states and 108806 transitions. [2021-06-05 09:17:08,236 INFO L78 Accepts]: Start accepts. Automaton has 34973 states and 108806 transitions. Word has length 72 [2021-06-05 09:17:08,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:08,236 INFO L482 AbstractCegarLoop]: Abstraction has 34973 states and 108806 transitions. [2021-06-05 09:17:08,236 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:08,236 INFO L276 IsEmpty]: Start isEmpty. Operand 34973 states and 108806 transitions. [2021-06-05 09:17:08,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:08,265 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:08,265 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:08,265 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable177 [2021-06-05 09:17:08,265 INFO L430 AbstractCegarLoop]: === Iteration 84 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:08,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:08,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1102634390, now seen corresponding path program 3 times [2021-06-05 09:17:08,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:08,266 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707154063] [2021-06-05 09:17:08,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:08,343 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:08,343 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:08,343 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707154063] [2021-06-05 09:17:08,343 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707154063] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:08,343 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:08,343 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:08,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368036569] [2021-06-05 09:17:08,344 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:08,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:08,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:08,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:08,344 INFO L87 Difference]: Start difference. First operand 34973 states and 108806 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:09,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:09,028 INFO L93 Difference]: Finished difference Result 36916 states and 114909 transitions. [2021-06-05 09:17:09,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 09:17:09,028 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:09,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:09,087 INFO L225 Difference]: With dead ends: 36916 [2021-06-05 09:17:09,087 INFO L226 Difference]: Without dead ends: 36916 [2021-06-05 09:17:09,088 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 233.0ms TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2021-06-05 09:17:09,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36916 states. [2021-06-05 09:17:09,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36916 to 35013. [2021-06-05 09:17:09,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35013 states, 35013 states have (on average 3.1118727329848914) internal successors, (108956), 35012 states have internal predecessors, (108956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:09,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35013 states to 35013 states and 108956 transitions. [2021-06-05 09:17:09,881 INFO L78 Accepts]: Start accepts. Automaton has 35013 states and 108956 transitions. Word has length 72 [2021-06-05 09:17:09,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:09,881 INFO L482 AbstractCegarLoop]: Abstraction has 35013 states and 108956 transitions. [2021-06-05 09:17:09,881 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:09,881 INFO L276 IsEmpty]: Start isEmpty. Operand 35013 states and 108956 transitions. [2021-06-05 09:17:09,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:09,910 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:09,910 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:09,910 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable178 [2021-06-05 09:17:09,910 INFO L430 AbstractCegarLoop]: === Iteration 85 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:09,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:09,910 INFO L82 PathProgramCache]: Analyzing trace with hash -472720630, now seen corresponding path program 4 times [2021-06-05 09:17:09,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:09,910 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388689023] [2021-06-05 09:17:09,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:09,988 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:09,988 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:09,988 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388689023] [2021-06-05 09:17:09,988 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388689023] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:09,988 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:09,988 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:09,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464667840] [2021-06-05 09:17:09,988 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:09,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:09,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:09,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:09,989 INFO L87 Difference]: Start difference. First operand 35013 states and 108956 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:10,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:10,463 INFO L93 Difference]: Finished difference Result 35703 states and 111066 transitions. [2021-06-05 09:17:10,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 09:17:10,464 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:10,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:10,521 INFO L225 Difference]: With dead ends: 35703 [2021-06-05 09:17:10,521 INFO L226 Difference]: Without dead ends: 35703 [2021-06-05 09:17:10,522 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 139.0ms TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:17:10,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35703 states. [2021-06-05 09:17:11,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35703 to 34989. [2021-06-05 09:17:11,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34989 states, 34989 states have (on average 3.111092057503787) internal successors, (108854), 34988 states have internal predecessors, (108854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:11,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34989 states to 34989 states and 108854 transitions. [2021-06-05 09:17:11,395 INFO L78 Accepts]: Start accepts. Automaton has 34989 states and 108854 transitions. Word has length 72 [2021-06-05 09:17:11,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:11,395 INFO L482 AbstractCegarLoop]: Abstraction has 34989 states and 108854 transitions. [2021-06-05 09:17:11,396 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:11,396 INFO L276 IsEmpty]: Start isEmpty. Operand 34989 states and 108854 transitions. [2021-06-05 09:17:11,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:11,424 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:11,425 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:11,425 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable179 [2021-06-05 09:17:11,425 INFO L430 AbstractCegarLoop]: === Iteration 86 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:11,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:11,425 INFO L82 PathProgramCache]: Analyzing trace with hash 262957969, now seen corresponding path program 4 times [2021-06-05 09:17:11,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:11,425 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453171495] [2021-06-05 09:17:11,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:11,499 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:11,499 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453171495] [2021-06-05 09:17:11,499 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453171495] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:11,499 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:11,499 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:11,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370331977] [2021-06-05 09:17:11,499 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:11,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:11,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:11,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:11,500 INFO L87 Difference]: Start difference. First operand 34989 states and 108854 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:12,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:12,073 INFO L93 Difference]: Finished difference Result 36380 states and 113057 transitions. [2021-06-05 09:17:12,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 09:17:12,073 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:12,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:12,131 INFO L225 Difference]: With dead ends: 36380 [2021-06-05 09:17:12,131 INFO L226 Difference]: Without dead ends: 36380 [2021-06-05 09:17:12,131 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 208.9ms TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2021-06-05 09:17:12,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36380 states. [2021-06-05 09:17:12,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36380 to 34739. [2021-06-05 09:17:12,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34739 states, 34739 states have (on average 3.1111718817467398) internal successors, (108079), 34738 states have internal predecessors, (108079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:13,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34739 states to 34739 states and 108079 transitions. [2021-06-05 09:17:13,027 INFO L78 Accepts]: Start accepts. Automaton has 34739 states and 108079 transitions. Word has length 72 [2021-06-05 09:17:13,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:13,027 INFO L482 AbstractCegarLoop]: Abstraction has 34739 states and 108079 transitions. [2021-06-05 09:17:13,027 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:13,028 INFO L276 IsEmpty]: Start isEmpty. Operand 34739 states and 108079 transitions. [2021-06-05 09:17:13,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:13,058 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:13,058 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:13,059 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable180 [2021-06-05 09:17:13,059 INFO L430 AbstractCegarLoop]: === Iteration 87 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:13,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:13,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1547316585, now seen corresponding path program 5 times [2021-06-05 09:17:13,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:13,059 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290241531] [2021-06-05 09:17:13,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:13,137 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:13,137 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:13,137 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290241531] [2021-06-05 09:17:13,137 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290241531] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:13,137 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:13,137 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:13,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983677290] [2021-06-05 09:17:13,137 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:13,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:13,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:13,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:13,138 INFO L87 Difference]: Start difference. First operand 34739 states and 108079 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:13,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:13,828 INFO L93 Difference]: Finished difference Result 36688 states and 114084 transitions. [2021-06-05 09:17:13,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-05 09:17:13,828 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:13,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:13,886 INFO L225 Difference]: With dead ends: 36688 [2021-06-05 09:17:13,886 INFO L226 Difference]: Without dead ends: 36688 [2021-06-05 09:17:13,887 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 264.5ms TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2021-06-05 09:17:14,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36688 states. [2021-06-05 09:17:14,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36688 to 34815. [2021-06-05 09:17:14,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34815 states, 34815 states have (on average 3.112824931782278) internal successors, (108373), 34814 states have internal predecessors, (108373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34815 states to 34815 states and 108373 transitions. [2021-06-05 09:17:14,724 INFO L78 Accepts]: Start accepts. Automaton has 34815 states and 108373 transitions. Word has length 72 [2021-06-05 09:17:14,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:14,725 INFO L482 AbstractCegarLoop]: Abstraction has 34815 states and 108373 transitions. [2021-06-05 09:17:14,725 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:14,725 INFO L276 IsEmpty]: Start isEmpty. Operand 34815 states and 108373 transitions. [2021-06-05 09:17:14,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:14,752 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:14,752 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:14,752 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181 [2021-06-05 09:17:14,752 INFO L430 AbstractCegarLoop]: === Iteration 88 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:14,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:14,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1847173303, now seen corresponding path program 6 times [2021-06-05 09:17:14,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:14,752 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105877016] [2021-06-05 09:17:14,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:14,828 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:14,828 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105877016] [2021-06-05 09:17:14,828 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105877016] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:14,828 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:14,828 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:14,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911175091] [2021-06-05 09:17:14,828 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:14,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:14,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:14,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:14,828 INFO L87 Difference]: Start difference. First operand 34815 states and 108373 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:15,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:15,294 INFO L93 Difference]: Finished difference Result 35722 states and 111125 transitions. [2021-06-05 09:17:15,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 09:17:15,294 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:15,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:15,351 INFO L225 Difference]: With dead ends: 35722 [2021-06-05 09:17:15,351 INFO L226 Difference]: Without dead ends: 35722 [2021-06-05 09:17:15,351 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 126.9ms TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:17:15,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35722 states. [2021-06-05 09:17:16,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35722 to 34723. [2021-06-05 09:17:16,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34723 states, 34723 states have (on average 3.1112231086023674) internal successors, (108031), 34722 states have internal predecessors, (108031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:16,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34723 states to 34723 states and 108031 transitions. [2021-06-05 09:17:16,177 INFO L78 Accepts]: Start accepts. Automaton has 34723 states and 108031 transitions. Word has length 72 [2021-06-05 09:17:16,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:16,178 INFO L482 AbstractCegarLoop]: Abstraction has 34723 states and 108031 transitions. [2021-06-05 09:17:16,178 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:16,178 INFO L276 IsEmpty]: Start isEmpty. Operand 34723 states and 108031 transitions. [2021-06-05 09:17:16,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:16,206 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:16,206 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:16,206 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182 [2021-06-05 09:17:16,206 INFO L430 AbstractCegarLoop]: === Iteration 89 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:16,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:16,207 INFO L82 PathProgramCache]: Analyzing trace with hash 203103855, now seen corresponding path program 7 times [2021-06-05 09:17:16,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:16,207 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317933970] [2021-06-05 09:17:16,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:16,288 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:16,288 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:16,288 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317933970] [2021-06-05 09:17:16,288 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317933970] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:16,288 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:16,288 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:16,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500736161] [2021-06-05 09:17:16,289 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:16,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:16,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:16,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:16,289 INFO L87 Difference]: Start difference. First operand 34723 states and 108031 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:16,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:16,927 INFO L93 Difference]: Finished difference Result 36162 states and 112497 transitions. [2021-06-05 09:17:16,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 09:17:16,927 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:16,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:17,208 INFO L225 Difference]: With dead ends: 36162 [2021-06-05 09:17:17,208 INFO L226 Difference]: Without dead ends: 36162 [2021-06-05 09:17:17,208 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 215.4ms TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2021-06-05 09:17:17,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36162 states. [2021-06-05 09:17:17,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36162 to 34783. [2021-06-05 09:17:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34783 states, 34783 states have (on average 3.1129287295517925) internal successors, (108277), 34782 states have internal predecessors, (108277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34783 states to 34783 states and 108277 transitions. [2021-06-05 09:17:17,801 INFO L78 Accepts]: Start accepts. Automaton has 34783 states and 108277 transitions. Word has length 72 [2021-06-05 09:17:17,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:17,802 INFO L482 AbstractCegarLoop]: Abstraction has 34783 states and 108277 transitions. [2021-06-05 09:17:17,802 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:17,802 INFO L276 IsEmpty]: Start isEmpty. Operand 34783 states and 108277 transitions. [2021-06-05 09:17:17,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:17,829 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:17,829 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:17,829 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183 [2021-06-05 09:17:17,829 INFO L430 AbstractCegarLoop]: === Iteration 90 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:17,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:17,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1103581263, now seen corresponding path program 8 times [2021-06-05 09:17:17,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:17,830 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20721485] [2021-06-05 09:17:17,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:17,905 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:17,905 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:17,905 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20721485] [2021-06-05 09:17:17,905 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20721485] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:17,905 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:17,905 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:17,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876660755] [2021-06-05 09:17:17,906 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:17,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:17,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:17,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:17,906 INFO L87 Difference]: Start difference. First operand 34783 states and 108277 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:18,604 INFO L93 Difference]: Finished difference Result 35467 states and 110432 transitions. [2021-06-05 09:17:18,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 09:17:18,604 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:18,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:18,660 INFO L225 Difference]: With dead ends: 35467 [2021-06-05 09:17:18,660 INFO L226 Difference]: Without dead ends: 35467 [2021-06-05 09:17:18,661 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 156.7ms TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:17:18,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35467 states. [2021-06-05 09:17:19,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35467 to 34771. [2021-06-05 09:17:19,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34771 states, 34771 states have (on average 3.1129677029708667) internal successors, (108241), 34770 states have internal predecessors, (108241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:19,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34771 states to 34771 states and 108241 transitions. [2021-06-05 09:17:19,276 INFO L78 Accepts]: Start accepts. Automaton has 34771 states and 108241 transitions. Word has length 72 [2021-06-05 09:17:19,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:19,276 INFO L482 AbstractCegarLoop]: Abstraction has 34771 states and 108241 transitions. [2021-06-05 09:17:19,276 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:19,276 INFO L276 IsEmpty]: Start isEmpty. Operand 34771 states and 108241 transitions. [2021-06-05 09:17:19,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:19,304 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:19,305 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:19,305 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184 [2021-06-05 09:17:19,305 INFO L430 AbstractCegarLoop]: === Iteration 91 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:19,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:19,305 INFO L82 PathProgramCache]: Analyzing trace with hash 966720273, now seen corresponding path program 9 times [2021-06-05 09:17:19,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:19,305 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794042182] [2021-06-05 09:17:19,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:19,383 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:19,383 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:19,383 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794042182] [2021-06-05 09:17:19,383 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794042182] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:19,383 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:19,383 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:19,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404015491] [2021-06-05 09:17:19,383 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:19,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:19,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:19,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:19,384 INFO L87 Difference]: Start difference. First operand 34771 states and 108241 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:19,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:19,933 INFO L93 Difference]: Finished difference Result 35128 states and 109329 transitions. [2021-06-05 09:17:19,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:17:19,933 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:19,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:19,992 INFO L225 Difference]: With dead ends: 35128 [2021-06-05 09:17:19,993 INFO L226 Difference]: Without dead ends: 35128 [2021-06-05 09:17:19,993 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 93.1ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:17:20,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35128 states. [2021-06-05 09:17:20,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35128 to 34707. [2021-06-05 09:17:20,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34707 states, 34707 states have (on average 3.111274382689371) internal successors, (107983), 34706 states have internal predecessors, (107983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34707 states to 34707 states and 107983 transitions. [2021-06-05 09:17:20,593 INFO L78 Accepts]: Start accepts. Automaton has 34707 states and 107983 transitions. Word has length 72 [2021-06-05 09:17:20,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:20,593 INFO L482 AbstractCegarLoop]: Abstraction has 34707 states and 107983 transitions. [2021-06-05 09:17:20,593 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:20,594 INFO L276 IsEmpty]: Start isEmpty. Operand 34707 states and 107983 transitions. [2021-06-05 09:17:20,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:20,621 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:20,621 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:20,621 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2021-06-05 09:17:20,621 INFO L430 AbstractCegarLoop]: === Iteration 92 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:20,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:20,621 INFO L82 PathProgramCache]: Analyzing trace with hash -263994144, now seen corresponding path program 5 times [2021-06-05 09:17:20,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:20,621 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696892538] [2021-06-05 09:17:20,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:20,708 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:20,709 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:20,709 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696892538] [2021-06-05 09:17:20,709 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696892538] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:20,709 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:20,709 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:20,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642525471] [2021-06-05 09:17:20,709 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:20,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:20,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:20,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:20,710 INFO L87 Difference]: Start difference. First operand 34707 states and 107983 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:21,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:21,377 INFO L93 Difference]: Finished difference Result 36380 states and 113109 transitions. [2021-06-05 09:17:21,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 09:17:21,377 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:21,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:21,432 INFO L225 Difference]: With dead ends: 36380 [2021-06-05 09:17:21,432 INFO L226 Difference]: Without dead ends: 36380 [2021-06-05 09:17:21,432 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 179.9ms TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2021-06-05 09:17:21,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36380 states. [2021-06-05 09:17:21,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36380 to 33987. [2021-06-05 09:17:21,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33987 states, 33987 states have (on average 3.1097478447641747) internal successors, (105691), 33986 states have internal predecessors, (105691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:22,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33987 states to 33987 states and 105691 transitions. [2021-06-05 09:17:22,051 INFO L78 Accepts]: Start accepts. Automaton has 33987 states and 105691 transitions. Word has length 72 [2021-06-05 09:17:22,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:22,051 INFO L482 AbstractCegarLoop]: Abstraction has 33987 states and 105691 transitions. [2021-06-05 09:17:22,051 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:22,051 INFO L276 IsEmpty]: Start isEmpty. Operand 33987 states and 105691 transitions. [2021-06-05 09:17:22,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:22,076 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:22,076 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:22,077 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186 [2021-06-05 09:17:22,077 INFO L430 AbstractCegarLoop]: === Iteration 93 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:22,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:22,077 INFO L82 PathProgramCache]: Analyzing trace with hash -132108706, now seen corresponding path program 6 times [2021-06-05 09:17:22,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:22,077 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049968806] [2021-06-05 09:17:22,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:22,164 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:22,164 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:22,164 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049968806] [2021-06-05 09:17:22,164 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049968806] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:22,164 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:22,164 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:22,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100503154] [2021-06-05 09:17:22,165 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:22,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:22,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:22,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:22,165 INFO L87 Difference]: Start difference. First operand 33987 states and 105691 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:22,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:22,937 INFO L93 Difference]: Finished difference Result 36114 states and 112376 transitions. [2021-06-05 09:17:22,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 09:17:22,938 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:22,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:22,995 INFO L225 Difference]: With dead ends: 36114 [2021-06-05 09:17:22,996 INFO L226 Difference]: Without dead ends: 36114 [2021-06-05 09:17:22,996 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 227.6ms TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2021-06-05 09:17:23,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36114 states. [2021-06-05 09:17:23,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36114 to 34027. [2021-06-05 09:17:23,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34027 states, 34027 states have (on average 3.1105004849090427) internal successors, (105841), 34026 states have internal predecessors, (105841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:23,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34027 states to 34027 states and 105841 transitions. [2021-06-05 09:17:23,604 INFO L78 Accepts]: Start accepts. Automaton has 34027 states and 105841 transitions. Word has length 72 [2021-06-05 09:17:23,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:23,605 INFO L482 AbstractCegarLoop]: Abstraction has 34027 states and 105841 transitions. [2021-06-05 09:17:23,605 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:23,605 INFO L276 IsEmpty]: Start isEmpty. Operand 34027 states and 105841 transitions. [2021-06-05 09:17:23,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:23,631 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:23,631 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:23,631 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187 [2021-06-05 09:17:23,631 INFO L430 AbstractCegarLoop]: === Iteration 94 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:23,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:23,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1707463726, now seen corresponding path program 7 times [2021-06-05 09:17:23,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:23,632 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026978179] [2021-06-05 09:17:23,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:23,902 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:23,902 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:23,902 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026978179] [2021-06-05 09:17:23,902 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026978179] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:23,902 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:23,902 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:23,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419885654] [2021-06-05 09:17:23,902 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:23,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:23,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:23,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:23,903 INFO L87 Difference]: Start difference. First operand 34027 states and 105841 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:24,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:24,372 INFO L93 Difference]: Finished difference Result 34909 states and 108557 transitions. [2021-06-05 09:17:24,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 09:17:24,372 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:24,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:24,428 INFO L225 Difference]: With dead ends: 34909 [2021-06-05 09:17:24,429 INFO L226 Difference]: Without dead ends: 34909 [2021-06-05 09:17:24,429 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 318.7ms TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:17:24,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34909 states. [2021-06-05 09:17:24,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34909 to 33939. [2021-06-05 09:17:24,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33939 states, 33939 states have (on average 3.1097852028639617) internal successors, (105543), 33938 states have internal predecessors, (105543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:25,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33939 states to 33939 states and 105543 transitions. [2021-06-05 09:17:25,045 INFO L78 Accepts]: Start accepts. Automaton has 33939 states and 105543 transitions. Word has length 72 [2021-06-05 09:17:25,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:25,045 INFO L482 AbstractCegarLoop]: Abstraction has 33939 states and 105543 transitions. [2021-06-05 09:17:25,045 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:25,045 INFO L276 IsEmpty]: Start isEmpty. Operand 33939 states and 105543 transitions. [2021-06-05 09:17:25,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:25,071 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:25,071 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:25,071 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2021-06-05 09:17:25,071 INFO L430 AbstractCegarLoop]: === Iteration 95 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:25,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:25,071 INFO L82 PathProgramCache]: Analyzing trace with hash -343602976, now seen corresponding path program 8 times [2021-06-05 09:17:25,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:25,072 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572239690] [2021-06-05 09:17:25,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:25,345 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:25,345 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:25,345 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572239690] [2021-06-05 09:17:25,345 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572239690] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:25,345 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:25,345 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:25,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735844129] [2021-06-05 09:17:25,346 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:25,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:25,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:25,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:25,346 INFO L87 Difference]: Start difference. First operand 33939 states and 105543 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:25,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:25,975 INFO L93 Difference]: Finished difference Result 35770 states and 111333 transitions. [2021-06-05 09:17:25,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 09:17:25,975 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:25,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:26,035 INFO L225 Difference]: With dead ends: 35770 [2021-06-05 09:17:26,035 INFO L226 Difference]: Without dead ends: 35770 [2021-06-05 09:17:26,035 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 195.6ms TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2021-06-05 09:17:26,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35770 states. [2021-06-05 09:17:26,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35770 to 33923. [2021-06-05 09:17:26,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33923 states, 33923 states have (on average 3.1106034254045927) internal successors, (105521), 33922 states have internal predecessors, (105521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:26,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33923 states to 33923 states and 105521 transitions. [2021-06-05 09:17:26,918 INFO L78 Accepts]: Start accepts. Automaton has 33923 states and 105521 transitions. Word has length 72 [2021-06-05 09:17:26,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:26,918 INFO L482 AbstractCegarLoop]: Abstraction has 33923 states and 105521 transitions. [2021-06-05 09:17:26,918 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:26,918 INFO L276 IsEmpty]: Start isEmpty. Operand 33923 states and 105521 transitions. [2021-06-05 09:17:26,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:26,944 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:26,944 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:26,944 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable189 [2021-06-05 09:17:26,944 INFO L430 AbstractCegarLoop]: === Iteration 96 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:26,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:26,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1918957996, now seen corresponding path program 9 times [2021-06-05 09:17:26,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:26,945 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805547074] [2021-06-05 09:17:26,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:27,019 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:27,019 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:27,019 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805547074] [2021-06-05 09:17:27,019 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805547074] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:27,019 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:27,019 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:27,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551248859] [2021-06-05 09:17:27,019 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:27,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:27,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:27,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:27,020 INFO L87 Difference]: Start difference. First operand 33923 states and 105521 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:27,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:27,530 INFO L93 Difference]: Finished difference Result 34764 states and 108163 transitions. [2021-06-05 09:17:27,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 09:17:27,531 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:27,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:27,586 INFO L225 Difference]: With dead ends: 34764 [2021-06-05 09:17:27,586 INFO L226 Difference]: Without dead ends: 34764 [2021-06-05 09:17:27,587 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 157.6ms TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:17:27,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34764 states. [2021-06-05 09:17:28,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34764 to 33911. [2021-06-05 09:17:28,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33911 states, 33911 states have (on average 3.1106425643596474) internal successors, (105485), 33910 states have internal predecessors, (105485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:28,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33911 states to 33911 states and 105485 transitions. [2021-06-05 09:17:28,461 INFO L78 Accepts]: Start accepts. Automaton has 33911 states and 105485 transitions. Word has length 72 [2021-06-05 09:17:28,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:28,461 INFO L482 AbstractCegarLoop]: Abstraction has 33911 states and 105485 transitions. [2021-06-05 09:17:28,461 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:28,461 INFO L276 IsEmpty]: Start isEmpty. Operand 33911 states and 105485 transitions. [2021-06-05 09:17:28,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:28,488 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:28,488 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:28,488 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190 [2021-06-05 09:17:28,488 INFO L430 AbstractCegarLoop]: === Iteration 97 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:28,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:28,489 INFO L82 PathProgramCache]: Analyzing trace with hash 150002592, now seen corresponding path program 10 times [2021-06-05 09:17:28,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:28,489 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241931348] [2021-06-05 09:17:28,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:28,581 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:28,581 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:28,581 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241931348] [2021-06-05 09:17:28,581 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241931348] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:28,581 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:28,581 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:28,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962346276] [2021-06-05 09:17:28,582 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:28,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:28,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:28,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:28,582 INFO L87 Difference]: Start difference. First operand 33911 states and 105485 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:28,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:28,958 INFO L93 Difference]: Finished difference Result 34443 states and 107138 transitions. [2021-06-05 09:17:28,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:17:28,958 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:28,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:29,013 INFO L225 Difference]: With dead ends: 34443 [2021-06-05 09:17:29,014 INFO L226 Difference]: Without dead ends: 34443 [2021-06-05 09:17:29,014 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 107.4ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:17:29,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34443 states. [2021-06-05 09:17:29,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34443 to 33883. [2021-06-05 09:17:29,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33883 states, 33883 states have (on average 3.109848596641384) internal successors, (105371), 33882 states have internal predecessors, (105371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:29,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33883 states to 33883 states and 105371 transitions. [2021-06-05 09:17:29,975 INFO L78 Accepts]: Start accepts. Automaton has 33883 states and 105371 transitions. Word has length 72 [2021-06-05 09:17:29,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:29,975 INFO L482 AbstractCegarLoop]: Abstraction has 33883 states and 105371 transitions. [2021-06-05 09:17:29,975 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:29,975 INFO L276 IsEmpty]: Start isEmpty. Operand 33883 states and 105371 transitions. [2021-06-05 09:17:30,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:30,004 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:30,005 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:30,005 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191 [2021-06-05 09:17:30,005 INFO L430 AbstractCegarLoop]: === Iteration 98 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:30,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:30,005 INFO L82 PathProgramCache]: Analyzing trace with hash 645133615, now seen corresponding path program 1 times [2021-06-05 09:17:30,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:30,005 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518265270] [2021-06-05 09:17:30,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:30,086 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:30,086 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:30,086 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518265270] [2021-06-05 09:17:30,086 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518265270] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:30,086 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:30,086 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:30,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604628792] [2021-06-05 09:17:30,086 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:30,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:30,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:30,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:30,087 INFO L87 Difference]: Start difference. First operand 33883 states and 105371 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:30,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:30,498 INFO L93 Difference]: Finished difference Result 34295 states and 106684 transitions. [2021-06-05 09:17:30,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:17:30,499 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:30,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:30,555 INFO L225 Difference]: With dead ends: 34295 [2021-06-05 09:17:30,555 INFO L226 Difference]: Without dead ends: 34295 [2021-06-05 09:17:30,555 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 93.7ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:17:30,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34295 states. [2021-06-05 09:17:31,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34295 to 33947. [2021-06-05 09:17:31,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33947 states, 33947 states have (on average 3.1098182460894925) internal successors, (105569), 33946 states have internal predecessors, (105569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:31,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33947 states to 33947 states and 105569 transitions. [2021-06-05 09:17:31,474 INFO L78 Accepts]: Start accepts. Automaton has 33947 states and 105569 transitions. Word has length 72 [2021-06-05 09:17:31,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:31,474 INFO L482 AbstractCegarLoop]: Abstraction has 33947 states and 105569 transitions. [2021-06-05 09:17:31,474 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:31,474 INFO L276 IsEmpty]: Start isEmpty. Operand 33947 states and 105569 transitions. [2021-06-05 09:17:31,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:31,506 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:31,506 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:31,506 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192 [2021-06-05 09:17:31,507 INFO L430 AbstractCegarLoop]: === Iteration 99 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:31,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:31,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1658132649, now seen corresponding path program 2 times [2021-06-05 09:17:31,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:31,507 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937297533] [2021-06-05 09:17:31,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:31,587 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:31,587 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:31,587 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937297533] [2021-06-05 09:17:31,587 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937297533] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:31,587 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:31,587 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:31,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238024285] [2021-06-05 09:17:31,587 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:31,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:31,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:31,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:31,588 INFO L87 Difference]: Start difference. First operand 33947 states and 105569 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:32,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:32,101 INFO L93 Difference]: Finished difference Result 34635 states and 107740 transitions. [2021-06-05 09:17:32,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 09:17:32,101 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:32,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:32,155 INFO L225 Difference]: With dead ends: 34635 [2021-06-05 09:17:32,155 INFO L226 Difference]: Without dead ends: 34635 [2021-06-05 09:17:32,155 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 155.4ms TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:17:32,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34635 states. [2021-06-05 09:17:32,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34635 to 33959. [2021-06-05 09:17:32,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33959 states, 33959 states have (on average 3.109779439912836) internal successors, (105605), 33958 states have internal predecessors, (105605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:33,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33959 states to 33959 states and 105605 transitions. [2021-06-05 09:17:33,086 INFO L78 Accepts]: Start accepts. Automaton has 33959 states and 105605 transitions. Word has length 72 [2021-06-05 09:17:33,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:33,086 INFO L482 AbstractCegarLoop]: Abstraction has 33959 states and 105605 transitions. [2021-06-05 09:17:33,086 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:33,086 INFO L276 IsEmpty]: Start isEmpty. Operand 33959 states and 105605 transitions. [2021-06-05 09:17:33,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:33,114 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:33,114 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:33,114 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable193 [2021-06-05 09:17:33,114 INFO L430 AbstractCegarLoop]: === Iteration 100 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:33,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:33,114 INFO L82 PathProgramCache]: Analyzing trace with hash 227074601, now seen corresponding path program 3 times [2021-06-05 09:17:33,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:33,115 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139492129] [2021-06-05 09:17:33,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:33,195 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:33,195 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:33,195 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139492129] [2021-06-05 09:17:33,195 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139492129] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:33,195 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:33,196 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:33,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785349346] [2021-06-05 09:17:33,196 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:33,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:33,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:33,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:33,196 INFO L87 Difference]: Start difference. First operand 33959 states and 105605 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:33,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:33,804 INFO L93 Difference]: Finished difference Result 34882 states and 108422 transitions. [2021-06-05 09:17:33,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 09:17:33,804 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:33,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:33,861 INFO L225 Difference]: With dead ends: 34882 [2021-06-05 09:17:33,862 INFO L226 Difference]: Without dead ends: 34882 [2021-06-05 09:17:33,862 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 213.3ms TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2021-06-05 09:17:34,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34882 states. [2021-06-05 09:17:34,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34882 to 33899. [2021-06-05 09:17:34,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33899 states, 33899 states have (on average 3.1097967491666423) internal successors, (105419), 33898 states have internal predecessors, (105419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:34,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33899 states to 33899 states and 105419 transitions. [2021-06-05 09:17:34,785 INFO L78 Accepts]: Start accepts. Automaton has 33899 states and 105419 transitions. Word has length 72 [2021-06-05 09:17:34,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:34,785 INFO L482 AbstractCegarLoop]: Abstraction has 33899 states and 105419 transitions. [2021-06-05 09:17:34,785 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:34,785 INFO L276 IsEmpty]: Start isEmpty. Operand 33899 states and 105419 transitions. [2021-06-05 09:17:34,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:34,811 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:34,811 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:34,812 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable194 [2021-06-05 09:17:34,812 INFO L430 AbstractCegarLoop]: === Iteration 101 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:34,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:34,813 INFO L82 PathProgramCache]: Analyzing trace with hash 361289047, now seen corresponding path program 4 times [2021-06-05 09:17:34,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:34,813 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51438142] [2021-06-05 09:17:34,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:34,896 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:34,896 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:34,896 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51438142] [2021-06-05 09:17:34,896 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51438142] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:34,896 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:34,897 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:34,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280975161] [2021-06-05 09:17:34,897 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:34,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:34,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:34,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:34,897 INFO L87 Difference]: Start difference. First operand 33899 states and 105419 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:35,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:35,391 INFO L93 Difference]: Finished difference Result 34792 states and 108184 transitions. [2021-06-05 09:17:35,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 09:17:35,392 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:35,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:35,454 INFO L225 Difference]: With dead ends: 34792 [2021-06-05 09:17:35,454 INFO L226 Difference]: Without dead ends: 34792 [2021-06-05 09:17:35,454 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 133.9ms TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:17:35,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34792 states. [2021-06-05 09:17:35,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34792 to 33991. [2021-06-05 09:17:36,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33991 states, 33991 states have (on average 3.109676090729899) internal successors, (105701), 33990 states have internal predecessors, (105701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:36,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33991 states to 33991 states and 105701 transitions. [2021-06-05 09:17:36,476 INFO L78 Accepts]: Start accepts. Automaton has 33991 states and 105701 transitions. Word has length 72 [2021-06-05 09:17:36,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:36,476 INFO L482 AbstractCegarLoop]: Abstraction has 33991 states and 105701 transitions. [2021-06-05 09:17:36,477 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:36,477 INFO L276 IsEmpty]: Start isEmpty. Operand 33991 states and 105701 transitions. [2021-06-05 09:17:36,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:36,506 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:36,506 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:36,506 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195 [2021-06-05 09:17:36,506 INFO L430 AbstractCegarLoop]: === Iteration 102 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:36,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:36,506 INFO L82 PathProgramCache]: Analyzing trace with hash -2048470999, now seen corresponding path program 5 times [2021-06-05 09:17:36,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:36,507 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065524297] [2021-06-05 09:17:36,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:36,582 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:36,582 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:36,582 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065524297] [2021-06-05 09:17:36,583 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065524297] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:36,583 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:36,583 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:36,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726432313] [2021-06-05 09:17:36,583 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:36,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:36,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:36,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:36,584 INFO L87 Difference]: Start difference. First operand 33991 states and 105701 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:37,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:37,260 INFO L93 Difference]: Finished difference Result 35296 states and 109667 transitions. [2021-06-05 09:17:37,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 09:17:37,261 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:37,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:37,320 INFO L225 Difference]: With dead ends: 35296 [2021-06-05 09:17:37,320 INFO L226 Difference]: Without dead ends: 35296 [2021-06-05 09:17:37,321 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 241.4ms TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2021-06-05 09:17:37,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35296 states. [2021-06-05 09:17:38,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35296 to 33915. [2021-06-05 09:17:38,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33915 states, 33915 states have (on average 3.1097449506118235) internal successors, (105467), 33914 states have internal predecessors, (105467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:38,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33915 states to 33915 states and 105467 transitions. [2021-06-05 09:17:38,250 INFO L78 Accepts]: Start accepts. Automaton has 33915 states and 105467 transitions. Word has length 72 [2021-06-05 09:17:38,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:38,250 INFO L482 AbstractCegarLoop]: Abstraction has 33915 states and 105467 transitions. [2021-06-05 09:17:38,250 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:38,250 INFO L276 IsEmpty]: Start isEmpty. Operand 33915 states and 105467 transitions. [2021-06-05 09:17:38,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:38,277 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:38,277 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:38,277 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196 [2021-06-05 09:17:38,277 INFO L430 AbstractCegarLoop]: === Iteration 103 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:38,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:38,277 INFO L82 PathProgramCache]: Analyzing trace with hash -2139402301, now seen corresponding path program 6 times [2021-06-05 09:17:38,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:38,277 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839031867] [2021-06-05 09:17:38,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:38,360 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:38,360 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:38,360 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839031867] [2021-06-05 09:17:38,360 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839031867] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:38,360 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:38,360 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:38,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498336962] [2021-06-05 09:17:38,361 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:38,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:38,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:38,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:38,361 INFO L87 Difference]: Start difference. First operand 33915 states and 105467 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:38,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:38,880 INFO L93 Difference]: Finished difference Result 35350 states and 109798 transitions. [2021-06-05 09:17:38,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 09:17:38,881 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:38,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:38,936 INFO L225 Difference]: With dead ends: 35350 [2021-06-05 09:17:38,936 INFO L226 Difference]: Without dead ends: 35350 [2021-06-05 09:17:38,936 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 190.5ms TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2021-06-05 09:17:39,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35350 states. [2021-06-05 09:17:39,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35350 to 33915. [2021-06-05 09:17:39,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33915 states, 33915 states have (on average 3.1097449506118235) internal successors, (105467), 33914 states have internal predecessors, (105467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:39,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33915 states to 33915 states and 105467 transitions. [2021-06-05 09:17:39,906 INFO L78 Accepts]: Start accepts. Automaton has 33915 states and 105467 transitions. Word has length 72 [2021-06-05 09:17:39,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:39,906 INFO L482 AbstractCegarLoop]: Abstraction has 33915 states and 105467 transitions. [2021-06-05 09:17:39,906 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:39,906 INFO L276 IsEmpty]: Start isEmpty. Operand 33915 states and 105467 transitions. [2021-06-05 09:17:39,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:39,933 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:39,933 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:39,933 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable197 [2021-06-05 09:17:39,933 INFO L430 AbstractCegarLoop]: === Iteration 104 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:39,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:39,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1156314689, now seen corresponding path program 7 times [2021-06-05 09:17:39,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:39,933 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944879846] [2021-06-05 09:17:39,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:40,015 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:40,016 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:40,016 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944879846] [2021-06-05 09:17:40,016 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944879846] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:40,016 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:40,016 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:40,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239284276] [2021-06-05 09:17:40,016 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:40,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:40,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:40,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:40,017 INFO L87 Difference]: Start difference. First operand 33915 states and 105467 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:40,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:40,397 INFO L93 Difference]: Finished difference Result 34742 states and 108082 transitions. [2021-06-05 09:17:40,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:17:40,398 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:40,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:40,453 INFO L225 Difference]: With dead ends: 34742 [2021-06-05 09:17:40,453 INFO L226 Difference]: Without dead ends: 34742 [2021-06-05 09:17:40,454 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 99.4ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:17:40,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34742 states. [2021-06-05 09:17:40,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34742 to 33985. [2021-06-05 09:17:40,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33985 states, 33985 states have (on average 3.1102250993085185) internal successors, (105701), 33984 states have internal predecessors, (105701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:41,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33985 states to 33985 states and 105701 transitions. [2021-06-05 09:17:41,410 INFO L78 Accepts]: Start accepts. Automaton has 33985 states and 105701 transitions. Word has length 72 [2021-06-05 09:17:41,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:41,410 INFO L482 AbstractCegarLoop]: Abstraction has 33985 states and 105701 transitions. [2021-06-05 09:17:41,410 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:41,411 INFO L276 IsEmpty]: Start isEmpty. Operand 33985 states and 105701 transitions. [2021-06-05 09:17:41,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:41,443 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:41,443 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:41,443 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable198 [2021-06-05 09:17:41,443 INFO L430 AbstractCegarLoop]: === Iteration 105 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:41,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:41,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1341106201, now seen corresponding path program 8 times [2021-06-05 09:17:41,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:41,444 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956817701] [2021-06-05 09:17:41,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:41,540 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:41,540 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:41,540 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956817701] [2021-06-05 09:17:41,540 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956817701] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:41,540 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:41,541 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:41,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342962725] [2021-06-05 09:17:41,541 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:41,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:41,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:41,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:41,541 INFO L87 Difference]: Start difference. First operand 33985 states and 105701 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:42,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:42,087 INFO L93 Difference]: Finished difference Result 35188 states and 109503 transitions. [2021-06-05 09:17:42,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 09:17:42,088 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:42,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:42,147 INFO L225 Difference]: With dead ends: 35188 [2021-06-05 09:17:42,147 INFO L226 Difference]: Without dead ends: 35188 [2021-06-05 09:17:42,147 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 176.2ms TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:17:42,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35188 states. [2021-06-05 09:17:42,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35188 to 34012. [2021-06-05 09:17:42,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34012 states, 34012 states have (on average 3.110137598494649) internal successors, (105782), 34011 states have internal predecessors, (105782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:42,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34012 states to 34012 states and 105782 transitions. [2021-06-05 09:17:42,780 INFO L78 Accepts]: Start accepts. Automaton has 34012 states and 105782 transitions. Word has length 72 [2021-06-05 09:17:42,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:42,780 INFO L482 AbstractCegarLoop]: Abstraction has 34012 states and 105782 transitions. [2021-06-05 09:17:42,780 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:42,780 INFO L276 IsEmpty]: Start isEmpty. Operand 34012 states and 105782 transitions. [2021-06-05 09:17:42,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:42,807 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:42,807 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:42,807 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable199 [2021-06-05 09:17:42,807 INFO L430 AbstractCegarLoop]: === Iteration 106 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:42,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:42,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1361519615, now seen corresponding path program 9 times [2021-06-05 09:17:42,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:42,808 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895856833] [2021-06-05 09:17:42,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:43,135 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:43,135 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:43,135 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895856833] [2021-06-05 09:17:43,135 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895856833] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:43,135 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:43,135 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:43,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876109550] [2021-06-05 09:17:43,136 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:43,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:43,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:43,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:43,136 INFO L87 Difference]: Start difference. First operand 34012 states and 105782 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:43,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:43,831 INFO L93 Difference]: Finished difference Result 35588 states and 110653 transitions. [2021-06-05 09:17:43,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 09:17:43,832 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:43,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:43,892 INFO L225 Difference]: With dead ends: 35588 [2021-06-05 09:17:43,892 INFO L226 Difference]: Without dead ends: 35588 [2021-06-05 09:17:43,892 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 213.5ms TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2021-06-05 09:17:44,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35588 states. [2021-06-05 09:17:44,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35588 to 34063. [2021-06-05 09:17:44,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34063 states, 34063 states have (on average 3.1104130581569445) internal successors, (105950), 34062 states have internal predecessors, (105950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34063 states to 34063 states and 105950 transitions. [2021-06-05 09:17:44,526 INFO L78 Accepts]: Start accepts. Automaton has 34063 states and 105950 transitions. Word has length 72 [2021-06-05 09:17:44,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:44,526 INFO L482 AbstractCegarLoop]: Abstraction has 34063 states and 105950 transitions. [2021-06-05 09:17:44,526 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:44,526 INFO L276 IsEmpty]: Start isEmpty. Operand 34063 states and 105950 transitions. [2021-06-05 09:17:44,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:44,742 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:44,743 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:44,743 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable200 [2021-06-05 09:17:44,743 INFO L430 AbstractCegarLoop]: === Iteration 107 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:44,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:44,743 INFO L82 PathProgramCache]: Analyzing trace with hash 735159583, now seen corresponding path program 10 times [2021-06-05 09:17:44,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:44,743 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567426363] [2021-06-05 09:17:44,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:44,819 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:44,820 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:44,820 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567426363] [2021-06-05 09:17:44,820 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567426363] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:44,820 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:44,820 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:44,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608820198] [2021-06-05 09:17:44,820 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:44,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:44,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:44,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:44,821 INFO L87 Difference]: Start difference. First operand 34063 states and 105950 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:45,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:45,310 INFO L93 Difference]: Finished difference Result 35234 states and 109622 transitions. [2021-06-05 09:17:45,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 09:17:45,310 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:45,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:45,370 INFO L225 Difference]: With dead ends: 35234 [2021-06-05 09:17:45,370 INFO L226 Difference]: Without dead ends: 35234 [2021-06-05 09:17:45,370 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 126.7ms TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:17:45,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35234 states. [2021-06-05 09:17:45,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35234 to 34180. [2021-06-05 09:17:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34180 states, 34180 states have (on average 3.110737273259216) internal successors, (106325), 34179 states have internal predecessors, (106325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:46,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34180 states to 34180 states and 106325 transitions. [2021-06-05 09:17:46,000 INFO L78 Accepts]: Start accepts. Automaton has 34180 states and 106325 transitions. Word has length 72 [2021-06-05 09:17:46,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:46,001 INFO L482 AbstractCegarLoop]: Abstraction has 34180 states and 106325 transitions. [2021-06-05 09:17:46,001 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:46,001 INFO L276 IsEmpty]: Start isEmpty. Operand 34180 states and 106325 transitions. [2021-06-05 09:17:46,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:46,027 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:46,027 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:46,027 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable201 [2021-06-05 09:17:46,027 INFO L430 AbstractCegarLoop]: === Iteration 108 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:46,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:46,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1654187049, now seen corresponding path program 11 times [2021-06-05 09:17:46,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:46,027 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286811803] [2021-06-05 09:17:46,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:46,272 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:46,272 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:46,272 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286811803] [2021-06-05 09:17:46,272 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286811803] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:46,272 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:46,272 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 09:17:46,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754927388] [2021-06-05 09:17:46,272 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 09:17:46,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:46,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 09:17:46,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 09:17:46,273 INFO L87 Difference]: Start difference. First operand 34180 states and 106325 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:46,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:46,910 INFO L93 Difference]: Finished difference Result 52530 states and 162963 transitions. [2021-06-05 09:17:46,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 09:17:46,910 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:46,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:47,008 INFO L225 Difference]: With dead ends: 52530 [2021-06-05 09:17:47,008 INFO L226 Difference]: Without dead ends: 52530 [2021-06-05 09:17:47,008 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 277.2ms TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:17:47,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52530 states. [2021-06-05 09:17:47,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52530 to 35001. [2021-06-05 09:17:47,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35001 states, 35001 states have (on average 3.117196651524242) internal successors, (109105), 35000 states have internal predecessors, (109105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35001 states to 35001 states and 109105 transitions. [2021-06-05 09:17:48,058 INFO L78 Accepts]: Start accepts. Automaton has 35001 states and 109105 transitions. Word has length 72 [2021-06-05 09:17:48,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:48,058 INFO L482 AbstractCegarLoop]: Abstraction has 35001 states and 109105 transitions. [2021-06-05 09:17:48,058 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:48,058 INFO L276 IsEmpty]: Start isEmpty. Operand 35001 states and 109105 transitions. [2021-06-05 09:17:48,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:48,083 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:48,083 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:48,083 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable202 [2021-06-05 09:17:48,083 INFO L430 AbstractCegarLoop]: === Iteration 109 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:48,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:48,083 INFO L82 PathProgramCache]: Analyzing trace with hash 714746169, now seen corresponding path program 12 times [2021-06-05 09:17:48,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:48,084 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617930477] [2021-06-05 09:17:48,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:48,167 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:48,167 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:48,168 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617930477] [2021-06-05 09:17:48,168 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617930477] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:48,168 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:48,168 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:48,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335604018] [2021-06-05 09:17:48,168 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:48,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:48,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:48,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:48,168 INFO L87 Difference]: Start difference. First operand 35001 states and 109105 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:48,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:48,918 INFO L93 Difference]: Finished difference Result 36839 states and 114816 transitions. [2021-06-05 09:17:48,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 09:17:48,918 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:48,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:48,977 INFO L225 Difference]: With dead ends: 36839 [2021-06-05 09:17:48,977 INFO L226 Difference]: Without dead ends: 36839 [2021-06-05 09:17:48,978 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 267.4ms TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2021-06-05 09:17:49,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36839 states. [2021-06-05 09:17:49,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36839 to 34894. [2021-06-05 09:17:49,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34894 states, 34894 states have (on average 3.116696280162779) internal successors, (108754), 34893 states have internal predecessors, (108754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:49,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34894 states to 34894 states and 108754 transitions. [2021-06-05 09:17:49,884 INFO L78 Accepts]: Start accepts. Automaton has 34894 states and 108754 transitions. Word has length 72 [2021-06-05 09:17:49,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:49,884 INFO L482 AbstractCegarLoop]: Abstraction has 34894 states and 108754 transitions. [2021-06-05 09:17:49,884 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:49,884 INFO L276 IsEmpty]: Start isEmpty. Operand 34894 states and 108754 transitions. [2021-06-05 09:17:49,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:49,909 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:49,910 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:49,910 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable203 [2021-06-05 09:17:49,910 INFO L430 AbstractCegarLoop]: === Iteration 110 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:49,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:49,910 INFO L82 PathProgramCache]: Analyzing trace with hash 33726419, now seen corresponding path program 13 times [2021-06-05 09:17:49,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:49,910 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358511573] [2021-06-05 09:17:49,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:50,002 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:50,002 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:50,002 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358511573] [2021-06-05 09:17:50,002 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358511573] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:50,002 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:50,002 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:50,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468930356] [2021-06-05 09:17:50,003 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:50,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:50,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:50,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:50,003 INFO L87 Difference]: Start difference. First operand 34894 states and 108754 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:50,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:50,672 INFO L93 Difference]: Finished difference Result 36689 states and 114256 transitions. [2021-06-05 09:17:50,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 09:17:50,673 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:50,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:50,736 INFO L225 Difference]: With dead ends: 36689 [2021-06-05 09:17:50,736 INFO L226 Difference]: Without dead ends: 36689 [2021-06-05 09:17:50,737 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 222.6ms TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2021-06-05 09:17:50,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36689 states. [2021-06-05 09:17:51,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36689 to 35050. [2021-06-05 09:17:51,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35050 states, 35050 states have (on average 3.1166904422253925) internal successors, (109240), 35049 states have internal predecessors, (109240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:51,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35050 states to 35050 states and 109240 transitions. [2021-06-05 09:17:51,675 INFO L78 Accepts]: Start accepts. Automaton has 35050 states and 109240 transitions. Word has length 72 [2021-06-05 09:17:51,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:51,675 INFO L482 AbstractCegarLoop]: Abstraction has 35050 states and 109240 transitions. [2021-06-05 09:17:51,675 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:51,676 INFO L276 IsEmpty]: Start isEmpty. Operand 35050 states and 109240 transitions. [2021-06-05 09:17:51,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:51,703 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:51,703 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:51,703 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable204 [2021-06-05 09:17:51,703 INFO L430 AbstractCegarLoop]: === Iteration 111 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:51,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:51,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1694110399, now seen corresponding path program 14 times [2021-06-05 09:17:51,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:51,704 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257194054] [2021-06-05 09:17:51,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:51,782 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:51,782 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:51,782 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257194054] [2021-06-05 09:17:51,782 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257194054] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:51,782 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:51,782 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:51,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703918722] [2021-06-05 09:17:51,782 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:51,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:51,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:51,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:51,783 INFO L87 Difference]: Start difference. First operand 35050 states and 109240 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:52,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:52,234 INFO L93 Difference]: Finished difference Result 36130 states and 112651 transitions. [2021-06-05 09:17:52,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 09:17:52,234 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:52,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:52,293 INFO L225 Difference]: With dead ends: 36130 [2021-06-05 09:17:52,293 INFO L226 Difference]: Without dead ends: 36130 [2021-06-05 09:17:52,294 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 137.4ms TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:17:52,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36130 states. [2021-06-05 09:17:52,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36130 to 35116. [2021-06-05 09:17:52,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35116 states, 35116 states have (on average 3.117325435698827) internal successors, (109468), 35115 states have internal predecessors, (109468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:53,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35116 states to 35116 states and 109468 transitions. [2021-06-05 09:17:53,296 INFO L78 Accepts]: Start accepts. Automaton has 35116 states and 109468 transitions. Word has length 72 [2021-06-05 09:17:53,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:53,296 INFO L482 AbstractCegarLoop]: Abstraction has 35116 states and 109468 transitions. [2021-06-05 09:17:53,296 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:53,296 INFO L276 IsEmpty]: Start isEmpty. Operand 35116 states and 109468 transitions. [2021-06-05 09:17:53,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:53,322 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:53,322 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:53,322 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable205 [2021-06-05 09:17:53,323 INFO L430 AbstractCegarLoop]: === Iteration 112 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:53,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:53,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1673696985, now seen corresponding path program 15 times [2021-06-05 09:17:53,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:53,323 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913654805] [2021-06-05 09:17:53,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:53,399 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:53,399 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:53,399 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913654805] [2021-06-05 09:17:53,399 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913654805] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:53,399 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:53,400 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:53,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545056711] [2021-06-05 09:17:53,400 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:53,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:53,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:53,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:53,400 INFO L87 Difference]: Start difference. First operand 35116 states and 109468 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:54,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:54,058 INFO L93 Difference]: Finished difference Result 36904 states and 115024 transitions. [2021-06-05 09:17:54,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 09:17:54,059 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:54,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:54,121 INFO L225 Difference]: With dead ends: 36904 [2021-06-05 09:17:54,121 INFO L226 Difference]: Without dead ends: 36904 [2021-06-05 09:17:54,121 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 230.0ms TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2021-06-05 09:17:54,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36904 states. [2021-06-05 09:17:54,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36904 to 35009. [2021-06-05 09:17:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35009 states, 35009 states have (on average 3.116827101602445) internal successors, (109117), 35008 states have internal predecessors, (109117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:55,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35009 states to 35009 states and 109117 transitions. [2021-06-05 09:17:55,097 INFO L78 Accepts]: Start accepts. Automaton has 35009 states and 109117 transitions. Word has length 72 [2021-06-05 09:17:55,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:55,097 INFO L482 AbstractCegarLoop]: Abstraction has 35009 states and 109117 transitions. [2021-06-05 09:17:55,097 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:55,097 INFO L276 IsEmpty]: Start isEmpty. Operand 35009 states and 109117 transitions. [2021-06-05 09:17:55,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:55,124 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:55,124 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:55,125 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable206 [2021-06-05 09:17:55,125 INFO L430 AbstractCegarLoop]: === Iteration 113 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:55,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:55,125 INFO L82 PathProgramCache]: Analyzing trace with hash 810806955, now seen corresponding path program 16 times [2021-06-05 09:17:55,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:55,125 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301906762] [2021-06-05 09:17:55,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:55,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:55,207 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:55,207 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:55,207 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301906762] [2021-06-05 09:17:55,207 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301906762] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:55,208 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:55,208 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:55,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293172194] [2021-06-05 09:17:55,208 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:55,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:55,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:55,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:55,208 INFO L87 Difference]: Start difference. First operand 35009 states and 109117 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:55,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:55,785 INFO L93 Difference]: Finished difference Result 36614 states and 114020 transitions. [2021-06-05 09:17:55,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 09:17:55,785 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:55,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:55,850 INFO L225 Difference]: With dead ends: 36614 [2021-06-05 09:17:55,850 INFO L226 Difference]: Without dead ends: 36614 [2021-06-05 09:17:55,850 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 189.1ms TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-06-05 09:17:55,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36614 states. [2021-06-05 09:17:56,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36614 to 34989. [2021-06-05 09:17:56,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34989 states, 34989 states have (on average 3.1168938809340077) internal successors, (109057), 34988 states have internal predecessors, (109057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:56,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34989 states to 34989 states and 109057 transitions. [2021-06-05 09:17:56,846 INFO L78 Accepts]: Start accepts. Automaton has 34989 states and 109057 transitions. Word has length 72 [2021-06-05 09:17:56,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:56,846 INFO L482 AbstractCegarLoop]: Abstraction has 34989 states and 109057 transitions. [2021-06-05 09:17:56,846 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:56,846 INFO L276 IsEmpty]: Start isEmpty. Operand 34989 states and 109057 transitions. [2021-06-05 09:17:56,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:56,876 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:56,876 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:56,876 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207 [2021-06-05 09:17:56,876 INFO L430 AbstractCegarLoop]: === Iteration 114 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:56,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:56,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1287207739, now seen corresponding path program 17 times [2021-06-05 09:17:56,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:56,876 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3451918] [2021-06-05 09:17:56,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:56,952 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:56,952 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3451918] [2021-06-05 09:17:56,952 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3451918] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:56,952 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:56,952 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:56,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980073845] [2021-06-05 09:17:56,953 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:56,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:56,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:56,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:56,953 INFO L87 Difference]: Start difference. First operand 34989 states and 109057 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:57,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:57,409 INFO L93 Difference]: Finished difference Result 35899 states and 111883 transitions. [2021-06-05 09:17:57,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 09:17:57,409 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:57,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:57,470 INFO L225 Difference]: With dead ends: 35899 [2021-06-05 09:17:57,470 INFO L226 Difference]: Without dead ends: 35899 [2021-06-05 09:17:57,471 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 136.0ms TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:17:57,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35899 states. [2021-06-05 09:17:58,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35899 to 35049. [2021-06-05 09:17:58,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35049 states, 35049 states have (on average 3.116864960483894) internal successors, (109243), 35048 states have internal predecessors, (109243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:58,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35049 states to 35049 states and 109243 transitions. [2021-06-05 09:17:58,120 INFO L78 Accepts]: Start accepts. Automaton has 35049 states and 109243 transitions. Word has length 72 [2021-06-05 09:17:58,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:58,120 INFO L482 AbstractCegarLoop]: Abstraction has 35049 states and 109243 transitions. [2021-06-05 09:17:58,120 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:58,120 INFO L276 IsEmpty]: Start isEmpty. Operand 35049 states and 109243 transitions. [2021-06-05 09:17:58,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:17:58,434 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:17:58,434 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:17:58,435 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable208 [2021-06-05 09:17:58,435 INFO L430 AbstractCegarLoop]: === Iteration 115 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:17:58,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:17:58,435 INFO L82 PathProgramCache]: Analyzing trace with hash -108152623, now seen corresponding path program 18 times [2021-06-05 09:17:58,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:17:58,435 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696216341] [2021-06-05 09:17:58,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:17:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:17:58,527 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:17:58,527 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:17:58,527 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696216341] [2021-06-05 09:17:58,527 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696216341] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:17:58,527 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:17:58,527 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:17:58,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145671016] [2021-06-05 09:17:58,528 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:17:58,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:17:58,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:17:58,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:17:58,528 INFO L87 Difference]: Start difference. First operand 35049 states and 109243 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:59,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:17:59,270 INFO L93 Difference]: Finished difference Result 36394 states and 113333 transitions. [2021-06-05 09:17:59,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 09:17:59,270 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:17:59,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:17:59,332 INFO L225 Difference]: With dead ends: 36394 [2021-06-05 09:17:59,333 INFO L226 Difference]: Without dead ends: 36394 [2021-06-05 09:17:59,333 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 278.3ms TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2021-06-05 09:17:59,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36394 states. [2021-06-05 09:17:59,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36394 to 34973. [2021-06-05 09:17:59,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34973 states, 34973 states have (on average 3.1169473593915304) internal successors, (109009), 34972 states have internal predecessors, (109009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:59,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34973 states to 34973 states and 109009 transitions. [2021-06-05 09:17:59,985 INFO L78 Accepts]: Start accepts. Automaton has 34973 states and 109009 transitions. Word has length 72 [2021-06-05 09:17:59,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:17:59,985 INFO L482 AbstractCegarLoop]: Abstraction has 34973 states and 109009 transitions. [2021-06-05 09:17:59,985 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:17:59,986 INFO L276 IsEmpty]: Start isEmpty. Operand 34973 states and 109009 transitions. [2021-06-05 09:18:00,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:18:00,219 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:18:00,219 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:18:00,219 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable209 [2021-06-05 09:18:00,219 INFO L430 AbstractCegarLoop]: === Iteration 116 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:18:00,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:18:00,220 INFO L82 PathProgramCache]: Analyzing trace with hash 345119915, now seen corresponding path program 19 times [2021-06-05 09:18:00,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:18:00,220 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055118307] [2021-06-05 09:18:00,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:18:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:18:00,293 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:18:00,293 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:18:00,293 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055118307] [2021-06-05 09:18:00,294 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055118307] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:18:00,294 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:18:00,294 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:18:00,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753239038] [2021-06-05 09:18:00,294 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:18:00,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:18:00,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:18:00,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:18:00,294 INFO L87 Difference]: Start difference. First operand 34973 states and 109009 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:00,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:18:00,802 INFO L93 Difference]: Finished difference Result 36218 states and 112741 transitions. [2021-06-05 09:18:00,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 09:18:00,802 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:18:00,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:18:00,860 INFO L225 Difference]: With dead ends: 36218 [2021-06-05 09:18:00,860 INFO L226 Difference]: Without dead ends: 36218 [2021-06-05 09:18:00,860 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 172.1ms TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-06-05 09:18:01,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36218 states. [2021-06-05 09:18:01,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36218 to 34717. [2021-06-05 09:18:01,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34717 states, 34717 states have (on average 3.1171184146095574) internal successors, (108217), 34716 states have internal predecessors, (108217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:01,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34717 states to 34717 states and 108217 transitions. [2021-06-05 09:18:01,483 INFO L78 Accepts]: Start accepts. Automaton has 34717 states and 108217 transitions. Word has length 72 [2021-06-05 09:18:01,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:18:01,483 INFO L482 AbstractCegarLoop]: Abstraction has 34717 states and 108217 transitions. [2021-06-05 09:18:01,484 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:01,484 INFO L276 IsEmpty]: Start isEmpty. Operand 34717 states and 108217 transitions. [2021-06-05 09:18:01,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:18:01,509 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:18:01,509 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:18:01,510 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable210 [2021-06-05 09:18:01,510 INFO L430 AbstractCegarLoop]: === Iteration 117 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:18:01,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:18:01,510 INFO L82 PathProgramCache]: Analyzing trace with hash -476186229, now seen corresponding path program 20 times [2021-06-05 09:18:01,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:18:01,510 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718646234] [2021-06-05 09:18:01,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:18:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:18:01,587 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:18:01,587 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:18:01,587 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718646234] [2021-06-05 09:18:01,587 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718646234] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:18:01,587 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:18:01,587 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:18:01,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773257476] [2021-06-05 09:18:01,588 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:18:01,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:18:01,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:18:01,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:18:01,699 INFO L87 Difference]: Start difference. First operand 34717 states and 108217 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:02,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:18:02,164 INFO L93 Difference]: Finished difference Result 36602 states and 113992 transitions. [2021-06-05 09:18:02,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 09:18:02,165 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:18:02,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:18:02,229 INFO L225 Difference]: With dead ends: 36602 [2021-06-05 09:18:02,229 INFO L226 Difference]: Without dead ends: 36602 [2021-06-05 09:18:02,229 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 129.3ms TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:18:02,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36602 states. [2021-06-05 09:18:02,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36602 to 34327. [2021-06-05 09:18:02,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34327 states, 34327 states have (on average 3.1174002971421912) internal successors, (107011), 34326 states have internal predecessors, (107011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:02,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34327 states to 34327 states and 107011 transitions. [2021-06-05 09:18:02,865 INFO L78 Accepts]: Start accepts. Automaton has 34327 states and 107011 transitions. Word has length 72 [2021-06-05 09:18:02,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:18:02,865 INFO L482 AbstractCegarLoop]: Abstraction has 34327 states and 107011 transitions. [2021-06-05 09:18:02,865 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:02,865 INFO L276 IsEmpty]: Start isEmpty. Operand 34327 states and 107011 transitions. [2021-06-05 09:18:02,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:18:02,890 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:18:02,890 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:18:02,890 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable211 [2021-06-05 09:18:02,890 INFO L430 AbstractCegarLoop]: === Iteration 118 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:18:02,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:18:02,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1558177001, now seen corresponding path program 1 times [2021-06-05 09:18:02,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:18:02,890 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533435574] [2021-06-05 09:18:02,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:18:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:18:02,981 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:18:02,981 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:18:02,981 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533435574] [2021-06-05 09:18:02,981 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533435574] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:18:02,981 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:18:02,981 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:18:02,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116742672] [2021-06-05 09:18:02,982 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:18:02,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:18:02,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:18:02,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:18:02,982 INFO L87 Difference]: Start difference. First operand 34327 states and 107011 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:03,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:18:03,772 INFO L93 Difference]: Finished difference Result 35814 states and 111685 transitions. [2021-06-05 09:18:03,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 09:18:03,772 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:18:03,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:18:03,833 INFO L225 Difference]: With dead ends: 35814 [2021-06-05 09:18:03,833 INFO L226 Difference]: Without dead ends: 35814 [2021-06-05 09:18:03,833 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 214.6ms TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2021-06-05 09:18:03,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35814 states. [2021-06-05 09:18:04,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35814 to 34547. [2021-06-05 09:18:04,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34547 states, 34547 states have (on average 3.119026254088633) internal successors, (107753), 34546 states have internal predecessors, (107753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34547 states to 34547 states and 107753 transitions. [2021-06-05 09:18:04,478 INFO L78 Accepts]: Start accepts. Automaton has 34547 states and 107753 transitions. Word has length 72 [2021-06-05 09:18:04,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:18:04,478 INFO L482 AbstractCegarLoop]: Abstraction has 34547 states and 107753 transitions. [2021-06-05 09:18:04,478 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:04,478 INFO L276 IsEmpty]: Start isEmpty. Operand 34547 states and 107753 transitions. [2021-06-05 09:18:04,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:18:04,503 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:18:04,503 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:18:04,503 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable212 [2021-06-05 09:18:04,504 INFO L430 AbstractCegarLoop]: === Iteration 119 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:18:04,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:18:04,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1973051613, now seen corresponding path program 2 times [2021-06-05 09:18:04,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:18:04,504 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896850852] [2021-06-05 09:18:04,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:18:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:18:04,585 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:18:04,585 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:18:04,585 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896850852] [2021-06-05 09:18:04,585 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896850852] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:18:04,585 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:18:04,586 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:18:04,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954256433] [2021-06-05 09:18:04,586 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:18:04,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:18:04,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:18:04,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:18:04,586 INFO L87 Difference]: Start difference. First operand 34547 states and 107753 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:05,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:18:05,194 INFO L93 Difference]: Finished difference Result 35238 states and 109923 transitions. [2021-06-05 09:18:05,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 09:18:05,195 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:18:05,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:18:05,253 INFO L225 Difference]: With dead ends: 35238 [2021-06-05 09:18:05,253 INFO L226 Difference]: Without dead ends: 35238 [2021-06-05 09:18:05,253 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 159.2ms TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:18:05,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35238 states. [2021-06-05 09:18:05,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35238 to 34551. [2021-06-05 09:18:05,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34551 states, 34551 states have (on average 3.119012474313334) internal successors, (107765), 34550 states have internal predecessors, (107765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:05,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34551 states to 34551 states and 107765 transitions. [2021-06-05 09:18:05,899 INFO L78 Accepts]: Start accepts. Automaton has 34551 states and 107765 transitions. Word has length 72 [2021-06-05 09:18:05,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:18:05,899 INFO L482 AbstractCegarLoop]: Abstraction has 34551 states and 107765 transitions. [2021-06-05 09:18:05,899 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:05,899 INFO L276 IsEmpty]: Start isEmpty. Operand 34551 states and 107765 transitions. [2021-06-05 09:18:05,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:18:05,924 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:18:05,924 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:18:05,925 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable213 [2021-06-05 09:18:05,925 INFO L430 AbstractCegarLoop]: === Iteration 120 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:18:05,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:18:05,925 INFO L82 PathProgramCache]: Analyzing trace with hash 337133353, now seen corresponding path program 3 times [2021-06-05 09:18:05,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:18:05,925 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107797901] [2021-06-05 09:18:05,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:18:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:18:06,003 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:18:06,003 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:18:06,003 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107797901] [2021-06-05 09:18:06,003 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107797901] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:18:06,003 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:18:06,003 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:18:06,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771366626] [2021-06-05 09:18:06,003 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:18:06,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:18:06,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:18:06,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:18:06,004 INFO L87 Difference]: Start difference. First operand 34551 states and 107765 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:06,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:18:06,534 INFO L93 Difference]: Finished difference Result 34903 states and 108826 transitions. [2021-06-05 09:18:06,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:18:06,534 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:18:06,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:18:06,589 INFO L225 Difference]: With dead ends: 34903 [2021-06-05 09:18:06,589 INFO L226 Difference]: Without dead ends: 34903 [2021-06-05 09:18:06,589 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 95.2ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:18:06,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34903 states. [2021-06-05 09:18:07,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34903 to 34487. [2021-06-05 09:18:07,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34487 states, 34487 states have (on average 3.1173195696929277) internal successors, (107507), 34486 states have internal predecessors, (107507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:07,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34487 states to 34487 states and 107507 transitions. [2021-06-05 09:18:07,224 INFO L78 Accepts]: Start accepts. Automaton has 34487 states and 107507 transitions. Word has length 72 [2021-06-05 09:18:07,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:18:07,224 INFO L482 AbstractCegarLoop]: Abstraction has 34487 states and 107507 transitions. [2021-06-05 09:18:07,224 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:07,224 INFO L276 IsEmpty]: Start isEmpty. Operand 34487 states and 107507 transitions. [2021-06-05 09:18:07,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:18:07,249 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:18:07,249 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:18:07,249 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable214 [2021-06-05 09:18:07,249 INFO L430 AbstractCegarLoop]: === Iteration 121 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:18:07,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:18:07,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1935366165, now seen corresponding path program 4 times [2021-06-05 09:18:07,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:18:07,250 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414002724] [2021-06-05 09:18:07,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:18:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:18:07,308 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:18:07,308 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:18:07,309 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414002724] [2021-06-05 09:18:07,309 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414002724] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:18:07,309 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:18:07,309 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 09:18:07,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317496466] [2021-06-05 09:18:07,309 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 09:18:07,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:18:07,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 09:18:07,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-05 09:18:07,310 INFO L87 Difference]: Start difference. First operand 34487 states and 107507 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:07,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:18:07,801 INFO L93 Difference]: Finished difference Result 47681 states and 148494 transitions. [2021-06-05 09:18:07,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-05 09:18:07,801 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:18:07,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:18:07,885 INFO L225 Difference]: With dead ends: 47681 [2021-06-05 09:18:07,885 INFO L226 Difference]: Without dead ends: 47681 [2021-06-05 09:18:07,885 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 75.7ms TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-06-05 09:18:08,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47681 states. [2021-06-05 09:18:08,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47681 to 36595. [2021-06-05 09:18:08,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36595 states, 36595 states have (on average 3.1346358792184725) internal successors, (114712), 36594 states have internal predecessors, (114712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36595 states to 36595 states and 114712 transitions. [2021-06-05 09:18:08,791 INFO L78 Accepts]: Start accepts. Automaton has 36595 states and 114712 transitions. Word has length 72 [2021-06-05 09:18:08,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:18:08,791 INFO L482 AbstractCegarLoop]: Abstraction has 36595 states and 114712 transitions. [2021-06-05 09:18:08,791 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:08,791 INFO L276 IsEmpty]: Start isEmpty. Operand 36595 states and 114712 transitions. [2021-06-05 09:18:08,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:18:08,817 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:18:08,817 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:18:08,817 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable215 [2021-06-05 09:18:08,817 INFO L430 AbstractCegarLoop]: === Iteration 122 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:18:08,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:18:08,818 INFO L82 PathProgramCache]: Analyzing trace with hash -795455637, now seen corresponding path program 5 times [2021-06-05 09:18:08,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:18:08,818 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839061033] [2021-06-05 09:18:08,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:18:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:18:08,908 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:18:08,908 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:18:08,908 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839061033] [2021-06-05 09:18:08,908 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839061033] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:18:08,908 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:18:08,908 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:18:08,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956839346] [2021-06-05 09:18:08,909 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:18:08,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:18:08,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:18:08,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:18:08,909 INFO L87 Difference]: Start difference. First operand 36595 states and 114712 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:09,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:18:09,747 INFO L93 Difference]: Finished difference Result 39162 states and 122597 transitions. [2021-06-05 09:18:09,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 09:18:09,748 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:18:09,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:18:09,807 INFO L225 Difference]: With dead ends: 39162 [2021-06-05 09:18:09,807 INFO L226 Difference]: Without dead ends: 39162 [2021-06-05 09:18:09,807 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 216.6ms TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2021-06-05 09:18:09,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39162 states. [2021-06-05 09:18:10,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39162 to 36643. [2021-06-05 09:18:10,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36643 states, 36643 states have (on average 3.1345686761455123) internal successors, (114860), 36642 states have internal predecessors, (114860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:10,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36643 states to 36643 states and 114860 transitions. [2021-06-05 09:18:10,454 INFO L78 Accepts]: Start accepts. Automaton has 36643 states and 114860 transitions. Word has length 72 [2021-06-05 09:18:10,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:18:10,455 INFO L482 AbstractCegarLoop]: Abstraction has 36643 states and 114860 transitions. [2021-06-05 09:18:10,455 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:10,455 INFO L276 IsEmpty]: Start isEmpty. Operand 36643 states and 114860 transitions. [2021-06-05 09:18:10,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:18:10,480 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:18:10,480 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:18:10,480 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable216 [2021-06-05 09:18:10,480 INFO L430 AbstractCegarLoop]: === Iteration 123 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:18:10,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:18:10,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1163176063, now seen corresponding path program 6 times [2021-06-05 09:18:10,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:18:10,480 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227063392] [2021-06-05 09:18:10,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:18:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:18:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:18:10,557 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:18:10,557 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227063392] [2021-06-05 09:18:10,557 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227063392] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:18:10,557 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:18:10,557 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:18:10,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263370183] [2021-06-05 09:18:10,557 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:18:10,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:18:10,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:18:10,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:18:10,558 INFO L87 Difference]: Start difference. First operand 36643 states and 114860 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:11,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:18:11,386 INFO L93 Difference]: Finished difference Result 38819 states and 121662 transitions. [2021-06-05 09:18:11,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 09:18:11,386 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:18:11,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:18:11,451 INFO L225 Difference]: With dead ends: 38819 [2021-06-05 09:18:11,451 INFO L226 Difference]: Without dead ends: 38819 [2021-06-05 09:18:11,452 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 228.2ms TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2021-06-05 09:18:11,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38819 states. [2021-06-05 09:18:12,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38819 to 36683. [2021-06-05 09:18:12,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36683 states, 36683 states have (on average 3.1352397568355914) internal successors, (115010), 36682 states have internal predecessors, (115010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:12,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36683 states to 36683 states and 115010 transitions. [2021-06-05 09:18:12,131 INFO L78 Accepts]: Start accepts. Automaton has 36683 states and 115010 transitions. Word has length 72 [2021-06-05 09:18:12,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:18:12,131 INFO L482 AbstractCegarLoop]: Abstraction has 36683 states and 115010 transitions. [2021-06-05 09:18:12,132 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:12,132 INFO L276 IsEmpty]: Start isEmpty. Operand 36683 states and 115010 transitions. [2021-06-05 09:18:12,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:18:12,156 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:18:12,156 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:18:12,156 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable217 [2021-06-05 09:18:12,156 INFO L430 AbstractCegarLoop]: === Iteration 124 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:18:12,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:18:12,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1888211979, now seen corresponding path program 7 times [2021-06-05 09:18:12,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:18:12,157 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246261449] [2021-06-05 09:18:12,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:18:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:18:12,234 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:18:12,234 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:18:12,234 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246261449] [2021-06-05 09:18:12,234 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246261449] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:18:12,234 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:18:12,234 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:18:12,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148165889] [2021-06-05 09:18:12,234 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:18:12,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:18:12,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:18:12,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:18:12,235 INFO L87 Difference]: Start difference. First operand 36683 states and 115010 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:12,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:18:12,883 INFO L93 Difference]: Finished difference Result 37614 states and 117843 transitions. [2021-06-05 09:18:12,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 09:18:12,884 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:18:12,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:18:12,948 INFO L225 Difference]: With dead ends: 37614 [2021-06-05 09:18:12,948 INFO L226 Difference]: Without dead ends: 37614 [2021-06-05 09:18:12,948 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 128.0ms TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-06-05 09:18:13,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37614 states. [2021-06-05 09:18:13,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37614 to 36643. [2021-06-05 09:18:13,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36643 states, 36643 states have (on average 3.1345686761455123) internal successors, (114860), 36642 states have internal predecessors, (114860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:13,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36643 states to 36643 states and 114860 transitions. [2021-06-05 09:18:13,608 INFO L78 Accepts]: Start accepts. Automaton has 36643 states and 114860 transitions. Word has length 72 [2021-06-05 09:18:13,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:18:13,608 INFO L482 AbstractCegarLoop]: Abstraction has 36643 states and 114860 transitions. [2021-06-05 09:18:13,608 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:13,608 INFO L276 IsEmpty]: Start isEmpty. Operand 36643 states and 114860 transitions. [2021-06-05 09:18:13,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:18:13,635 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:18:13,635 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:18:13,635 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable218 [2021-06-05 09:18:13,635 INFO L430 AbstractCegarLoop]: === Iteration 125 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:18:13,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:18:13,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1790418581, now seen corresponding path program 8 times [2021-06-05 09:18:13,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:18:13,636 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581260921] [2021-06-05 09:18:13,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:18:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:18:13,715 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:18:13,715 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:18:13,715 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581260921] [2021-06-05 09:18:13,715 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581260921] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:18:13,715 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:18:13,715 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:18:13,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902526649] [2021-06-05 09:18:13,715 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:18:13,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:18:13,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:18:13,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:18:13,716 INFO L87 Difference]: Start difference. First operand 36643 states and 114860 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:14,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:18:14,138 INFO L93 Difference]: Finished difference Result 37064 states and 116206 transitions. [2021-06-05 09:18:14,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 09:18:14,139 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:18:14,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:18:14,401 INFO L225 Difference]: With dead ends: 37064 [2021-06-05 09:18:14,401 INFO L226 Difference]: Without dead ends: 37064 [2021-06-05 09:18:14,401 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 94.8ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-06-05 09:18:14,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37064 states. [2021-06-05 09:18:14,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37064 to 36707. [2021-06-05 09:18:14,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36707 states, 36707 states have (on average 3.1344975072874384) internal successors, (115058), 36706 states have internal predecessors, (115058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:15,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36707 states to 36707 states and 115058 transitions. [2021-06-05 09:18:15,007 INFO L78 Accepts]: Start accepts. Automaton has 36707 states and 115058 transitions. Word has length 72 [2021-06-05 09:18:15,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:18:15,007 INFO L482 AbstractCegarLoop]: Abstraction has 36707 states and 115058 transitions. [2021-06-05 09:18:15,008 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:15,008 INFO L276 IsEmpty]: Start isEmpty. Operand 36707 states and 115058 transitions. [2021-06-05 09:18:15,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:18:15,033 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:18:15,033 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:18:15,033 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable219 [2021-06-05 09:18:15,033 INFO L430 AbstractCegarLoop]: === Iteration 126 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:18:15,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:18:15,034 INFO L82 PathProgramCache]: Analyzing trace with hash -154760367, now seen corresponding path program 9 times [2021-06-05 09:18:15,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:18:15,034 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091573080] [2021-06-05 09:18:15,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:18:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:18:15,115 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:18:15,115 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:18:15,115 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091573080] [2021-06-05 09:18:15,115 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091573080] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:18:15,115 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:18:15,116 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:18:15,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596514214] [2021-06-05 09:18:15,116 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:18:15,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:18:15,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:18:15,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:18:15,116 INFO L87 Difference]: Start difference. First operand 36707 states and 115058 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:16,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:18:16,011 INFO L93 Difference]: Finished difference Result 38158 states and 119560 transitions. [2021-06-05 09:18:16,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 09:18:16,011 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:18:16,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:18:16,075 INFO L225 Difference]: With dead ends: 38158 [2021-06-05 09:18:16,076 INFO L226 Difference]: Without dead ends: 38158 [2021-06-05 09:18:16,076 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 217.0ms TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2021-06-05 09:18:16,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38158 states. [2021-06-05 09:18:16,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38158 to 36723. [2021-06-05 09:18:16,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36723 states, 36723 states have (on average 3.1360727609400105) internal successors, (115166), 36722 states have internal predecessors, (115166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:16,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36723 states to 36723 states and 115166 transitions. [2021-06-05 09:18:16,716 INFO L78 Accepts]: Start accepts. Automaton has 36723 states and 115166 transitions. Word has length 72 [2021-06-05 09:18:16,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:18:16,717 INFO L482 AbstractCegarLoop]: Abstraction has 36723 states and 115166 transitions. [2021-06-05 09:18:16,717 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:16,717 INFO L276 IsEmpty]: Start isEmpty. Operand 36723 states and 115166 transitions. [2021-06-05 09:18:16,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:18:16,741 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:18:16,741 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:18:16,741 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable220 [2021-06-05 09:18:16,741 INFO L430 AbstractCegarLoop]: === Iteration 127 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:18:16,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:18:16,742 INFO L82 PathProgramCache]: Analyzing trace with hash -258470239, now seen corresponding path program 10 times [2021-06-05 09:18:16,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:18:16,742 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340430476] [2021-06-05 09:18:16,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:18:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:18:16,819 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:18:16,820 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:18:16,820 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340430476] [2021-06-05 09:18:16,820 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340430476] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:18:16,820 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:18:16,820 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:18:16,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450835159] [2021-06-05 09:18:16,820 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:18:16,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:18:16,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:18:16,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:18:16,821 INFO L87 Difference]: Start difference. First operand 36723 states and 115166 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:17,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:18:17,583 INFO L93 Difference]: Finished difference Result 37224 states and 116698 transitions. [2021-06-05 09:18:17,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 09:18:17,597 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 09:18:17,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:18:17,687 INFO L225 Difference]: With dead ends: 37224 [2021-06-05 09:18:17,688 INFO L226 Difference]: Without dead ends: 37224 [2021-06-05 09:18:17,688 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 159.0ms TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-06-05 09:18:17,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37224 states. [2021-06-05 09:18:18,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37224 to 36659. [2021-06-05 09:18:18,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36659 states, 36659 states have (on average 3.134509942988079) internal successors, (114908), 36658 states have internal predecessors, (114908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:18,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36659 states to 36659 states and 114908 transitions. [2021-06-05 09:18:18,470 INFO L78 Accepts]: Start accepts. Automaton has 36659 states and 114908 transitions. Word has length 72 [2021-06-05 09:18:18,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:18:18,470 INFO L482 AbstractCegarLoop]: Abstraction has 36659 states and 114908 transitions. [2021-06-05 09:18:18,471 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 09:18:18,471 INFO L276 IsEmpty]: Start isEmpty. Operand 36659 states and 114908 transitions. [2021-06-05 09:18:18,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 09:18:18,500 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:18:18,500 INFO L521 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 09:18:18,500 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable221 [2021-06-05 09:18:18,500 INFO L430 AbstractCegarLoop]: === Iteration 128 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:18:18,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:18:18,501 INFO L82 PathProgramCache]: Analyzing trace with hash 839611371, now seen corresponding path program 11 times [2021-06-05 09:18:18,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:18:18,501 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43358821] [2021-06-05 09:18:18,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:18:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:18:18,580 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:18:18,580 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:18:18,580 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43358821] [2021-06-05 09:18:18,580 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43358821] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:18:18,581 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 09:18:18,581 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-05 09:18:18,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671918017] [2021-06-05 09:18:18,581 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 09:18:18,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:18:18,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 09:18:18,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-06-05 09:18:18,581 INFO L87 Difference]: Start difference. First operand 36659 states and 114908 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)