/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.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-04 21:27:10,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-04 21:27:10,753 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-04 21:27:10,781 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-04 21:27:10,781 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-04 21:27:10,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-04 21:27:10,785 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-04 21:27:10,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-04 21:27:10,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-04 21:27:10,795 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-04 21:27:10,796 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-04 21:27:10,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-04 21:27:10,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-04 21:27:10,798 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-04 21:27:10,799 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-04 21:27:10,800 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-04 21:27:10,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-04 21:27:10,802 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-04 21:27:10,804 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-04 21:27:10,808 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-04 21:27:10,809 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-04 21:27:10,810 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-04 21:27:10,810 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-04 21:27:10,812 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-04 21:27:10,816 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-04 21:27:10,817 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-04 21:27:10,817 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-04 21:27:10,818 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-04 21:27:10,818 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-04 21:27:10,819 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-04 21:27:10,819 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-04 21:27:10,819 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-04 21:27:10,820 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-04 21:27:10,821 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-04 21:27:10,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-04 21:27:10,822 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-04 21:27:10,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-04 21:27:10,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-04 21:27:10,822 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-04 21:27:10,823 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-04 21:27:10,823 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-04 21:27:10,826 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.epf [2021-06-04 21:27:10,854 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-04 21:27:10,854 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-04 21:27:10,855 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-04 21:27:10,855 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-04 21:27:10,856 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-04 21:27:10,857 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-04 21:27:10,857 INFO L138 SettingsManager]: * Use SBE=true [2021-06-04 21:27:10,857 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-04 21:27:10,857 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-04 21:27:10,857 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-04 21:27:10,858 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-04 21:27:10,858 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-04 21:27:10,858 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-04 21:27:10,858 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-04 21:27:10,858 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-04 21:27:10,858 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-04 21:27:10,858 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-04 21:27:10,859 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-04 21:27:10,859 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-04 21:27:10,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-04 21:27:10,859 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-04 21:27:10,859 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-04 21:27:10,859 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-04 21:27:10,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-04 21:27:10,859 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-04 21:27:10,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-04 21:27:10,860 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-04 21:27:10,860 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-04 21:27:10,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-04 21:27:10,860 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-04 21:27:10,860 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-04 21:27:10,860 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-04 21:27:11,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-04 21:27:11,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-04 21:27:11,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-04 21:27:11,155 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-04 21:27:11,156 INFO L275 PluginConnector]: CDTParser initialized [2021-06-04 21:27:11,156 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2021-06-04 21:27:11,217 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3747f0f95/7637c16611d04245a518ef5d64b56180/FLAG3b5da60b2 [2021-06-04 21:27:11,660 INFO L306 CDTParser]: Found 1 translation units. [2021-06-04 21:27:11,660 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2021-06-04 21:27:11,677 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3747f0f95/7637c16611d04245a518ef5d64b56180/FLAG3b5da60b2 [2021-06-04 21:27:11,692 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3747f0f95/7637c16611d04245a518ef5d64b56180 [2021-06-04 21:27:11,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-04 21:27:11,696 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-04 21:27:11,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-04 21:27:11,698 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-04 21:27:11,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-04 21:27:11,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 09:27:11" (1/1) ... [2021-06-04 21:27:11,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a11bd01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:27:11, skipping insertion in model container [2021-06-04 21:27:11,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 09:27:11" (1/1) ... [2021-06-04 21:27:11,706 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-04 21:27:11,770 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-04 21:27:12,085 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/queue_ok_longest.i[43280,43293] [2021-06-04 21:27:12,089 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/queue_ok_longest.i[43553,43566] [2021-06-04 21:27:12,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-04 21:27:12,097 INFO L203 MainTranslator]: Completed pre-run [2021-06-04 21:27:12,141 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/queue_ok_longest.i[43280,43293] [2021-06-04 21:27:12,143 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/queue_ok_longest.i[43553,43566] [2021-06-04 21:27:12,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-04 21:27:12,220 INFO L208 MainTranslator]: Completed translation [2021-06-04 21:27:12,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:27:12 WrapperNode [2021-06-04 21:27:12,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-04 21:27:12,221 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-04 21:27:12,221 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-04 21:27:12,221 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-04 21:27:12,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:27:12" (1/1) ... [2021-06-04 21:27:12,241 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:27:12" (1/1) ... [2021-06-04 21:27:12,259 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-04 21:27:12,260 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-04 21:27:12,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-04 21:27:12,260 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-04 21:27:12,265 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:27:12" (1/1) ... [2021-06-04 21:27:12,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:27:12" (1/1) ... [2021-06-04 21:27:12,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:27:12" (1/1) ... [2021-06-04 21:27:12,269 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:27:12" (1/1) ... [2021-06-04 21:27:12,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:27:12" (1/1) ... [2021-06-04 21:27:12,277 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:27:12" (1/1) ... [2021-06-04 21:27:12,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:27:12" (1/1) ... [2021-06-04 21:27:12,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-04 21:27:12,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-04 21:27:12,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-04 21:27:12,283 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-04 21:27:12,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:27:12" (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-04 21:27:12,340 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2021-06-04 21:27:12,341 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2021-06-04 21:27:12,341 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2021-06-04 21:27:12,342 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2021-06-04 21:27:12,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-04 21:27:12,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-04 21:27:12,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-04 21:27:12,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-04 21:27:12,343 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-06-04 21:27:12,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-04 21:27:12,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-04 21:27:12,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-04 21:27:12,344 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-04 21:27:12,841 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-04 21:27:12,842 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2021-06-04 21:27:12,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 09:27:12 BoogieIcfgContainer [2021-06-04 21:27:12,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-04 21:27:12,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-04 21:27:12,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-04 21:27:12,859 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-04 21:27:12,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 09:27:11" (1/3) ... [2021-06-04 21:27:12,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c66fd5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 09:27:12, skipping insertion in model container [2021-06-04 21:27:12,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 09:27:12" (2/3) ... [2021-06-04 21:27:12,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c66fd5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 09:27:12, skipping insertion in model container [2021-06-04 21:27:12,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 09:27:12" (3/3) ... [2021-06-04 21:27:12,861 INFO L111 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2021-06-04 21:27:12,865 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-04 21:27:12,865 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-04 21:27:12,865 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-04 21:27:12,865 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-04 21:27:12,923 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,923 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,923 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,923 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,923 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,923 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,924 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,924 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,924 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,924 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,924 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,924 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,924 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,924 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,924 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,925 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,925 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,925 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,925 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,925 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,925 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,925 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,926 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,926 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,926 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,926 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,926 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,926 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,926 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,926 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,926 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,927 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,927 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,927 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,927 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,927 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,927 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,927 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,927 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,927 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,927 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,928 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,928 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,928 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,928 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,928 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,928 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,928 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,928 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,928 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,928 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,928 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,929 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,929 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,929 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,929 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,929 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,929 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,929 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,929 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,929 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,929 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,930 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,930 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,930 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,930 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,930 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,930 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,930 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,930 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,930 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,930 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,931 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,931 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,931 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,931 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,931 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,931 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,931 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,931 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,931 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,931 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,932 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,932 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,932 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,932 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,932 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,932 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,932 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,932 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,933 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,933 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,933 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,933 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,933 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,933 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,933 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,933 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,933 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,934 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,934 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,934 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,934 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,934 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,934 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,934 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,934 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,934 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,935 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,935 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,935 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,935 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,935 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,935 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,935 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,935 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,935 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,936 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,936 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,936 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,936 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,936 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,936 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,936 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,941 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,941 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,941 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,941 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,941 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,941 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,941 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,941 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,941 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,942 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,942 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,942 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,942 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,942 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,942 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,942 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,942 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,942 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,943 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,943 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,943 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,943 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,943 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,943 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,943 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,943 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,943 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,943 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,944 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,946 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,947 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,947 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,947 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,947 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,947 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,947 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,947 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,947 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,947 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,947 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,947 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,948 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,948 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,948 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,948 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,948 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,948 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,948 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,949 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,949 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,949 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,949 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,950 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,950 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,950 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,950 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,950 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,950 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,950 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,950 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,950 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,950 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,950 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,951 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,951 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,951 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,951 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,951 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,951 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,951 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,951 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,951 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,952 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,952 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,952 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,952 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,952 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,952 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,952 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,952 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,952 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,952 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,952 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,953 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,953 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,953 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,953 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,953 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,953 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,953 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,953 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,953 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,953 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,953 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,953 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,954 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,954 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,954 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,954 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,954 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,954 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,954 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,954 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,954 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,954 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,954 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,954 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,955 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,955 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,955 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,955 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,955 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,955 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,955 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,955 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,955 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,955 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,955 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,956 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,956 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,956 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,956 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,956 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,956 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,956 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,956 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,956 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,956 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,956 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,957 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,957 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,957 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,957 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,957 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,957 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,957 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,957 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,957 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,957 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,958 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,958 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,958 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,958 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,958 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,958 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,958 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,958 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,958 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,958 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,958 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,959 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,959 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,959 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,959 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,959 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,959 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,959 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,959 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,959 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,959 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,959 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,959 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,960 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,960 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,960 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,960 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,960 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,960 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,960 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,960 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,960 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,960 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,965 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,965 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,965 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,965 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,965 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,965 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,965 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,965 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,966 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,966 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,966 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,966 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,966 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,966 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,966 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,966 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,966 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,966 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,967 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,967 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,967 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,967 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,967 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,967 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,967 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,967 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,967 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,967 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,968 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,968 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,968 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,968 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,968 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,968 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,968 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,968 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,968 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,968 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,968 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,969 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,969 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,969 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,969 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,969 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,969 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,969 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,977 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,977 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,977 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,977 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,977 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,977 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,977 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,978 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,978 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,978 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,979 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,981 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,981 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,981 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,981 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,981 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,981 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,982 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,982 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,982 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,982 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,982 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,982 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,982 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,982 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,982 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,982 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,982 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,983 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,983 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,983 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,983 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,983 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,983 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,983 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,983 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,983 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,983 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,983 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,983 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,984 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,984 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,984 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,984 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,984 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,984 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,984 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,984 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,984 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,984 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,984 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,984 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,985 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,985 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,985 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,985 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,985 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,985 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,985 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,986 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,986 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,986 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,986 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,986 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,986 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,986 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,986 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,986 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,986 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,986 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,987 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,987 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,987 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,987 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,987 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,987 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,987 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,993 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,993 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,993 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,993 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,993 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,999 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,999 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:12,999 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,000 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,000 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,000 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,000 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,000 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,000 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,000 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,000 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,000 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,000 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,000 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,001 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,001 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,001 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,001 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,001 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,001 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,001 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,001 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,001 WARN L313 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,004 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,004 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,004 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,004 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,005 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,005 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,005 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,005 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,005 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,005 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,005 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,005 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,006 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,006 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,006 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,006 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,006 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,006 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,006 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,006 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,006 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,006 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,006 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,006 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,006 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,007 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,007 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,007 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,007 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,007 WARN L313 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,007 WARN L313 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:27:13,020 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-06-04 21:27:13,036 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-04 21:27:13,057 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-04 21:27:13,058 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-04 21:27:13,058 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-04 21:27:13,058 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-04 21:27:13,058 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-04 21:27:13,060 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-04 21:27:13,060 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-04 21:27:13,061 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-04 21:27:13,070 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 208 places, 216 transitions, 454 flow [2021-06-04 21:27:13,553 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14541 states, 14538 states have (on average 2.85080478745357) internal successors, (41445), 14540 states have internal predecessors, (41445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:13,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 14541 states, 14538 states have (on average 2.85080478745357) internal successors, (41445), 14540 states have internal predecessors, (41445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:13,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-04 21:27:13,594 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:13,594 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-04 21:27:13,594 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:13,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:13,598 INFO L82 PathProgramCache]: Analyzing trace with hash 587458973, now seen corresponding path program 1 times [2021-06-04 21:27:13,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:13,603 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206349808] [2021-06-04 21:27:13,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:13,776 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-04 21:27:13,776 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:13,776 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206349808] [2021-06-04 21:27:13,777 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206349808] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:13,777 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:13,777 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-04 21:27:13,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704658840] [2021-06-04 21:27:13,779 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-04 21:27:13,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:13,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-04 21:27:13,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-04 21:27:13,812 INFO L87 Difference]: Start difference. First operand has 14541 states, 14538 states have (on average 2.85080478745357) internal successors, (41445), 14540 states have internal predecessors, (41445), 0 states have call successors, (0), 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 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:13,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:13,948 INFO L93 Difference]: Finished difference Result 14342 states and 40211 transitions. [2021-06-04 21:27:13,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-04 21:27:13,949 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2021-06-04 21:27:13,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:14,011 INFO L225 Difference]: With dead ends: 14342 [2021-06-04 21:27:14,011 INFO L226 Difference]: Without dead ends: 13019 [2021-06-04 21:27:14,012 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-04 21:27:14,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13019 states. [2021-06-04 21:27:14,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13019 to 13019. [2021-06-04 21:27:14,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13019 states, 13018 states have (on average 2.8007374404670458) internal successors, (36460), 13018 states have internal predecessors, (36460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13019 states to 13019 states and 36460 transitions. [2021-06-04 21:27:14,464 INFO L78 Accepts]: Start accepts. Automaton has 13019 states and 36460 transitions. Word has length 48 [2021-06-04 21:27:14,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:14,465 INFO L482 AbstractCegarLoop]: Abstraction has 13019 states and 36460 transitions. [2021-06-04 21:27:14,465 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:14,465 INFO L276 IsEmpty]: Start isEmpty. Operand 13019 states and 36460 transitions. [2021-06-04 21:27:14,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-06-04 21:27:14,486 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:14,486 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:27:14,486 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-04 21:27:14,486 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:14,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:14,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1834205292, now seen corresponding path program 1 times [2021-06-04 21:27:14,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:14,489 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650990035] [2021-06-04 21:27:14,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:14,793 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-04 21:27:14,794 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:14,794 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650990035] [2021-06-04 21:27:14,794 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650990035] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:14,794 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:14,794 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-04 21:27:14,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991713592] [2021-06-04 21:27:14,795 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-04 21:27:14,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:14,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-04 21:27:14,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-04 21:27:14,796 INFO L87 Difference]: Start difference. First operand 13019 states and 36460 transitions. Second operand has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 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-04 21:27:15,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:15,237 INFO L93 Difference]: Finished difference Result 13016 states and 36456 transitions. [2021-06-04 21:27:15,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-04 21:27:15,237 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 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 106 [2021-06-04 21:27:15,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:15,270 INFO L225 Difference]: With dead ends: 13016 [2021-06-04 21:27:15,270 INFO L226 Difference]: Without dead ends: 13016 [2021-06-04 21:27:15,271 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 309.0ms TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2021-06-04 21:27:15,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13016 states. [2021-06-04 21:27:15,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13016 to 13016. [2021-06-04 21:27:15,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13016 states, 13015 states have (on average 2.801075681905494) internal successors, (36456), 13015 states have internal predecessors, (36456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:15,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13016 states to 13016 states and 36456 transitions. [2021-06-04 21:27:15,577 INFO L78 Accepts]: Start accepts. Automaton has 13016 states and 36456 transitions. Word has length 106 [2021-06-04 21:27:15,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:15,577 INFO L482 AbstractCegarLoop]: Abstraction has 13016 states and 36456 transitions. [2021-06-04 21:27:15,577 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 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-04 21:27:15,577 INFO L276 IsEmpty]: Start isEmpty. Operand 13016 states and 36456 transitions. [2021-06-04 21:27:15,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-06-04 21:27:15,591 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:15,591 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:27:15,592 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-04 21:27:15,592 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:15,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:15,592 INFO L82 PathProgramCache]: Analyzing trace with hash -631016736, now seen corresponding path program 1 times [2021-06-04 21:27:15,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:15,593 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456228249] [2021-06-04 21:27:15,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:15,680 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-04 21:27:15,680 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:15,680 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456228249] [2021-06-04 21:27:15,680 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456228249] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:15,680 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:15,680 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-04 21:27:15,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057872425] [2021-06-04 21:27:15,681 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-04 21:27:15,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:15,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-04 21:27:15,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-04 21:27:15,682 INFO L87 Difference]: Start difference. First operand 13016 states and 36456 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 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-04 21:27:15,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:15,693 INFO L93 Difference]: Finished difference Result 2575 states and 6245 transitions. [2021-06-04 21:27:15,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-04 21:27:15,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 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 107 [2021-06-04 21:27:15,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:15,699 INFO L225 Difference]: With dead ends: 2575 [2021-06-04 21:27:15,699 INFO L226 Difference]: Without dead ends: 2456 [2021-06-04 21:27:15,699 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-04 21:27:15,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2456 states. [2021-06-04 21:27:15,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2456 to 2456. [2021-06-04 21:27:15,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2456 states, 2455 states have (on average 2.430142566191446) internal successors, (5966), 2455 states have internal predecessors, (5966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:15,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2456 states to 2456 states and 5966 transitions. [2021-06-04 21:27:15,784 INFO L78 Accepts]: Start accepts. Automaton has 2456 states and 5966 transitions. Word has length 107 [2021-06-04 21:27:15,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:15,784 INFO L482 AbstractCegarLoop]: Abstraction has 2456 states and 5966 transitions. [2021-06-04 21:27:15,784 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 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-04 21:27:15,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2456 states and 5966 transitions. [2021-06-04 21:27:15,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-06-04 21:27:15,787 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:15,787 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:27:15,787 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-04 21:27:15,788 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:15,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:15,788 INFO L82 PathProgramCache]: Analyzing trace with hash -772175777, now seen corresponding path program 1 times [2021-06-04 21:27:15,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:15,788 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838399484] [2021-06-04 21:27:15,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:15,814 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-04 21:27:15,814 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:15,814 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838399484] [2021-06-04 21:27:15,814 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838399484] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:15,814 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-04 21:27:15,814 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-04 21:27:15,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878676191] [2021-06-04 21:27:15,815 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-04 21:27:15,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:15,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-04 21:27:15,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-04 21:27:15,815 INFO L87 Difference]: Start difference. First operand 2456 states and 5966 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 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-04 21:27:15,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:15,832 INFO L93 Difference]: Finished difference Result 3340 states and 8134 transitions. [2021-06-04 21:27:15,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-04 21:27:15,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 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 117 [2021-06-04 21:27:15,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:15,837 INFO L225 Difference]: With dead ends: 3340 [2021-06-04 21:27:15,837 INFO L226 Difference]: Without dead ends: 3340 [2021-06-04 21:27:15,837 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-04 21:27:15,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3340 states. [2021-06-04 21:27:15,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3340 to 2482. [2021-06-04 21:27:15,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2482 states, 2481 states have (on average 2.430068520757759) internal successors, (6029), 2481 states have internal predecessors, (6029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:15,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 6029 transitions. [2021-06-04 21:27:15,908 INFO L78 Accepts]: Start accepts. Automaton has 2482 states and 6029 transitions. Word has length 117 [2021-06-04 21:27:15,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:15,908 INFO L482 AbstractCegarLoop]: Abstraction has 2482 states and 6029 transitions. [2021-06-04 21:27:15,908 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 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-04 21:27:15,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 6029 transitions. [2021-06-04 21:27:15,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-06-04 21:27:15,912 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:15,912 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:27:15,912 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-04 21:27:15,912 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:15,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:15,913 INFO L82 PathProgramCache]: Analyzing trace with hash 809591043, now seen corresponding path program 1 times [2021-06-04 21:27:15,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:15,913 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715318352] [2021-06-04 21:27:15,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:15,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:15,962 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:15,962 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715318352] [2021-06-04 21:27:15,962 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715318352] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:27:15,962 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107510778] [2021-06-04 21:27:15,962 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-04 21:27:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:16,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 2 conjunts are in the unsatisfiable core [2021-06-04 21:27:16,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-04 21:27:16,290 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-04 21:27:16,293 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:16,294 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:16,295 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:27:16,295 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2021-06-04 21:27:16,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-04 21:27:16,391 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107510778] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-04 21:27:16,391 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-04 21:27:16,391 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-06-04 21:27:16,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306977231] [2021-06-04 21:27:16,392 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-04 21:27:16,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:16,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-04 21:27:16,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-04 21:27:16,392 INFO L87 Difference]: Start difference. First operand 2482 states and 6029 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:16,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:16,407 INFO L93 Difference]: Finished difference Result 1906 states and 4405 transitions. [2021-06-04 21:27:16,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-04 21:27:16,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2021-06-04 21:27:16,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:16,410 INFO L225 Difference]: With dead ends: 1906 [2021-06-04 21:27:16,411 INFO L226 Difference]: Without dead ends: 1874 [2021-06-04 21:27:16,411 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 12.3ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-04 21:27:16,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2021-06-04 21:27:16,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1874. [2021-06-04 21:27:16,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1874 states, 1873 states have (on average 2.3091297383876133) internal successors, (4325), 1873 states have internal predecessors, (4325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:16,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 4325 transitions. [2021-06-04 21:27:16,447 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 4325 transitions. Word has length 146 [2021-06-04 21:27:16,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:16,447 INFO L482 AbstractCegarLoop]: Abstraction has 1874 states and 4325 transitions. [2021-06-04 21:27:16,448 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:16,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 4325 transitions. [2021-06-04 21:27:16,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-06-04 21:27:16,451 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:16,451 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:27:16,665 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-04 21:27:16,665 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:16,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:16,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1707580655, now seen corresponding path program 1 times [2021-06-04 21:27:16,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:16,666 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654742433] [2021-06-04 21:27:16,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:16,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:16,727 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:16,727 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654742433] [2021-06-04 21:27:16,727 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654742433] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:27:16,727 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404577740] [2021-06-04 21:27:16,727 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-04 21:27:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:16,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-04 21:27:16,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-04 21:27:17,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:17,030 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404577740] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:27:17,030 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-04 21:27:17,030 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-04 21:27:17,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409459646] [2021-06-04 21:27:17,030 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-04 21:27:17,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:17,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-04 21:27:17,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-04 21:27:17,031 INFO L87 Difference]: Start difference. First operand 1874 states and 4325 transitions. Second operand has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:17,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:17,067 INFO L93 Difference]: Finished difference Result 3098 states and 7149 transitions. [2021-06-04 21:27:17,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-04 21:27:17,067 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 states have internal predecessors, (184), 0 states have call successors, (0), 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 147 [2021-06-04 21:27:17,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:17,071 INFO L225 Difference]: With dead ends: 3098 [2021-06-04 21:27:17,071 INFO L226 Difference]: Without dead ends: 3098 [2021-06-04 21:27:17,071 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 23.1ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-04 21:27:17,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3098 states. [2021-06-04 21:27:17,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3098 to 2504. [2021-06-04 21:27:17,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2504 states, 2503 states have (on average 2.308429884139033) internal successors, (5778), 2503 states have internal predecessors, (5778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:17,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 5778 transitions. [2021-06-04 21:27:17,104 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 5778 transitions. Word has length 147 [2021-06-04 21:27:17,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:17,104 INFO L482 AbstractCegarLoop]: Abstraction has 2504 states and 5778 transitions. [2021-06-04 21:27:17,104 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:17,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 5778 transitions. [2021-06-04 21:27:17,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-06-04 21:27:17,108 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:17,108 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:27:17,325 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-04 21:27:17,325 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:17,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:17,325 INFO L82 PathProgramCache]: Analyzing trace with hash -2056034289, now seen corresponding path program 2 times [2021-06-04 21:27:17,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:17,325 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419263739] [2021-06-04 21:27:17,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:17,412 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:17,412 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:17,412 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419263739] [2021-06-04 21:27:17,412 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419263739] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:27:17,412 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238924083] [2021-06-04 21:27:17,412 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-04 21:27:17,573 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-04 21:27:17,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-04 21:27:17,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-04 21:27:17,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-04 21:27:17,822 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:17,822 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238924083] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:27:17,822 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-04 21:27:17,823 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-04 21:27:17,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657734301] [2021-06-04 21:27:17,823 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-04 21:27:17,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:17,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-04 21:27:17,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-04 21:27:17,824 INFO L87 Difference]: Start difference. First operand 2504 states and 5778 transitions. Second operand has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:17,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:17,877 INFO L93 Difference]: Finished difference Result 3728 states and 8602 transitions. [2021-06-04 21:27:17,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-04 21:27:17,878 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 0 states have call successors, (0), 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 176 [2021-06-04 21:27:17,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:17,883 INFO L225 Difference]: With dead ends: 3728 [2021-06-04 21:27:17,883 INFO L226 Difference]: Without dead ends: 3728 [2021-06-04 21:27:17,883 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 44.5ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-04 21:27:17,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3728 states. [2021-06-04 21:27:17,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3728 to 3134. [2021-06-04 21:27:17,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3134 states, 3133 states have (on average 2.3080114905841045) internal successors, (7231), 3133 states have internal predecessors, (7231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:17,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3134 states to 3134 states and 7231 transitions. [2021-06-04 21:27:17,924 INFO L78 Accepts]: Start accepts. Automaton has 3134 states and 7231 transitions. Word has length 176 [2021-06-04 21:27:17,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:17,925 INFO L482 AbstractCegarLoop]: Abstraction has 3134 states and 7231 transitions. [2021-06-04 21:27:17,925 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:17,925 INFO L276 IsEmpty]: Start isEmpty. Operand 3134 states and 7231 transitions. [2021-06-04 21:27:17,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2021-06-04 21:27:17,930 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:17,930 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:27:18,145 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-04 21:27:18,147 INFO L430 AbstractCegarLoop]: === Iteration 8 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:18,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:18,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1712925649, now seen corresponding path program 3 times [2021-06-04 21:27:18,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:18,148 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806821644] [2021-06-04 21:27:18,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:18,233 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:18,233 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:18,233 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806821644] [2021-06-04 21:27:18,233 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806821644] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:27:18,234 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020885932] [2021-06-04 21:27:18,234 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-04 21:27:18,429 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-04 21:27:18,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-04 21:27:18,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 34 conjunts are in the unsatisfiable core [2021-06-04 21:27:18,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-04 21:27:18,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-04 21:27:18,455 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:18,456 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:18,456 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:27:18,456 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-04 21:27:18,480 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-04 21:27:18,480 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-04 21:27:18,482 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:18,498 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:18,499 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:27:18,499 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-04 21:27:18,628 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-04 21:27:18,629 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:18,631 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:18,632 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:27:18,632 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2021-06-04 21:27:18,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 25 treesize of output 24 [2021-06-04 21:27:18,678 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:18,682 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:18,683 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:27:18,684 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:9 [2021-06-04 21:27:18,759 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-04 21:27:18,766 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-06-04 21:27:18,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2021-06-04 21:27:18,770 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:18,776 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:18,778 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-04 21:27:18,779 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:16 [2021-06-04 21:27:18,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:27:18,827 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 24 [2021-06-04 21:27:18,828 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:18,833 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:18,834 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-04 21:27:18,834 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2021-06-04 21:27:18,842 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 19 treesize of output 7 [2021-06-04 21:27:18,844 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:18,845 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:18,845 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:27:18,845 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:3 [2021-06-04 21:27:18,899 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 44 proven. 41 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-04 21:27:18,899 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020885932] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:27:18,899 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-04 21:27:18,899 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2021-06-04 21:27:18,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116248927] [2021-06-04 21:27:18,900 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-04 21:27:18,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:18,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-04 21:27:18,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2021-06-04 21:27:18,900 INFO L87 Difference]: Start difference. First operand 3134 states and 7231 transitions. Second operand has 19 states, 19 states have (on average 18.0) internal successors, (342), 19 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:20,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:20,132 INFO L93 Difference]: Finished difference Result 7522 states and 17345 transitions. [2021-06-04 21:27:20,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-06-04 21:27:20,132 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 18.0) internal successors, (342), 19 states have internal predecessors, (342), 0 states have call successors, (0), 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 205 [2021-06-04 21:27:20,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:20,142 INFO L225 Difference]: With dead ends: 7522 [2021-06-04 21:27:20,142 INFO L226 Difference]: Without dead ends: 7522 [2021-06-04 21:27:20,143 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1201 ImplicationChecksByTransitivity, 834.7ms TimeCoverageRelationStatistics Valid=979, Invalid=3053, Unknown=0, NotChecked=0, Total=4032 [2021-06-04 21:27:20,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7522 states. [2021-06-04 21:27:20,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7522 to 5384. [2021-06-04 21:27:20,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5384 states, 5383 states have (on average 2.302062047185584) internal successors, (12392), 5383 states have internal predecessors, (12392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:20,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5384 states to 5384 states and 12392 transitions. [2021-06-04 21:27:20,268 INFO L78 Accepts]: Start accepts. Automaton has 5384 states and 12392 transitions. Word has length 205 [2021-06-04 21:27:20,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:20,268 INFO L482 AbstractCegarLoop]: Abstraction has 5384 states and 12392 transitions. [2021-06-04 21:27:20,268 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 18.0) internal successors, (342), 19 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:20,268 INFO L276 IsEmpty]: Start isEmpty. Operand 5384 states and 12392 transitions. [2021-06-04 21:27:20,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2021-06-04 21:27:20,277 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:20,277 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:27:20,494 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-04 21:27:20,495 INFO L430 AbstractCegarLoop]: === Iteration 9 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:20,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:20,495 INFO L82 PathProgramCache]: Analyzing trace with hash 2031920522, now seen corresponding path program 1 times [2021-06-04 21:27:20,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:20,496 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169066891] [2021-06-04 21:27:20,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:20,607 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:20,607 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:20,607 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169066891] [2021-06-04 21:27:20,607 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169066891] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:27:20,607 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062023589] [2021-06-04 21:27:20,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-04 21:27:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:20,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-04 21:27:20,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-04 21:27:21,019 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:21,019 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062023589] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:27:21,019 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-04 21:27:21,019 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-06-04 21:27:21,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563488452] [2021-06-04 21:27:21,020 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-04 21:27:21,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:21,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-04 21:27:21,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-04 21:27:21,021 INFO L87 Difference]: Start difference. First operand 5384 states and 12392 transitions. Second operand has 13 states, 13 states have (on average 21.153846153846153) internal successors, (275), 13 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:21,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:21,130 INFO L93 Difference]: Finished difference Result 7544 states and 17348 transitions. [2021-06-04 21:27:21,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-04 21:27:21,130 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 21.153846153846153) internal successors, (275), 13 states have internal predecessors, (275), 0 states have call successors, (0), 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 238 [2021-06-04 21:27:21,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:21,139 INFO L225 Difference]: With dead ends: 7544 [2021-06-04 21:27:21,139 INFO L226 Difference]: Without dead ends: 7544 [2021-06-04 21:27:21,140 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 93.2ms TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2021-06-04 21:27:21,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7544 states. [2021-06-04 21:27:21,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7544 to 6500. [2021-06-04 21:27:21,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6500 states, 6499 states have (on average 2.3006616402523465) internal successors, (14952), 6499 states have internal predecessors, (14952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:21,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6500 states to 6500 states and 14952 transitions. [2021-06-04 21:27:21,240 INFO L78 Accepts]: Start accepts. Automaton has 6500 states and 14952 transitions. Word has length 238 [2021-06-04 21:27:21,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:21,240 INFO L482 AbstractCegarLoop]: Abstraction has 6500 states and 14952 transitions. [2021-06-04 21:27:21,241 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 21.153846153846153) internal successors, (275), 13 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:21,241 INFO L276 IsEmpty]: Start isEmpty. Operand 6500 states and 14952 transitions. [2021-06-04 21:27:21,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2021-06-04 21:27:21,252 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:21,252 INFO L521 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:27:21,472 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-04 21:27:21,472 INFO L430 AbstractCegarLoop]: === Iteration 10 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:21,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:21,473 INFO L82 PathProgramCache]: Analyzing trace with hash -982607545, now seen corresponding path program 2 times [2021-06-04 21:27:21,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:21,473 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140044224] [2021-06-04 21:27:21,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:21,611 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:21,611 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:21,611 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140044224] [2021-06-04 21:27:21,611 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140044224] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:27:21,611 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142916191] [2021-06-04 21:27:21,611 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 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-04 21:27:21,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-04 21:27:21,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-04 21:27:21,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-04 21:27:21,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-04 21:27:22,142 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:22,143 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142916191] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:27:22,143 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-04 21:27:22,143 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2021-06-04 21:27:22,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911502826] [2021-06-04 21:27:22,144 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-04 21:27:22,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:22,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-04 21:27:22,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-04 21:27:22,144 INFO L87 Difference]: Start difference. First operand 6500 states and 14952 transitions. Second operand has 15 states, 15 states have (on average 20.533333333333335) internal successors, (308), 15 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:22,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:22,272 INFO L93 Difference]: Finished difference Result 8660 states and 19908 transitions. [2021-06-04 21:27:22,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-04 21:27:22,272 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 20.533333333333335) internal successors, (308), 15 states have internal predecessors, (308), 0 states have call successors, (0), 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 271 [2021-06-04 21:27:22,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:22,282 INFO L225 Difference]: With dead ends: 8660 [2021-06-04 21:27:22,283 INFO L226 Difference]: Without dead ends: 8660 [2021-06-04 21:27:22,283 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 124.4ms TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2021-06-04 21:27:22,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8660 states. [2021-06-04 21:27:22,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8660 to 7616. [2021-06-04 21:27:22,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7616 states, 7615 states have (on average 2.299671700590939) internal successors, (17512), 7615 states have internal predecessors, (17512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:22,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7616 states to 7616 states and 17512 transitions. [2021-06-04 21:27:22,381 INFO L78 Accepts]: Start accepts. Automaton has 7616 states and 17512 transitions. Word has length 271 [2021-06-04 21:27:22,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:22,381 INFO L482 AbstractCegarLoop]: Abstraction has 7616 states and 17512 transitions. [2021-06-04 21:27:22,381 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 20.533333333333335) internal successors, (308), 15 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:22,381 INFO L276 IsEmpty]: Start isEmpty. Operand 7616 states and 17512 transitions. [2021-06-04 21:27:22,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2021-06-04 21:27:22,392 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:22,393 INFO L521 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:27:22,608 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-04 21:27:22,609 INFO L430 AbstractCegarLoop]: === Iteration 11 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:22,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:22,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1282714235, now seen corresponding path program 3 times [2021-06-04 21:27:22,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:22,609 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364370693] [2021-06-04 21:27:22,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:22,740 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:22,740 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:22,740 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364370693] [2021-06-04 21:27:22,740 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364370693] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:27:22,740 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962180448] [2021-06-04 21:27:22,740 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 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-04 21:27:22,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-04 21:27:22,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-04 21:27:22,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 52 conjunts are in the unsatisfiable core [2021-06-04 21:27:22,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-04 21:27:22,993 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-04 21:27:22,994 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:22,996 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:22,996 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:27:22,996 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-04 21:27:23,017 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-04 21:27:23,017 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-04 21:27:23,019 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:23,020 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:23,020 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:27:23,020 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-04 21:27:23,235 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-04 21:27:23,236 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:23,239 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:23,240 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:27:23,240 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2021-06-04 21:27:23,265 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 24 [2021-06-04 21:27:23,266 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:23,270 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:23,271 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-04 21:27:23,271 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:14 [2021-06-04 21:27:23,349 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-04 21:27:23,356 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-06-04 21:27:23,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2021-06-04 21:27:23,357 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:23,364 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:23,366 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-04 21:27:23,366 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:20 [2021-06-04 21:27:23,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:27:23,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-06-04 21:27:23,379 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:23,385 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:23,386 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-04 21:27:23,386 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:20 [2021-06-04 21:27:23,446 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 34 treesize of output 18 [2021-06-04 21:27:23,448 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:23,452 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:23,452 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-04 21:27:23,452 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:14 [2021-06-04 21:27:23,484 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 24 [2021-06-04 21:27:23,485 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:23,489 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:23,491 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:27:23,491 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:9 [2021-06-04 21:27:23,586 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-04 21:27:23,595 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-06-04 21:27:23,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 27 [2021-06-04 21:27:23,596 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:23,602 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:23,603 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-04 21:27:23,603 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:16 [2021-06-04 21:27:23,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:27:23,616 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 24 [2021-06-04 21:27:23,617 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:23,622 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:23,623 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-04 21:27:23,623 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2021-06-04 21:27:23,631 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 19 treesize of output 7 [2021-06-04 21:27:23,632 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:23,634 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:23,634 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:27:23,634 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:3 [2021-06-04 21:27:23,693 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 219 proven. 112 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2021-06-04 21:27:23,693 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962180448] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:27:23,693 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-04 21:27:23,693 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 31 [2021-06-04 21:27:23,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902738072] [2021-06-04 21:27:23,694 INFO L462 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-06-04 21:27:23,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:23,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-06-04 21:27:23,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=791, Unknown=0, NotChecked=0, Total=930 [2021-06-04 21:27:23,695 INFO L87 Difference]: Start difference. First operand 7616 states and 17512 transitions. Second operand has 31 states, 31 states have (on average 15.387096774193548) internal successors, (477), 31 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:27,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:27,909 INFO L93 Difference]: Finished difference Result 15670 states and 36047 transitions. [2021-06-04 21:27:27,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2021-06-04 21:27:27,910 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 15.387096774193548) internal successors, (477), 31 states have internal predecessors, (477), 0 states have call successors, (0), 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 300 [2021-06-04 21:27:27,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:27,927 INFO L225 Difference]: With dead ends: 15670 [2021-06-04 21:27:27,928 INFO L226 Difference]: Without dead ends: 15670 [2021-06-04 21:27:27,933 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9915 ImplicationChecksByTransitivity, 3290.5ms TimeCoverageRelationStatistics Valid=4905, Invalid=20217, Unknown=0, NotChecked=0, Total=25122 [2021-06-04 21:27:27,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15670 states. [2021-06-04 21:27:28,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15670 to 11985. [2021-06-04 21:27:28,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11985 states, 11984 states have (on average 2.294809746328438) internal successors, (27501), 11984 states have internal predecessors, (27501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:28,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11985 states to 11985 states and 27501 transitions. [2021-06-04 21:27:28,121 INFO L78 Accepts]: Start accepts. Automaton has 11985 states and 27501 transitions. Word has length 300 [2021-06-04 21:27:28,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:28,121 INFO L482 AbstractCegarLoop]: Abstraction has 11985 states and 27501 transitions. [2021-06-04 21:27:28,121 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 15.387096774193548) internal successors, (477), 31 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:28,121 INFO L276 IsEmpty]: Start isEmpty. Operand 11985 states and 27501 transitions. [2021-06-04 21:27:28,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2021-06-04 21:27:28,148 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:28,148 INFO L521 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:27:28,360 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-04 21:27:28,363 INFO L430 AbstractCegarLoop]: === Iteration 12 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:28,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:28,363 INFO L82 PathProgramCache]: Analyzing trace with hash -732446895, now seen corresponding path program 4 times [2021-06-04 21:27:28,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:28,363 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687828068] [2021-06-04 21:27:28,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:28,552 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:28,552 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:28,553 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687828068] [2021-06-04 21:27:28,553 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687828068] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:27:28,553 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752365214] [2021-06-04 21:27:28,553 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 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-04 21:27:29,099 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-04 21:27:29,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-04 21:27:29,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-04 21:27:29,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-04 21:27:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:29,540 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752365214] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:27:29,540 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-04 21:27:29,540 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2021-06-04 21:27:29,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151495273] [2021-06-04 21:27:29,541 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-04 21:27:29,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:29,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-04 21:27:29,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-06-04 21:27:29,541 INFO L87 Difference]: Start difference. First operand 11985 states and 27501 transitions. Second operand has 19 states, 19 states have (on average 19.68421052631579) internal successors, (374), 19 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:29,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:27:29,743 INFO L93 Difference]: Finished difference Result 15297 states and 35081 transitions. [2021-06-04 21:27:29,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-04 21:27:29,743 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 19.68421052631579) internal successors, (374), 19 states have internal predecessors, (374), 0 states have call successors, (0), 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 337 [2021-06-04 21:27:29,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:27:29,758 INFO L225 Difference]: With dead ends: 15297 [2021-06-04 21:27:29,758 INFO L226 Difference]: Without dead ends: 15297 [2021-06-04 21:27:29,758 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 203.5ms TimeCoverageRelationStatistics Valid=340, Invalid=716, Unknown=0, NotChecked=0, Total=1056 [2021-06-04 21:27:29,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15297 states. [2021-06-04 21:27:29,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15297 to 13695. [2021-06-04 21:27:29,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13695 states, 13694 states have (on average 2.293997371111436) internal successors, (31414), 13694 states have internal predecessors, (31414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:29,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13695 states to 13695 states and 31414 transitions. [2021-06-04 21:27:29,932 INFO L78 Accepts]: Start accepts. Automaton has 13695 states and 31414 transitions. Word has length 337 [2021-06-04 21:27:29,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:27:29,933 INFO L482 AbstractCegarLoop]: Abstraction has 13695 states and 31414 transitions. [2021-06-04 21:27:29,933 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 19.68421052631579) internal successors, (374), 19 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:27:29,933 INFO L276 IsEmpty]: Start isEmpty. Operand 13695 states and 31414 transitions. [2021-06-04 21:27:29,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2021-06-04 21:27:29,950 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:27:29,950 INFO L521 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:27:30,164 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-06-04 21:27:30,165 INFO L430 AbstractCegarLoop]: === Iteration 13 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:27:30,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:27:30,165 INFO L82 PathProgramCache]: Analyzing trace with hash 456225807, now seen corresponding path program 5 times [2021-06-04 21:27:30,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:27:30,165 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592635069] [2021-06-04 21:27:30,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:27:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:27:30,355 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:27:30,355 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:27:30,355 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592635069] [2021-06-04 21:27:30,355 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592635069] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:27:30,356 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279477777] [2021-06-04 21:27:30,356 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 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-04 21:27:31,552 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2021-06-04 21:27:31,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-04 21:27:31,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 134 conjunts are in the unsatisfiable core [2021-06-04 21:27:31,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-04 21:27:31,754 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 0 case distinctions, treesize of input 23 treesize of output 13 [2021-06-04 21:27:31,755 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:31,756 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:31,757 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:27:31,757 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:9 [2021-06-04 21:27:31,789 INFO L354 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2021-06-04 21:27:31,790 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 38 [2021-06-04 21:27:31,792 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:31,799 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:31,800 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-04 21:27:31,800 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:23 [2021-06-04 21:27:32,062 INFO L354 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-06-04 21:27:32,062 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 34 [2021-06-04 21:27:32,066 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:32,069 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-04 21:27:32,080 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-06-04 21:27:32,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2021-06-04 21:27:32,093 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:32,113 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:32,120 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-04 21:27:32,120 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:48 [2021-06-04 21:27:32,164 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-04 21:27:32,165 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:32,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:27:32,170 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 24 [2021-06-04 21:27:32,171 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:32,188 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:32,190 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-04 21:27:32,190 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2021-06-04 21:27:32,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:27:32,309 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 31 treesize of output 15 [2021-06-04 21:27:32,310 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:32,313 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 0 case distinctions, treesize of input 21 treesize of output 11 [2021-06-04 21:27:32,314 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:32,321 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:32,322 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-04 21:27:32,322 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:78, output treesize:35 [2021-06-04 21:27:32,377 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-04 21:27:32,378 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:32,399 INFO L354 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2021-06-04 21:27:32,399 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 38 [2021-06-04 21:27:32,401 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:32,416 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:32,419 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2021-06-04 21:27:32,420 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:48 [2021-06-04 21:27:32,649 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-04 21:27:32,650 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-04 21:27:32,659 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-06-04 21:27:32,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 27 [2021-06-04 21:27:32,660 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:32,673 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-04 21:27:32,673 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2021-06-04 21:27:32,676 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-06-04 21:27:32,694 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:32,703 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-04 21:27:32,703 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2021-06-04 21:27:32,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:27:32,755 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 24 [2021-06-04 21:27:32,756 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:32,760 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-04 21:27:32,761 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:32,779 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:32,781 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-04 21:27:32,781 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2021-06-04 21:27:32,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:27:32,918 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 21 treesize of output 11 [2021-06-04 21:27:32,919 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:32,921 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 0 case distinctions, treesize of input 31 treesize of output 15 [2021-06-04 21:27:32,922 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:32,929 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:32,930 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-04 21:27:32,930 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:78, output treesize:35 [2021-06-04 21:27:33,000 INFO L354 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2021-06-04 21:27:33,000 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 38 [2021-06-04 21:27:33,002 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:33,005 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-04 21:27:33,006 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:33,021 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:33,022 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2021-06-04 21:27:33,022 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:48 [2021-06-04 21:27:33,297 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-04 21:27:33,297 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2021-06-04 21:27:33,299 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-04 21:27:33,305 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-04 21:27:33,313 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-06-04 21:27:33,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 27 [2021-06-04 21:27:33,315 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:33,339 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:33,341 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-04 21:27:33,341 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2021-06-04 21:27:33,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:27:33,398 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 24 [2021-06-04 21:27:33,399 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:33,403 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-04 21:27:33,404 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:33,421 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:33,423 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-04 21:27:33,423 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2021-06-04 21:27:33,576 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 0 case distinctions, treesize of input 23 treesize of output 13 [2021-06-04 21:27:33,578 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:33,586 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:33,587 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:27:33,587 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:34 [2021-06-04 21:27:33,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:27:33,635 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 24 [2021-06-04 21:27:33,636 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:33,642 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:33,643 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-04 21:27:33,643 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2021-06-04 21:27:33,905 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-04 21:27:33,912 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-06-04 21:27:33,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2021-06-04 21:27:33,913 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:33,924 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:33,925 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-04 21:27:33,925 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2021-06-04 21:27:33,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:27:33,941 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 24 [2021-06-04 21:27:33,942 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:33,953 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:33,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-04 21:27:33,955 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2021-06-04 21:27:34,087 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 0 case distinctions, treesize of input 31 treesize of output 15 [2021-06-04 21:27:34,088 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:34,095 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:34,096 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:27:34,096 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:34 [2021-06-04 21:27:34,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:27:34,160 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 24 [2021-06-04 21:27:34,161 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:34,169 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:34,170 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-04 21:27:34,170 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2021-06-04 21:27:34,462 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-04 21:27:34,469 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-06-04 21:27:34,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2021-06-04 21:27:34,470 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:34,484 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:34,485 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-04 21:27:34,485 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2021-06-04 21:27:34,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:27:34,500 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 24 [2021-06-04 21:27:34,501 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:34,511 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:34,512 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-04 21:27:34,513 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2021-06-04 21:27:34,653 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 0 case distinctions, treesize of input 31 treesize of output 15 [2021-06-04 21:27:34,654 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:34,659 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:34,660 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:27:34,660 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:34 [2021-06-04 21:27:34,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:27:34,741 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 29 [2021-06-04 21:27:34,742 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:34,747 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:34,748 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-04 21:27:34,748 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:9 [2021-06-04 21:27:34,938 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-06-04 21:27:34,938 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 34 treesize of output 27 [2021-06-04 21:27:34,939 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:34,943 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:34,944 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-04 21:27:34,944 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:9 [2021-06-04 21:27:34,958 INFO L354 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2021-06-04 21:27:34,958 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-04 21:27:34,959 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:34,962 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:34,963 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-04 21:27:34,963 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:9 [2021-06-04 21:27:34,970 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 19 treesize of output 7 [2021-06-04 21:27:34,971 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:27:34,972 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:27:34,972 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-04 21:27:34,972 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2021-06-04 21:27:35,052 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 540 proven. 267 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-04 21:27:35,053 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279477777] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:27:35,053 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-04 21:27:35,053 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 53] total 70 [2021-06-04 21:27:35,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245607183] [2021-06-04 21:27:35,053 INFO L462 AbstractCegarLoop]: Interpolant automaton has 70 states [2021-06-04 21:27:35,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:27:35,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2021-06-04 21:27:35,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=462, Invalid=4368, Unknown=0, NotChecked=0, Total=4830 [2021-06-04 21:27:35,055 INFO L87 Difference]: Start difference. First operand 13695 states and 31414 transitions. Second operand has 70 states, 70 states have (on average 8.857142857142858) internal successors, (620), 70 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:28:05,321 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2021-06-04 21:28:05,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:28:05,898 INFO L93 Difference]: Finished difference Result 41102 states and 95045 transitions. [2021-06-04 21:28:05,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 497 states. [2021-06-04 21:28:05,898 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 8.857142857142858) internal successors, (620), 70 states have internal predecessors, (620), 0 states have call successors, (0), 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 366 [2021-06-04 21:28:05,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:28:05,932 INFO L225 Difference]: With dead ends: 41102 [2021-06-04 21:28:05,932 INFO L226 Difference]: Without dead ends: 41102 [2021-06-04 21:28:05,945 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 1360 GetRequests, 790 SyntacticMatches, 14 SemanticMatches, 556 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143689 ImplicationChecksByTransitivity, 26423.8ms TimeCoverageRelationStatistics Valid=25780, Invalid=285026, Unknown=0, NotChecked=0, Total=310806 [2021-06-04 21:28:05,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41102 states. [2021-06-04 21:28:06,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41102 to 29529. [2021-06-04 21:28:06,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29529 states, 29528 states have (on average 2.2999525873746953) internal successors, (67913), 29528 states have internal predecessors, (67913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:28:06,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29529 states to 29529 states and 67913 transitions. [2021-06-04 21:28:06,415 INFO L78 Accepts]: Start accepts. Automaton has 29529 states and 67913 transitions. Word has length 366 [2021-06-04 21:28:06,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:28:06,415 INFO L482 AbstractCegarLoop]: Abstraction has 29529 states and 67913 transitions. [2021-06-04 21:28:06,416 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 70 states, 70 states have (on average 8.857142857142858) internal successors, (620), 70 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:28:06,416 INFO L276 IsEmpty]: Start isEmpty. Operand 29529 states and 67913 transitions. [2021-06-04 21:28:06,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2021-06-04 21:28:06,447 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:28:06,447 INFO L521 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:28:06,667 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-04 21:28:06,667 INFO L430 AbstractCegarLoop]: === Iteration 14 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:28:06,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:28:06,668 INFO L82 PathProgramCache]: Analyzing trace with hash -2081651508, now seen corresponding path program 6 times [2021-06-04 21:28:06,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:28:06,668 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351416066] [2021-06-04 21:28:06,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:28:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:28:06,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 0 proven. 1053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:28:06,872 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:28:06,872 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351416066] [2021-06-04 21:28:06,872 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351416066] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:28:06,872 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976273003] [2021-06-04 21:28:06,872 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 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-04 21:28:07,161 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-06-04 21:28:07,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-04 21:28:07,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 55 conjunts are in the unsatisfiable core [2021-06-04 21:28:07,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-04 21:28:07,206 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-04 21:28:07,207 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:07,208 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:07,208 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:28:07,208 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-04 21:28:07,233 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-04 21:28:07,233 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-04 21:28:07,234 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:07,238 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:07,238 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:28:07,238 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2021-06-04 21:28:07,256 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 7 treesize of output 6 [2021-06-04 21:28:07,256 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:07,261 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:07,261 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:28:07,262 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2021-06-04 21:28:07,307 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-04 21:28:07,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-06-04 21:28:07,308 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:07,316 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:07,316 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:28:07,316 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:34 [2021-06-04 21:28:07,361 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-04 21:28:07,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2021-06-04 21:28:07,366 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:07,374 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:07,374 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:28:07,374 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:31 [2021-06-04 21:28:07,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2021-06-04 21:28:07,463 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:07,473 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:07,474 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:28:07,474 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:42 [2021-06-04 21:28:07,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2021-06-04 21:28:07,499 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:07,508 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:07,509 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:28:07,509 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:42 [2021-06-04 21:28:07,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2021-06-04 21:28:07,532 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:07,540 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:07,541 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:28:07,541 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:36 [2021-06-04 21:28:07,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2021-06-04 21:28:07,632 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 8 treesize of output 7 [2021-06-04 21:28:07,633 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:07,636 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:07,636 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:28:07,645 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:07,646 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-04 21:28:07,646 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:19 [2021-06-04 21:28:07,757 INFO L354 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2021-06-04 21:28:07,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 41 [2021-06-04 21:28:07,833 INFO L354 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2021-06-04 21:28:07,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 41 [2021-06-04 21:28:07,865 INFO L354 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2021-06-04 21:28:07,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 41 [2021-06-04 21:28:07,896 INFO L354 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2021-06-04 21:28:07,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 41 [2021-06-04 21:28:07,932 INFO L354 Elim1Store]: treesize reduction 24, result has 42.9 percent of original size [2021-06-04 21:28:07,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2021-06-04 21:28:08,037 INFO L354 Elim1Store]: treesize reduction 24, result has 42.9 percent of original size [2021-06-04 21:28:08,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2021-06-04 21:28:08,075 INFO L354 Elim1Store]: treesize reduction 24, result has 42.9 percent of original size [2021-06-04 21:28:08,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2021-06-04 21:28:08,120 INFO L354 Elim1Store]: treesize reduction 24, result has 42.9 percent of original size [2021-06-04 21:28:08,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 48 [2021-06-04 21:28:08,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:28:08,205 INFO L354 Elim1Store]: treesize reduction 37, result has 11.9 percent of original size [2021-06-04 21:28:08,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 36 [2021-06-04 21:28:08,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:28:08,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:28:08,227 INFO L354 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2021-06-04 21:28:08,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 27 treesize of output 45 [2021-06-04 21:28:08,231 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:08,239 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:08,240 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:28:08,254 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:08,256 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-04 21:28:08,256 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:28 [2021-06-04 21:28:08,304 INFO L354 Elim1Store]: treesize reduction 28, result has 15.2 percent of original size [2021-06-04 21:28:08,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 27 [2021-06-04 21:28:08,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 18 treesize of output 13 [2021-06-04 21:28:08,308 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:08,311 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:08,312 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:28:08,317 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:08,318 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-04 21:28:08,318 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:28 [2021-06-04 21:28:08,386 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-06-04 21:28:08,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 42 [2021-06-04 21:28:08,424 WARN L860 $PredicateComparison]: unable to prove that (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (exists ((|v_#memory_int_98| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#id2~0.offset| Int) (|ULTIMATE.start_main_~#id2~0.base| Int) (t1Thread1of1ForFork0_enqueue_~q.offset Int) (|ULTIMATE.start_main_#t~pre65| Int) (t1Thread1of1ForFork0_enqueue_~q.base Int)) (and (not (= |c_~#stored_elements~0.base| |ULTIMATE.start_main_~#id2~0.base|)) (= |c_#memory_int| (store |v_#memory_int_98| |ULTIMATE.start_main_~#id2~0.base| (store (select |v_#memory_int_98| |ULTIMATE.start_main_~#id2~0.base|) |ULTIMATE.start_main_~#id2~0.offset| |ULTIMATE.start_main_#t~pre65|))) (not (= |c_~#queue~0.base| |ULTIMATE.start_main_~#id2~0.base|)) (= ((as const (Array Int Int)) 0) (select |v_#memory_int_98| |c_~#queue~0.base|)) (= (select (select |v_#memory_int_98| t1Thread1of1ForFork0_enqueue_~q.base) (+ t1Thread1of1ForFork0_enqueue_~q.offset 3204)) 1)))) is different from true [2021-06-04 21:28:08,451 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-06-04 21:28:08,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 42 [2021-06-04 21:28:08,498 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-06-04 21:28:08,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 42 [2021-06-04 21:28:08,540 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-06-04 21:28:08,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 42 [2021-06-04 21:28:08,584 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-06-04 21:28:08,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 42 [2021-06-04 21:28:08,622 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-06-04 21:28:08,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 42 [2021-06-04 21:28:08,662 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-06-04 21:28:08,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 42 [2021-06-04 21:28:08,713 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-06-04 21:28:08,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 57 [2021-06-04 21:28:08,745 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_#memory_int_98| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#id2~0.offset| Int) (|ULTIMATE.start_main_~#id2~0.base| Int) (t1Thread1of1ForFork0_enqueue_~q.offset Int) (|ULTIMATE.start_main_#t~pre65| Int) (t1Thread1of1ForFork0_~i~0 Int) (t1Thread1of1ForFork0_enqueue_~q.base Int) (|~#stored_elements~0.base| Int) (|~#stored_elements~0.offset| Int) (t1Thread1of1ForFork0_~value~0 Int)) (and (not (= |c_~#queue~0.base| |~#stored_elements~0.base|)) (not (= |~#stored_elements~0.base| |ULTIMATE.start_main_~#id2~0.base|)) (not (= |c_~#queue~0.base| |ULTIMATE.start_main_~#id2~0.base|)) (= ((as const (Array Int Int)) 0) (select |v_#memory_int_98| |c_~#queue~0.base|)) (= (select (select |v_#memory_int_98| t1Thread1of1ForFork0_enqueue_~q.base) (+ t1Thread1of1ForFork0_enqueue_~q.offset 3204)) 1) (= |c_#memory_int| (let ((.cse0 (store |v_#memory_int_98| |ULTIMATE.start_main_~#id2~0.base| (store (select |v_#memory_int_98| |ULTIMATE.start_main_~#id2~0.base|) |ULTIMATE.start_main_~#id2~0.offset| |ULTIMATE.start_main_#t~pre65|)))) (store .cse0 |~#stored_elements~0.base| (store (select .cse0 |~#stored_elements~0.base|) (+ (* t1Thread1of1ForFork0_~i~0 4) |~#stored_elements~0.offset|) t1Thread1of1ForFork0_~value~0)))))) is different from true [2021-06-04 21:28:08,774 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-06-04 21:28:08,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 57 [2021-06-04 21:28:08,846 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-06-04 21:28:08,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 57 [2021-06-04 21:28:08,903 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-06-04 21:28:08,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 57 [2021-06-04 21:28:08,961 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-06-04 21:28:08,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 57 [2021-06-04 21:28:09,021 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-06-04 21:28:09,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 57 [2021-06-04 21:28:09,079 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-06-04 21:28:09,079 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 57 [2021-06-04 21:28:09,137 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-06-04 21:28:09,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 57 [2021-06-04 21:28:09,195 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-06-04 21:28:09,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 57 [2021-06-04 21:28:09,228 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_#memory_int_98| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#id2~0.offset| Int) (|ULTIMATE.start_main_~#id2~0.base| Int) (t1Thread1of1ForFork0_enqueue_~q.offset Int) (|ULTIMATE.start_main_#t~pre65| Int) (t1Thread1of1ForFork0_~i~0 Int) (t1Thread1of1ForFork0_enqueue_~q.base Int) (|~#stored_elements~0.base| Int) (|~#stored_elements~0.offset| Int) (t1Thread1of1ForFork0_~value~0 Int)) (and (not (= |~#stored_elements~0.base| |ULTIMATE.start_main_~#id2~0.base|)) (not (= |~#stored_elements~0.base| |c_t1Thread1of1ForFork0_enqueue_#in~q.base|)) (= (select (select |v_#memory_int_98| t1Thread1of1ForFork0_enqueue_~q.base) (+ t1Thread1of1ForFork0_enqueue_~q.offset 3204)) 1) (= ((as const (Array Int Int)) 0) (select |v_#memory_int_98| |c_t1Thread1of1ForFork0_enqueue_#in~q.base|)) (= |c_#memory_int| (let ((.cse0 (store |v_#memory_int_98| |ULTIMATE.start_main_~#id2~0.base| (store (select |v_#memory_int_98| |ULTIMATE.start_main_~#id2~0.base|) |ULTIMATE.start_main_~#id2~0.offset| |ULTIMATE.start_main_#t~pre65|)))) (store .cse0 |~#stored_elements~0.base| (store (select .cse0 |~#stored_elements~0.base|) (+ (* t1Thread1of1ForFork0_~i~0 4) |~#stored_elements~0.offset|) t1Thread1of1ForFork0_~value~0)))) (not (= |c_t1Thread1of1ForFork0_enqueue_#in~q.base| |ULTIMATE.start_main_~#id2~0.base|)))) is different from true [2021-06-04 21:28:09,256 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-06-04 21:28:09,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 57 [2021-06-04 21:28:09,311 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-06-04 21:28:09,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 57 [2021-06-04 21:28:09,343 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:28:09,343 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:28:09,370 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-06-04 21:28:09,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 57 [2021-06-04 21:28:09,399 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_#memory_int_98| (Array Int (Array Int Int))) (|ULTIMATE.start_main_~#id2~0.offset| Int) (|ULTIMATE.start_main_~#id2~0.base| Int) (|ULTIMATE.start_main_#t~pre65| Int) (t1Thread1of1ForFork0_~i~0 Int) (v_t1Thread1of1ForFork0_enqueue_~q.base_23 Int) (|~#stored_elements~0.base| Int) (v_t1Thread1of1ForFork0_enqueue_~q.offset_23 Int) (|~#stored_elements~0.offset| Int) (t1Thread1of1ForFork0_~value~0 Int)) (and (not (= |~#stored_elements~0.base| |ULTIMATE.start_main_~#id2~0.base|)) (not (= c_t1Thread1of1ForFork0_enqueue_~q.base |ULTIMATE.start_main_~#id2~0.base|)) (= (select (select |v_#memory_int_98| v_t1Thread1of1ForFork0_enqueue_~q.base_23) (+ v_t1Thread1of1ForFork0_enqueue_~q.offset_23 3204)) 1) (not (= c_t1Thread1of1ForFork0_enqueue_~q.base |~#stored_elements~0.base|)) (= ((as const (Array Int Int)) 0) (select |v_#memory_int_98| c_t1Thread1of1ForFork0_enqueue_~q.base)) (= |c_#memory_int| (let ((.cse0 (store |v_#memory_int_98| |ULTIMATE.start_main_~#id2~0.base| (store (select |v_#memory_int_98| |ULTIMATE.start_main_~#id2~0.base|) |ULTIMATE.start_main_~#id2~0.offset| |ULTIMATE.start_main_#t~pre65|)))) (store .cse0 |~#stored_elements~0.base| (store (select .cse0 |~#stored_elements~0.base|) (+ (* t1Thread1of1ForFork0_~i~0 4) |~#stored_elements~0.offset|) t1Thread1of1ForFork0_~value~0)))))) is different from true [2021-06-04 21:28:09,426 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-06-04 21:28:09,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 57 [2021-06-04 21:28:09,481 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-06-04 21:28:09,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 57 [2021-06-04 21:28:09,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:28:09,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:28:09,602 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-06-04 21:28:09,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 88 [2021-06-04 21:28:09,642 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_#memory_int_98| (Array Int (Array Int Int))) (|t1Thread1of1ForFork0_enqueue_#t~mem40| Int) (t1Thread1of1ForFork0_~i~0 Int) (t1Thread1of1ForFork0_enqueue_~x Int) (v_t1Thread1of1ForFork0_enqueue_~q.base_23 Int) (|~#stored_elements~0.base| Int) (|ULTIMATE.start_main_~#id2~0.offset| Int) (|ULTIMATE.start_main_~#id2~0.base| Int) (|ULTIMATE.start_main_#t~pre65| Int) (v_t1Thread1of1ForFork0_enqueue_~q.offset_23 Int) (|~#stored_elements~0.offset| Int) (t1Thread1of1ForFork0_~value~0 Int)) (let ((.cse1 (let ((.cse2 (store |v_#memory_int_98| |ULTIMATE.start_main_~#id2~0.base| (store (select |v_#memory_int_98| |ULTIMATE.start_main_~#id2~0.base|) |ULTIMATE.start_main_~#id2~0.offset| |ULTIMATE.start_main_#t~pre65|)))) (store .cse2 |~#stored_elements~0.base| (store (select .cse2 |~#stored_elements~0.base|) (+ (* t1Thread1of1ForFork0_~i~0 4) |~#stored_elements~0.offset|) t1Thread1of1ForFork0_~value~0))))) (let ((.cse0 (select .cse1 c_t1Thread1of1ForFork0_enqueue_~q.base))) (and (not (= |~#stored_elements~0.base| |ULTIMATE.start_main_~#id2~0.base|)) (not (= c_t1Thread1of1ForFork0_enqueue_~q.base |ULTIMATE.start_main_~#id2~0.base|)) (= (select (select |v_#memory_int_98| v_t1Thread1of1ForFork0_enqueue_~q.base_23) (+ v_t1Thread1of1ForFork0_enqueue_~q.offset_23 3204)) 1) (not (= c_t1Thread1of1ForFork0_enqueue_~q.base |~#stored_elements~0.base|)) (<= |t1Thread1of1ForFork0_enqueue_#t~mem40| (select .cse0 (+ c_t1Thread1of1ForFork0_enqueue_~q.offset 3204))) (= ((as const (Array Int Int)) 0) (select |v_#memory_int_98| c_t1Thread1of1ForFork0_enqueue_~q.base)) (= |c_#memory_int| (store .cse1 c_t1Thread1of1ForFork0_enqueue_~q.base (store .cse0 (+ (* |t1Thread1of1ForFork0_enqueue_#t~mem40| 4) c_t1Thread1of1ForFork0_enqueue_~q.offset) t1Thread1of1ForFork0_enqueue_~x))))))) is different from true [2021-06-04 21:28:09,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:28:09,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:28:09,686 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-06-04 21:28:09,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 88 [2021-06-04 21:28:09,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:28:09,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:28:09,771 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-06-04 21:28:09,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 88 [2021-06-04 21:28:09,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:28:09,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:28:09,858 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-06-04 21:28:09,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 88 [2021-06-04 21:28:09,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:28:09,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:28:09,957 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-06-04 21:28:09,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 95 [2021-06-04 21:28:10,113 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_#memory_int_98| (Array Int (Array Int Int))) (|t1Thread1of1ForFork0_enqueue_#t~mem40| Int) (t1Thread1of1ForFork0_~i~0 Int) (t1Thread1of1ForFork0_enqueue_~x Int) (v_t1Thread1of1ForFork0_enqueue_~q.base_23 Int) (|~#stored_elements~0.base| Int) (|ULTIMATE.start_main_~#id2~0.offset| Int) (|t1Thread1of1ForFork0_enqueue_#t~post42| Int) (|ULTIMATE.start_main_~#id2~0.base| Int) (|ULTIMATE.start_main_#t~pre65| Int) (v_t1Thread1of1ForFork0_enqueue_~q.offset_23 Int) (|~#stored_elements~0.offset| Int) (t1Thread1of1ForFork0_~value~0 Int)) (let ((.cse1 (let ((.cse2 (store |v_#memory_int_98| |ULTIMATE.start_main_~#id2~0.base| (store (select |v_#memory_int_98| |ULTIMATE.start_main_~#id2~0.base|) |ULTIMATE.start_main_~#id2~0.offset| |ULTIMATE.start_main_#t~pre65|)))) (store .cse2 |~#stored_elements~0.base| (store (select .cse2 |~#stored_elements~0.base|) (+ (* t1Thread1of1ForFork0_~i~0 4) |~#stored_elements~0.offset|) t1Thread1of1ForFork0_~value~0))))) (let ((.cse0 (select .cse1 c_t1Thread1of1ForFork0_enqueue_~q.base))) (and (not (= |~#stored_elements~0.base| |ULTIMATE.start_main_~#id2~0.base|)) (not (= c_t1Thread1of1ForFork0_enqueue_~q.base |ULTIMATE.start_main_~#id2~0.base|)) (= (select (select |v_#memory_int_98| v_t1Thread1of1ForFork0_enqueue_~q.base_23) (+ v_t1Thread1of1ForFork0_enqueue_~q.offset_23 3204)) 1) (not (= c_t1Thread1of1ForFork0_enqueue_~q.base |~#stored_elements~0.base|)) (<= |t1Thread1of1ForFork0_enqueue_#t~mem40| (select .cse0 (+ c_t1Thread1of1ForFork0_enqueue_~q.offset 3204))) (= (store .cse1 c_t1Thread1of1ForFork0_enqueue_~q.base (store (store .cse0 (+ (* |t1Thread1of1ForFork0_enqueue_#t~mem40| 4) c_t1Thread1of1ForFork0_enqueue_~q.offset) t1Thread1of1ForFork0_enqueue_~x) (+ c_t1Thread1of1ForFork0_enqueue_~q.offset 3208) (+ |t1Thread1of1ForFork0_enqueue_#t~post42| 1))) |c_#memory_int|) (= ((as const (Array Int Int)) 0) (select |v_#memory_int_98| c_t1Thread1of1ForFork0_enqueue_~q.base)))))) is different from true [2021-06-04 21:28:10,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:28:10,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:28:10,165 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-06-04 21:28:10,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 95 [2021-06-04 21:28:10,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:28:10,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:28:10,254 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-06-04 21:28:10,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 95 [2021-06-04 21:28:10,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:28:10,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:28:10,334 INFO L354 Elim1Store]: treesize reduction 21, result has 46.2 percent of original size [2021-06-04 21:28:10,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 84 [2021-06-04 21:28:10,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 338 proven. 2 refuted. 0 times theorem prover too weak. 696 trivial. 17 not checked. [2021-06-04 21:28:10,642 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976273003] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:28:10,642 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-04 21:28:10,642 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 44 [2021-06-04 21:28:10,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452163736] [2021-06-04 21:28:10,643 INFO L462 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-06-04 21:28:10,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:28:10,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-06-04 21:28:10,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1221, Unknown=26, NotChecked=462, Total=1892 [2021-06-04 21:28:10,643 INFO L87 Difference]: Start difference. First operand 29529 states and 67913 transitions. Second operand has 44 states, 44 states have (on average 12.204545454545455) internal successors, (537), 44 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:28:16,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:28:16,158 INFO L93 Difference]: Finished difference Result 40150 states and 92428 transitions. [2021-06-04 21:28:16,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2021-06-04 21:28:16,159 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 12.204545454545455) internal successors, (537), 44 states have internal predecessors, (537), 0 states have call successors, (0), 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 399 [2021-06-04 21:28:16,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:28:16,215 INFO L225 Difference]: With dead ends: 40150 [2021-06-04 21:28:16,215 INFO L226 Difference]: Without dead ends: 40150 [2021-06-04 21:28:16,216 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 375 SyntacticMatches, 3 SemanticMatches, 111 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 3503 ImplicationChecksByTransitivity, 3446.8ms TimeCoverageRelationStatistics Valid=2086, Invalid=8916, Unknown=364, NotChecked=1290, Total=12656 [2021-06-04 21:28:16,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40150 states. [2021-06-04 21:28:16,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40150 to 34322. [2021-06-04 21:28:16,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34322 states, 34321 states have (on average 2.2992337053116167) internal successors, (78912), 34321 states have internal predecessors, (78912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:28:16,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34322 states to 34322 states and 78912 transitions. [2021-06-04 21:28:16,714 INFO L78 Accepts]: Start accepts. Automaton has 34322 states and 78912 transitions. Word has length 399 [2021-06-04 21:28:16,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:28:16,714 INFO L482 AbstractCegarLoop]: Abstraction has 34322 states and 78912 transitions. [2021-06-04 21:28:16,715 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 44 states, 44 states have (on average 12.204545454545455) internal successors, (537), 44 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:28:16,715 INFO L276 IsEmpty]: Start isEmpty. Operand 34322 states and 78912 transitions. [2021-06-04 21:28:16,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2021-06-04 21:28:16,749 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:28:16,749 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:28:16,966 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-04 21:28:16,966 INFO L430 AbstractCegarLoop]: === Iteration 15 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:28:16,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:28:16,966 INFO L82 PathProgramCache]: Analyzing trace with hash -422652689, now seen corresponding path program 7 times [2021-06-04 21:28:16,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:28:16,967 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353969664] [2021-06-04 21:28:16,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:28:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:28:17,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 0 proven. 1327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:28:17,195 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:28:17,195 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353969664] [2021-06-04 21:28:17,195 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353969664] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:28:17,195 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795889414] [2021-06-04 21:28:17,195 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 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-04 21:28:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:28:17,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 22 conjunts are in the unsatisfiable core [2021-06-04 21:28:17,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-04 21:28:17,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 0 proven. 1327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:28:17,928 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795889414] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:28:17,928 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-04 21:28:17,929 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2021-06-04 21:28:17,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991394260] [2021-06-04 21:28:17,930 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-04 21:28:17,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:28:17,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-04 21:28:17,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2021-06-04 21:28:17,931 INFO L87 Difference]: Start difference. First operand 34322 states and 78912 transitions. Second operand has 25 states, 25 states have (on average 18.76) internal successors, (469), 25 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:28:18,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:28:18,312 INFO L93 Difference]: Finished difference Result 43276 states and 99418 transitions. [2021-06-04 21:28:18,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-06-04 21:28:18,313 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 18.76) internal successors, (469), 25 states have internal predecessors, (469), 0 states have call successors, (0), 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 432 [2021-06-04 21:28:18,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:28:18,353 INFO L225 Difference]: With dead ends: 43276 [2021-06-04 21:28:18,354 INFO L226 Difference]: Without dead ends: 43276 [2021-06-04 21:28:18,354 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 350.9ms TimeCoverageRelationStatistics Valid=631, Invalid=1349, Unknown=0, NotChecked=0, Total=1980 [2021-06-04 21:28:18,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43276 states. [2021-06-04 21:28:18,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43276 to 38943. [2021-06-04 21:28:18,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38943 states, 38942 states have (on average 2.2981100097581018) internal successors, (89493), 38942 states have internal predecessors, (89493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:28:18,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38943 states to 38943 states and 89493 transitions. [2021-06-04 21:28:18,875 INFO L78 Accepts]: Start accepts. Automaton has 38943 states and 89493 transitions. Word has length 432 [2021-06-04 21:28:18,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:28:18,875 INFO L482 AbstractCegarLoop]: Abstraction has 38943 states and 89493 transitions. [2021-06-04 21:28:18,875 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 18.76) internal successors, (469), 25 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:28:18,875 INFO L276 IsEmpty]: Start isEmpty. Operand 38943 states and 89493 transitions. [2021-06-04 21:28:18,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2021-06-04 21:28:18,909 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:28:18,909 INFO L521 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:28:19,109 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable246 [2021-06-04 21:28:19,110 INFO L430 AbstractCegarLoop]: === Iteration 16 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:28:19,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:28:19,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1678291734, now seen corresponding path program 8 times [2021-06-04 21:28:19,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:28:19,110 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107425957] [2021-06-04 21:28:19,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:28:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:28:19,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1634 backedges. 0 proven. 1634 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:28:19,371 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:28:19,371 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107425957] [2021-06-04 21:28:19,371 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107425957] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:28:19,371 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78520796] [2021-06-04 21:28:19,372 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 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-04 21:28:19,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-04 21:28:19,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-04 21:28:19,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 24 conjunts are in the unsatisfiable core [2021-06-04 21:28:19,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-04 21:28:20,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1634 backedges. 0 proven. 1634 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:28:20,051 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78520796] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:28:20,051 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-04 21:28:20,051 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 27 [2021-06-04 21:28:20,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099680477] [2021-06-04 21:28:20,052 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-04 21:28:20,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:28:20,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-04 21:28:20,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2021-06-04 21:28:20,052 INFO L87 Difference]: Start difference. First operand 38943 states and 89493 transitions. Second operand has 27 states, 27 states have (on average 18.59259259259259) internal successors, (502), 27 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:28:20,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:28:20,491 INFO L93 Difference]: Finished difference Result 47897 states and 109999 transitions. [2021-06-04 21:28:20,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-04 21:28:20,492 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 18.59259259259259) internal successors, (502), 27 states have internal predecessors, (502), 0 states have call successors, (0), 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 465 [2021-06-04 21:28:20,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:28:20,534 INFO L225 Difference]: With dead ends: 47897 [2021-06-04 21:28:20,534 INFO L226 Difference]: Without dead ends: 47897 [2021-06-04 21:28:20,534 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 402.3ms TimeCoverageRelationStatistics Valid=748, Invalid=1604, Unknown=0, NotChecked=0, Total=2352 [2021-06-04 21:28:20,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47897 states. [2021-06-04 21:28:21,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47897 to 43564. [2021-06-04 21:28:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43564 states, 43563 states have (on average 2.297224709042077) internal successors, (100074), 43563 states have internal predecessors, (100074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:28:21,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43564 states to 43564 states and 100074 transitions. [2021-06-04 21:28:21,269 INFO L78 Accepts]: Start accepts. Automaton has 43564 states and 100074 transitions. Word has length 465 [2021-06-04 21:28:21,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:28:21,270 INFO L482 AbstractCegarLoop]: Abstraction has 43564 states and 100074 transitions. [2021-06-04 21:28:21,270 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 18.59259259259259) internal successors, (502), 27 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:28:21,270 INFO L276 IsEmpty]: Start isEmpty. Operand 43564 states and 100074 transitions. [2021-06-04 21:28:21,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2021-06-04 21:28:21,308 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:28:21,308 INFO L521 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:28:21,510 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable247,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-04 21:28:21,511 INFO L430 AbstractCegarLoop]: === Iteration 17 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:28:21,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:28:21,511 INFO L82 PathProgramCache]: Analyzing trace with hash -2065731611, now seen corresponding path program 9 times [2021-06-04 21:28:21,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:28:21,511 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047082540] [2021-06-04 21:28:21,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:28:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:28:21,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 0 proven. 1974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:28:21,789 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:28:21,789 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047082540] [2021-06-04 21:28:21,789 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047082540] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:28:21,789 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560540694] [2021-06-04 21:28:21,789 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 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-04 21:28:25,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-06-04 21:28:25,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-04 21:28:25,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 105 conjunts are in the unsatisfiable core [2021-06-04 21:28:25,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-04 21:28:25,102 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-04 21:28:25,102 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:25,103 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:25,104 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:28:25,104 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-04 21:28:25,131 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-04 21:28:25,131 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-04 21:28:25,132 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:25,135 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:25,135 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:28:25,135 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2021-06-04 21:28:25,539 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-04 21:28:25,552 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:25,556 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:25,557 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:28:25,557 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2021-06-04 21:28:25,598 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 24 [2021-06-04 21:28:25,599 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:25,604 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:25,605 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-04 21:28:25,605 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2021-06-04 21:28:25,695 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-04 21:28:25,702 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-06-04 21:28:25,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2021-06-04 21:28:25,703 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:25,711 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:25,712 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-04 21:28:25,712 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:23 [2021-06-04 21:28:25,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:28:25,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-06-04 21:28:25,723 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:25,729 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:25,730 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-04 21:28:25,730 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:23 [2021-06-04 21:28:25,841 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 31 treesize of output 15 [2021-06-04 21:28:25,842 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:25,845 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:25,845 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:28:25,846 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:17 [2021-06-04 21:28:25,878 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 24 [2021-06-04 21:28:25,879 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:25,884 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:25,884 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-04 21:28:25,884 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2021-06-04 21:28:25,979 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-04 21:28:25,985 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-06-04 21:28:25,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 31 treesize of output 27 [2021-06-04 21:28:25,986 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:25,992 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:25,993 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-04 21:28:25,993 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:23 [2021-06-04 21:28:26,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:28:26,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-06-04 21:28:26,007 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:26,014 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:26,015 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-04 21:28:26,015 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:23 [2021-06-04 21:28:26,143 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 31 treesize of output 15 [2021-06-04 21:28:26,144 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:26,147 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:26,148 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:28:26,148 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:17 [2021-06-04 21:28:26,185 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 24 [2021-06-04 21:28:26,186 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:26,191 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:26,192 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-04 21:28:26,192 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2021-06-04 21:28:26,310 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-04 21:28:26,316 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-06-04 21:28:26,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 31 treesize of output 27 [2021-06-04 21:28:26,318 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:26,333 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:26,334 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-04 21:28:26,334 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:23 [2021-06-04 21:28:26,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:28:26,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-06-04 21:28:26,347 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:26,355 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:26,356 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-04 21:28:26,357 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:23 [2021-06-04 21:28:26,503 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 31 treesize of output 15 [2021-06-04 21:28:26,504 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:26,507 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:26,508 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:28:26,508 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:17 [2021-06-04 21:28:26,553 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 24 [2021-06-04 21:28:26,554 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:26,560 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:26,561 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:28:26,561 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:13 [2021-06-04 21:28:26,726 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-04 21:28:26,734 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-06-04 21:28:26,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 27 [2021-06-04 21:28:26,735 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:26,742 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:26,743 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-04 21:28:26,743 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:19 [2021-06-04 21:28:26,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:28:26,755 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 24 [2021-06-04 21:28:26,756 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:26,762 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:26,763 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-04 21:28:26,763 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:19 [2021-06-04 21:28:26,770 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 19 treesize of output 7 [2021-06-04 21:28:26,771 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:28:26,773 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:28:26,774 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:28:26,774 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2021-06-04 21:28:26,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 957 proven. 353 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2021-06-04 21:28:26,843 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560540694] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:28:26,843 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-04 21:28:26,843 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 33] total 58 [2021-06-04 21:28:26,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130398410] [2021-06-04 21:28:26,844 INFO L462 AbstractCegarLoop]: Interpolant automaton has 58 states [2021-06-04 21:28:26,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:28:26,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-06-04 21:28:26,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=2972, Unknown=0, NotChecked=0, Total=3306 [2021-06-04 21:28:26,845 INFO L87 Difference]: Start difference. First operand 43564 states and 100074 transitions. Second operand has 58 states, 58 states have (on average 12.775862068965518) internal successors, (741), 58 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:28:44,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:28:44,186 INFO L93 Difference]: Finished difference Result 40905 states and 93823 transitions. [2021-06-04 21:28:44,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 411 states. [2021-06-04 21:28:44,186 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 12.775862068965518) internal successors, (741), 58 states have internal predecessors, (741), 0 states have call successors, (0), 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 498 [2021-06-04 21:28:44,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:28:44,220 INFO L225 Difference]: With dead ends: 40905 [2021-06-04 21:28:44,221 INFO L226 Difference]: Without dead ends: 40905 [2021-06-04 21:28:44,228 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 933 GetRequests, 466 SyntacticMatches, 3 SemanticMatches, 464 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96378 ImplicationChecksByTransitivity, 14503.0ms TimeCoverageRelationStatistics Valid=19941, Invalid=196749, Unknown=0, NotChecked=0, Total=216690 [2021-06-04 21:28:44,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40905 states. [2021-06-04 21:28:44,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40905 to 34269. [2021-06-04 21:28:44,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34269 states, 34268 states have (on average 2.2887825376444497) internal successors, (78432), 34268 states have internal predecessors, (78432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:28:44,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34269 states to 34269 states and 78432 transitions. [2021-06-04 21:28:44,647 INFO L78 Accepts]: Start accepts. Automaton has 34269 states and 78432 transitions. Word has length 498 [2021-06-04 21:28:44,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:28:44,647 INFO L482 AbstractCegarLoop]: Abstraction has 34269 states and 78432 transitions. [2021-06-04 21:28:44,648 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 58 states, 58 states have (on average 12.775862068965518) internal successors, (741), 58 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:28:44,648 INFO L276 IsEmpty]: Start isEmpty. Operand 34269 states and 78432 transitions. [2021-06-04 21:28:44,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2021-06-04 21:28:44,680 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:28:44,680 INFO L521 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:28:44,884 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable248 [2021-06-04 21:28:44,885 INFO L430 AbstractCegarLoop]: === Iteration 18 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:28:44,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:28:44,885 INFO L82 PathProgramCache]: Analyzing trace with hash 291210636, now seen corresponding path program 10 times [2021-06-04 21:28:44,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:28:44,885 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416104124] [2021-06-04 21:28:44,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:28:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:28:45,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2347 backedges. 0 proven. 2347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:28:45,190 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:28:45,190 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416104124] [2021-06-04 21:28:45,190 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416104124] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:28:45,190 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474240973] [2021-06-04 21:28:45,190 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 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-04 21:28:47,850 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-04 21:28:47,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-04 21:28:47,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 971 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-04 21:28:47,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-04 21:28:48,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2347 backedges. 0 proven. 2347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:28:48,410 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474240973] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:28:48,410 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-04 21:28:48,410 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 31 [2021-06-04 21:28:48,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305143711] [2021-06-04 21:28:48,411 INFO L462 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-06-04 21:28:48,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:28:48,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-06-04 21:28:48,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2021-06-04 21:28:48,411 INFO L87 Difference]: Start difference. First operand 34269 states and 78432 transitions. Second operand has 31 states, 31 states have (on average 18.322580645161292) internal successors, (568), 31 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:28:48,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:28:48,922 INFO L93 Difference]: Finished difference Result 39885 states and 91260 transitions. [2021-06-04 21:28:48,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-06-04 21:28:48,922 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 18.322580645161292) internal successors, (568), 31 states have internal predecessors, (568), 0 states have call successors, (0), 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 531 [2021-06-04 21:28:48,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:28:48,958 INFO L225 Difference]: With dead ends: 39885 [2021-06-04 21:28:48,958 INFO L226 Difference]: Without dead ends: 39885 [2021-06-04 21:28:48,959 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 585 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 517.5ms TimeCoverageRelationStatistics Valid=1012, Invalid=2180, Unknown=0, NotChecked=0, Total=3192 [2021-06-04 21:28:48,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39885 states. [2021-06-04 21:28:49,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39885 to 37167. [2021-06-04 21:28:49,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37167 states, 37166 states have (on average 2.2884087606952592) internal successors, (85051), 37166 states have internal predecessors, (85051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:28:49,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37167 states to 37167 states and 85051 transitions. [2021-06-04 21:28:49,387 INFO L78 Accepts]: Start accepts. Automaton has 37167 states and 85051 transitions. Word has length 531 [2021-06-04 21:28:49,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:28:49,388 INFO L482 AbstractCegarLoop]: Abstraction has 37167 states and 85051 transitions. [2021-06-04 21:28:49,388 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 18.322580645161292) internal successors, (568), 31 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:28:49,388 INFO L276 IsEmpty]: Start isEmpty. Operand 37167 states and 85051 transitions. [2021-06-04 21:28:49,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2021-06-04 21:28:49,419 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:28:49,419 INFO L521 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:28:49,620 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable249,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-04 21:28:49,620 INFO L430 AbstractCegarLoop]: === Iteration 19 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:28:49,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:28:49,620 INFO L82 PathProgramCache]: Analyzing trace with hash 239946265, now seen corresponding path program 11 times [2021-06-04 21:28:49,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:28:49,621 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418711416] [2021-06-04 21:28:49,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:28:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:28:49,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2753 backedges. 0 proven. 2753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:28:49,959 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:28:49,959 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418711416] [2021-06-04 21:28:49,959 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418711416] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:28:49,959 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146482455] [2021-06-04 21:28:49,959 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 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-04 21:29:50,614 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2021-06-04 21:29:50,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-04 21:29:50,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 223 conjunts are in the unsatisfiable core [2021-06-04 21:29:50,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-04 21:29:50,886 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-04 21:29:50,887 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:50,891 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:50,891 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-04 21:29:50,891 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2021-06-04 21:29:50,938 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 0 case distinctions, treesize of input 23 treesize of output 13 [2021-06-04 21:29:50,939 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:50,941 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:50,941 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:29:50,941 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:9 [2021-06-04 21:29:50,976 INFO L354 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2021-06-04 21:29:50,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, 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 38 [2021-06-04 21:29:50,978 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:50,985 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:50,986 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-04 21:29:50,986 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:23 [2021-06-04 21:29:51,249 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-04 21:29:51,250 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-04 21:29:51,259 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-06-04 21:29:51,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2021-06-04 21:29:51,260 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:51,274 INFO L354 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-06-04 21:29:51,274 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 34 [2021-06-04 21:29:51,276 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:51,300 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:51,303 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-04 21:29:51,303 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:48 [2021-06-04 21:29:51,364 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-04 21:29:51,365 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:51,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:29:51,385 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 24 [2021-06-04 21:29:51,386 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:51,403 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:51,404 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-04 21:29:51,405 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2021-06-04 21:29:51,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:29:51,634 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 41 treesize of output 19 [2021-06-04 21:29:51,634 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:51,637 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 0 case distinctions, treesize of input 32 treesize of output 16 [2021-06-04 21:29:51,637 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:51,648 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:51,649 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-04 21:29:51,649 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:45 [2021-06-04 21:29:51,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:29:51,713 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 26 treesize of output 25 [2021-06-04 21:29:51,714 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:51,732 INFO L354 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2021-06-04 21:29:51,732 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 38 [2021-06-04 21:29:51,733 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:51,750 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:51,751 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2021-06-04 21:29:51,751 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:58 [2021-06-04 21:29:52,070 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-04 21:29:52,070 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2021-06-04 21:29:52,072 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-04 21:29:52,075 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-04 21:29:52,082 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-06-04 21:29:52,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 27 [2021-06-04 21:29:52,084 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:52,102 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:52,104 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-04 21:29:52,104 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2021-06-04 21:29:52,159 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-04 21:29:52,160 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:52,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:29:52,164 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 24 [2021-06-04 21:29:52,165 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:52,182 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:52,183 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-04 21:29:52,183 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2021-06-04 21:29:52,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:29:52,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 32 treesize of output 16 [2021-06-04 21:29:52,466 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:52,468 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 0 case distinctions, treesize of input 41 treesize of output 19 [2021-06-04 21:29:52,469 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:52,477 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:52,478 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-04 21:29:52,478 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:45 [2021-06-04 21:29:52,722 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2021-06-04 21:29:52,749 INFO L354 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2021-06-04 21:29:52,749 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 38 [2021-06-04 21:29:52,751 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:52,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:29:52,755 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 26 treesize of output 25 [2021-06-04 21:29:52,756 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:52,773 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:52,774 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2021-06-04 21:29:52,774 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:58 [2021-06-04 21:29:53,163 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-04 21:29:53,163 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2021-06-04 21:29:53,165 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-04 21:29:53,168 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-04 21:29:53,177 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-06-04 21:29:53,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 27 [2021-06-04 21:29:53,178 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:53,198 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:53,200 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-04 21:29:53,200 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2021-06-04 21:29:53,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:29:53,261 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 24 [2021-06-04 21:29:53,263 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:53,268 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-04 21:29:53,268 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:53,285 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:53,286 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-04 21:29:53,286 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2021-06-04 21:29:53,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:29:53,466 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 21 treesize of output 11 [2021-06-04 21:29:53,467 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:53,469 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 0 case distinctions, treesize of input 31 treesize of output 15 [2021-06-04 21:29:53,470 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:53,476 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:53,477 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-04 21:29:53,477 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:78, output treesize:35 [2021-06-04 21:29:53,542 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-04 21:29:53,543 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:53,560 INFO L354 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2021-06-04 21:29:53,561 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 38 [2021-06-04 21:29:53,563 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:53,592 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:53,594 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2021-06-04 21:29:53,594 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:48 [2021-06-04 21:29:54,205 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-04 21:29:54,205 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2021-06-04 21:29:54,207 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-04 21:29:54,211 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-04 21:29:54,220 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-06-04 21:29:54,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 27 [2021-06-04 21:29:54,222 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:54,244 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:54,246 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-04 21:29:54,246 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2021-06-04 21:29:54,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 15 treesize of output 11 [2021-06-04 21:29:54,321 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:54,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:29:54,327 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 24 [2021-06-04 21:29:54,328 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:54,347 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:54,348 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-04 21:29:54,348 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2021-06-04 21:29:54,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:29:54,556 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 21 treesize of output 11 [2021-06-04 21:29:54,557 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:54,559 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 0 case distinctions, treesize of input 31 treesize of output 15 [2021-06-04 21:29:54,560 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:54,567 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:54,568 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-04 21:29:54,568 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:78, output treesize:35 [2021-06-04 21:29:54,661 INFO L354 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2021-06-04 21:29:54,661 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 38 [2021-06-04 21:29:54,662 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:54,665 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-04 21:29:54,666 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:54,682 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:54,684 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2021-06-04 21:29:54,684 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:48 [2021-06-04 21:29:55,140 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-04 21:29:55,142 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-04 21:29:55,151 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-06-04 21:29:55,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 27 [2021-06-04 21:29:55,153 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:55,167 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-04 21:29:55,168 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2021-06-04 21:29:55,181 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-06-04 21:29:55,202 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:55,204 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-04 21:29:55,204 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:48 [2021-06-04 21:29:55,285 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-04 21:29:55,285 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:55,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:29:55,290 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 24 [2021-06-04 21:29:55,291 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:55,309 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:55,310 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-04 21:29:55,311 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:48 [2021-06-04 21:29:55,549 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 0 case distinctions, treesize of input 23 treesize of output 13 [2021-06-04 21:29:55,550 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:55,558 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:55,558 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:29:55,558 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:34 [2021-06-04 21:29:55,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:29:55,635 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 24 [2021-06-04 21:29:55,636 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:55,643 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:55,644 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-04 21:29:55,644 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2021-06-04 21:29:56,039 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-04 21:29:56,046 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-06-04 21:29:56,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2021-06-04 21:29:56,047 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:56,058 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:56,059 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-04 21:29:56,059 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2021-06-04 21:29:56,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:29:56,072 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 24 [2021-06-04 21:29:56,072 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:56,083 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:56,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-04 21:29:56,084 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2021-06-04 21:29:56,284 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 0 case distinctions, treesize of input 34 treesize of output 18 [2021-06-04 21:29:56,285 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:56,292 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:56,293 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-04 21:29:56,293 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2021-06-04 21:29:56,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:29:56,373 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 24 [2021-06-04 21:29:56,374 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:56,381 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:56,382 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-04 21:29:56,382 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2021-06-04 21:29:56,817 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-04 21:29:56,824 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-06-04 21:29:56,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2021-06-04 21:29:56,825 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:56,837 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:56,838 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-04 21:29:56,838 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2021-06-04 21:29:56,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:29:56,852 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 24 [2021-06-04 21:29:56,852 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:56,863 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:56,863 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-04 21:29:56,863 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2021-06-04 21:29:57,271 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 0 case distinctions, treesize of input 34 treesize of output 18 [2021-06-04 21:29:57,272 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:57,279 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:57,280 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-04 21:29:57,280 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2021-06-04 21:29:57,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:29:57,366 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 24 [2021-06-04 21:29:57,367 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:57,375 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:57,376 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-04 21:29:57,376 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2021-06-04 21:29:57,850 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-04 21:29:57,857 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-06-04 21:29:57,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2021-06-04 21:29:57,859 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:57,871 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:57,872 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-04 21:29:57,872 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2021-06-04 21:29:57,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:29:57,885 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 24 [2021-06-04 21:29:57,886 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:57,896 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:57,897 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-04 21:29:57,898 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2021-06-04 21:29:58,331 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 0 case distinctions, treesize of input 34 treesize of output 18 [2021-06-04 21:29:58,332 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:58,341 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:58,341 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-04 21:29:58,341 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2021-06-04 21:29:58,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:29:58,437 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 24 [2021-06-04 21:29:58,438 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:58,446 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:58,447 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-04 21:29:58,447 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2021-06-04 21:29:58,959 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-04 21:29:58,971 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-06-04 21:29:58,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2021-06-04 21:29:58,972 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:58,984 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:58,985 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-04 21:29:58,985 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:40 [2021-06-04 21:29:58,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:29:58,998 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 24 [2021-06-04 21:29:58,999 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:59,009 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:59,010 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-04 21:29:59,010 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:40 [2021-06-04 21:29:59,256 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 0 case distinctions, treesize of input 34 treesize of output 18 [2021-06-04 21:29:59,257 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:59,265 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:59,266 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-04 21:29:59,266 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:34 [2021-06-04 21:29:59,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:29:59,365 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 29 [2021-06-04 21:29:59,366 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:59,370 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:59,371 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-04 21:29:59,371 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:9 [2021-06-04 21:29:59,660 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-06-04 21:29:59,660 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 34 treesize of output 27 [2021-06-04 21:29:59,661 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:59,665 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:59,666 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-04 21:29:59,666 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:9 [2021-06-04 21:29:59,679 INFO L354 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2021-06-04 21:29:59,680 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-04 21:29:59,680 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:59,684 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:59,684 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-04 21:29:59,684 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:9 [2021-06-04 21:29:59,690 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 19 treesize of output 7 [2021-06-04 21:29:59,691 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:29:59,692 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:29:59,692 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-04 21:29:59,692 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2021-06-04 21:29:59,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2753 backedges. 1884 proven. 823 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-06-04 21:29:59,827 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146482455] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:29:59,827 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-04 21:29:59,827 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 94] total 123 [2021-06-04 21:29:59,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110345081] [2021-06-04 21:29:59,828 INFO L462 AbstractCegarLoop]: Interpolant automaton has 123 states [2021-06-04 21:29:59,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-04 21:29:59,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2021-06-04 21:29:59,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1286, Invalid=13720, Unknown=0, NotChecked=0, Total=15006 [2021-06-04 21:29:59,829 INFO L87 Difference]: Start difference. First operand 37167 states and 85051 transitions. Second operand has 123 states, 123 states have (on average 7.983739837398374) internal successors, (982), 123 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:30:56,845 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2021-06-04 21:31:14,478 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2021-06-04 21:31:22,538 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2021-06-04 21:31:38,876 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 42 [2021-06-04 21:31:46,679 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2021-06-04 21:31:54,343 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2021-06-04 21:32:33,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-04 21:32:33,094 INFO L93 Difference]: Finished difference Result 97751 states and 225682 transitions. [2021-06-04 21:32:33,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1414 states. [2021-06-04 21:32:33,095 INFO L78 Accepts]: Start accepts. Automaton has has 123 states, 123 states have (on average 7.983739837398374) internal successors, (982), 123 states have internal predecessors, (982), 0 states have call successors, (0), 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 564 [2021-06-04 21:32:33,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-04 21:32:33,175 INFO L225 Difference]: With dead ends: 97751 [2021-06-04 21:32:33,175 INFO L226 Difference]: Without dead ends: 97751 [2021-06-04 21:32:33,263 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3394 GetRequests, 1852 SyntacticMatches, 21 SemanticMatches, 1521 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138325 ImplicationChecksByTransitivity, 136063.1ms TimeCoverageRelationStatistics Valid=162245, Invalid=2155761, Unknown=0, NotChecked=0, Total=2318006 [2021-06-04 21:32:33,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97751 states. [2021-06-04 21:32:34,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97751 to 72603. [2021-06-04 21:32:34,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72603 states, 72602 states have (on average 2.2928982672653646) internal successors, (166469), 72602 states have internal predecessors, (166469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:32:34,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72603 states to 72603 states and 166469 transitions. [2021-06-04 21:32:34,434 INFO L78 Accepts]: Start accepts. Automaton has 72603 states and 166469 transitions. Word has length 564 [2021-06-04 21:32:34,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-04 21:32:34,435 INFO L482 AbstractCegarLoop]: Abstraction has 72603 states and 166469 transitions. [2021-06-04 21:32:34,435 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 123 states, 123 states have (on average 7.983739837398374) internal successors, (982), 123 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-04 21:32:34,435 INFO L276 IsEmpty]: Start isEmpty. Operand 72603 states and 166469 transitions. [2021-06-04 21:32:34,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2021-06-04 21:32:34,503 INFO L513 BasicCegarLoop]: Found error trace [2021-06-04 21:32:34,504 INFO L521 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 21:32:34,705 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable250,16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-04 21:32:34,705 INFO L430 AbstractCegarLoop]: === Iteration 20 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-04 21:32:34,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-04 21:32:34,706 INFO L82 PathProgramCache]: Analyzing trace with hash 73691414, now seen corresponding path program 12 times [2021-06-04 21:32:34,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-04 21:32:34,706 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899426153] [2021-06-04 21:32:34,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-04 21:32:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-04 21:32:35,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-04 21:32:35,191 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-04 21:32:35,191 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899426153] [2021-06-04 21:32:35,191 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899426153] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-04 21:32:35,191 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955964645] [2021-06-04 21:32:35,191 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 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-04 21:32:41,200 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2021-06-04 21:32:41,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-04 21:32:41,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 150 conjunts are in the unsatisfiable core [2021-06-04 21:32:41,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-04 21:32:41,240 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-04 21:32:41,241 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:32:41,244 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:32:41,248 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:32:41,248 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-04 21:32:41,281 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-04 21:32:41,281 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-04 21:32:41,282 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:32:41,288 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:32:41,289 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:32:41,289 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2021-06-04 21:32:41,314 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 7 treesize of output 6 [2021-06-04 21:32:41,315 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:32:41,321 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:32:41,322 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:32:41,322 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:27 [2021-06-04 21:32:41,374 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-04 21:32:41,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-06-04 21:32:41,375 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:32:41,386 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:32:41,387 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:32:41,387 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:40 [2021-06-04 21:32:41,434 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-04 21:32:41,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2021-06-04 21:32:41,436 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:32:41,446 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:32:41,447 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:32:41,447 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:37 [2021-06-04 21:32:41,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2021-06-04 21:32:41,558 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:32:41,572 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:32:41,572 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:32:41,573 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:48 [2021-06-04 21:32:41,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2021-06-04 21:32:41,604 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:32:41,617 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:32:41,618 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:32:41,618 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:48 [2021-06-04 21:32:41,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2021-06-04 21:32:41,654 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-04 21:32:41,666 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:32:41,666 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:32:41,666 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:42 [2021-06-04 21:32:41,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2021-06-04 21:32:41,766 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 8 treesize of output 7 [2021-06-04 21:32:41,767 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-04 21:32:41,770 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:32:41,770 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-04 21:32:41,781 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-04 21:32:41,783 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-04 21:32:41,783 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:25 [2021-06-04 21:32:41,852 INFO L354 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2021-06-04 21:32:41,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2021-06-04 21:32:41,918 INFO L354 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2021-06-04 21:32:41,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2021-06-04 21:32:41,945 INFO L354 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2021-06-04 21:32:41,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2021-06-04 21:32:42,021 INFO L354 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2021-06-04 21:32:42,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2021-06-04 21:32:42,117 INFO L354 Elim1Store]: treesize reduction 24, result has 42.9 percent of original size [2021-06-04 21:32:42,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 55 [2021-06-04 21:32:42,211 INFO L354 Elim1Store]: treesize reduction 24, result has 42.9 percent of original size [2021-06-04 21:32:42,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 55 [2021-06-04 21:32:42,243 INFO L354 Elim1Store]: treesize reduction 24, result has 42.9 percent of original size [2021-06-04 21:32:42,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 55 [2021-06-04 21:32:42,278 INFO L354 Elim1Store]: treesize reduction 24, result has 42.9 percent of original size [2021-06-04 21:32:42,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 55 [2021-06-04 21:32:42,377 INFO L354 Elim1Store]: treesize reduction 24, result has 42.9 percent of original size [2021-06-04 21:32:42,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 55 [2021-06-04 21:32:42,478 INFO L354 Elim1Store]: treesize reduction 24, result has 42.9 percent of original size [2021-06-04 21:32:42,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 55 [2021-06-04 21:32:42,517 INFO L354 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2021-06-04 21:32:42,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 81 [2021-06-04 21:32:42,633 INFO L354 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2021-06-04 21:32:42,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 81 [2021-06-04 21:32:42,690 INFO L354 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2021-06-04 21:32:42,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 92 [2021-06-04 21:32:42,847 INFO L354 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2021-06-04 21:32:42,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 92 [2021-06-04 21:32:42,911 INFO L354 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2021-06-04 21:32:42,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 92 [2021-06-04 21:32:42,969 INFO L354 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2021-06-04 21:32:42,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 92 [2021-06-04 21:32:43,025 INFO L354 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2021-06-04 21:32:43,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 92 [2021-06-04 21:32:43,083 INFO L354 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2021-06-04 21:32:43,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 92 [2021-06-04 21:32:43,139 INFO L354 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2021-06-04 21:32:43,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 92 [2021-06-04 21:32:43,202 INFO L354 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2021-06-04 21:32:43,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 112 [2021-06-04 21:32:43,685 INFO L354 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2021-06-04 21:32:43,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 112 [2021-06-04 21:32:43,788 INFO L354 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2021-06-04 21:32:43,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 112 [2021-06-04 21:32:43,859 INFO L354 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2021-06-04 21:32:43,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 112 [2021-06-04 21:32:43,930 INFO L354 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2021-06-04 21:32:43,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 112 [2021-06-04 21:32:43,993 INFO L354 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2021-06-04 21:32:43,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 112 [2021-06-04 21:32:44,055 INFO L354 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2021-06-04 21:32:44,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 112 [2021-06-04 21:32:44,127 INFO L354 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2021-06-04 21:32:44,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 112 [2021-06-04 21:32:44,201 INFO L354 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2021-06-04 21:32:44,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 112 [2021-06-04 21:32:44,378 INFO L354 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2021-06-04 21:32:44,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 112 [2021-06-04 21:32:44,443 INFO L354 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2021-06-04 21:32:44,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 112 [2021-06-04 21:32:44,472 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:32:44,473 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:32:44,509 INFO L354 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2021-06-04 21:32:44,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 112 [2021-06-04 21:32:44,688 INFO L354 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2021-06-04 21:32:44,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 112 [2021-06-04 21:32:44,756 INFO L354 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2021-06-04 21:32:44,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 112 [2021-06-04 21:32:44,917 WARN L313 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-04 21:32:44,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:32:44,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-06-04 21:32:44,940 WARN L348 FreeRefinementEngine]: Global settings require throwing the following exception [2021-06-04 21:32:45,140 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable282,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-04 21:32:45,141 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Unexpected substitution problem. at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:414) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.doElimOneRec(ElimStorePlain.java:298) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.eliminateOne(ElimStorePlain.java:607) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.doElimAllRec(ElimStorePlain.java:520) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:242) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:307) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:100) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:374) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:69) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:63) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:374) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-06-04 21:32:45,144 INFO L168 Benchmark]: Toolchain (without parser) took 333448.13 ms. Allocated memory was 371.2 MB in the beginning and 3.5 GB in the end (delta: 3.1 GB). Free memory was 332.6 MB in the beginning and 2.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.5 GB. Max. memory is 16.0 GB. [2021-06-04 21:32:45,144 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 371.2 MB. Free memory is still 351.2 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-04 21:32:45,144 INFO L168 Benchmark]: CACSL2BoogieTranslator took 522.11 ms. Allocated memory is still 371.2 MB. Free memory was 332.4 MB in the beginning and 306.4 MB in the end (delta: 26.0 MB). Peak memory consumption was 28.1 MB. Max. memory is 16.0 GB. [2021-06-04 21:32:45,145 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.49 ms. Allocated memory is still 371.2 MB. Free memory was 306.4 MB in the beginning and 303.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-04 21:32:45,145 INFO L168 Benchmark]: Boogie Preprocessor took 22.24 ms. Allocated memory is still 371.2 MB. Free memory was 303.2 MB in the beginning and 301.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-04 21:32:45,145 INFO L168 Benchmark]: RCFGBuilder took 560.78 ms. Allocated memory is still 371.2 MB. Free memory was 301.1 MB in the beginning and 257.1 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 16.0 GB. [2021-06-04 21:32:45,145 INFO L168 Benchmark]: TraceAbstraction took 332286.50 ms. Allocated memory was 371.2 MB in the beginning and 3.5 GB in the end (delta: 3.1 GB). Free memory was 257.1 MB in the beginning and 2.0 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.4 GB. Max. memory is 16.0 GB. [2021-06-04 21:32:45,145 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 371.2 MB. Free memory is still 351.2 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 522.11 ms. Allocated memory is still 371.2 MB. Free memory was 332.4 MB in the beginning and 306.4 MB in the end (delta: 26.0 MB). Peak memory consumption was 28.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 38.49 ms. Allocated memory is still 371.2 MB. Free memory was 306.4 MB in the beginning and 303.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 22.24 ms. Allocated memory is still 371.2 MB. Free memory was 303.2 MB in the beginning and 301.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 560.78 ms. Allocated memory is still 371.2 MB. Free memory was 301.1 MB in the beginning and 257.1 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 332286.50 ms. Allocated memory was 371.2 MB in the beginning and 3.5 GB in the end (delta: 3.1 GB). Free memory was 257.1 MB in the beginning and 2.0 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.4 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Unexpected substitution problem. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Unexpected substitution problem.: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:338) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...