/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7707f89-m [2022-11-16 03:57:04,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 03:57:04,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 03:57:04,768 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 03:57:04,769 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 03:57:04,769 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 03:57:04,774 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 03:57:04,778 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 03:57:04,779 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 03:57:04,784 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 03:57:04,785 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 03:57:04,786 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 03:57:04,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 03:57:04,788 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 03:57:04,790 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 03:57:04,790 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 03:57:04,791 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 03:57:04,791 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 03:57:04,793 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 03:57:04,797 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 03:57:04,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 03:57:04,801 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 03:57:04,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 03:57:04,802 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 03:57:04,804 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 03:57:04,804 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 03:57:04,804 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 03:57:04,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 03:57:04,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 03:57:04,805 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 03:57:04,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 03:57:04,806 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 03:57:04,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 03:57:04,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 03:57:04,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 03:57:04,807 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 03:57:04,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 03:57:04,808 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 03:57:04,808 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 03:57:04,808 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 03:57:04,809 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 03:57:04,811 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-11-16 03:57:04,839 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 03:57:04,840 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 03:57:04,840 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 03:57:04,840 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 03:57:04,841 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 03:57:04,841 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 03:57:04,841 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 03:57:04,841 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 03:57:04,841 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 03:57:04,842 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 03:57:04,842 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 03:57:04,842 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 03:57:04,842 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 03:57:04,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 03:57:04,842 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 03:57:04,843 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 03:57:04,843 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 03:57:04,843 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 03:57:04,843 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 03:57:04,843 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 03:57:04,843 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 03:57:04,843 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 03:57:04,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 03:57:04,843 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-16 03:57:04,843 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 03:57:04,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 03:57:04,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 03:57:04,844 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 03:57:04,844 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 03:57:04,844 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 03:57:04,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 03:57:04,844 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 03:57:04,844 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-16 03:57:04,844 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 03:57:04,844 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-16 03:57:04,844 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-16 03:57:04,845 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP [2022-11-16 03:57:05,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 03:57:05,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 03:57:05,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 03:57:05,079 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 03:57:05,079 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 03:57:05,080 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2022-11-16 03:57:05,141 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b16bc3494/dfbef7a629954417a0b4755b8f976904/FLAGbc4d0c4b6 [2022-11-16 03:57:05,516 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 03:57:05,516 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2022-11-16 03:57:05,522 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b16bc3494/dfbef7a629954417a0b4755b8f976904/FLAGbc4d0c4b6 [2022-11-16 03:57:05,934 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b16bc3494/dfbef7a629954417a0b4755b8f976904 [2022-11-16 03:57:05,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 03:57:05,937 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-16 03:57:05,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 03:57:05,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 03:57:05,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 03:57:05,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:57:05" (1/1) ... [2022-11-16 03:57:05,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30943926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:57:05, skipping insertion in model container [2022-11-16 03:57:05,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:57:05" (1/1) ... [2022-11-16 03:57:05,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 03:57:05,957 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 03:57:06,141 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2022-11-16 03:57:06,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 03:57:06,156 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 03:57:06,169 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2022-11-16 03:57:06,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 03:57:06,190 INFO L208 MainTranslator]: Completed translation [2022-11-16 03:57:06,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:57:06 WrapperNode [2022-11-16 03:57:06,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 03:57:06,191 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 03:57:06,191 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 03:57:06,192 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 03:57:06,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:57:06" (1/1) ... [2022-11-16 03:57:06,207 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:57:06" (1/1) ... [2022-11-16 03:57:06,226 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-11-16 03:57:06,226 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 03:57:06,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 03:57:06,227 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 03:57:06,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 03:57:06,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:57:06" (1/1) ... [2022-11-16 03:57:06,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:57:06" (1/1) ... [2022-11-16 03:57:06,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:57:06" (1/1) ... [2022-11-16 03:57:06,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:57:06" (1/1) ... [2022-11-16 03:57:06,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:57:06" (1/1) ... [2022-11-16 03:57:06,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:57:06" (1/1) ... [2022-11-16 03:57:06,261 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:57:06" (1/1) ... [2022-11-16 03:57:06,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:57:06" (1/1) ... [2022-11-16 03:57:06,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 03:57:06,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 03:57:06,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 03:57:06,265 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 03:57:06,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:57:06" (1/1) ... [2022-11-16 03:57:06,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 03:57:06,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:57:06,294 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 03:57:06,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 03:57:06,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 03:57:06,327 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-16 03:57:06,327 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-16 03:57:06,327 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-16 03:57:06,328 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-16 03:57:06,328 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-16 03:57:06,328 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-16 03:57:06,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 03:57:06,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 03:57:06,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 03:57:06,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 03:57:06,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 03:57:06,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 03:57:06,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 03:57:06,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 03:57:06,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 03:57:06,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 03:57:06,330 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 03:57:06,400 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 03:57:06,402 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 03:57:06,657 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 03:57:06,730 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 03:57:06,730 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-16 03:57:06,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 03:57:06 BoogieIcfgContainer [2022-11-16 03:57:06,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 03:57:06,734 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 03:57:06,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 03:57:06,741 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 03:57:06,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:57:05" (1/3) ... [2022-11-16 03:57:06,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c04862c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:57:06, skipping insertion in model container [2022-11-16 03:57:06,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:57:06" (2/3) ... [2022-11-16 03:57:06,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c04862c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:57:06, skipping insertion in model container [2022-11-16 03:57:06,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 03:57:06" (3/3) ... [2022-11-16 03:57:06,744 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2022-11-16 03:57:06,750 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 03:57:06,756 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 03:57:06,756 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 03:57:06,756 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 03:57:06,816 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-16 03:57:06,858 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 03:57:06,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-16 03:57:06,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:57:06,861 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-16 03:57:06,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-16 03:57:06,907 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-16 03:57:06,922 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-16 03:57:06,928 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@493a5f6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 03:57:06,928 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-16 03:57:07,195 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 03:57:07,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:57:07,199 INFO L85 PathProgramCache]: Analyzing trace with hash -275952594, now seen corresponding path program 1 times [2022-11-16 03:57:07,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:57:07,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398106938] [2022-11-16 03:57:07,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:57:07,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:57:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:57:07,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:57:07,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:57:07,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398106938] [2022-11-16 03:57:07,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398106938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 03:57:07,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 03:57:07,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 03:57:07,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87459003] [2022-11-16 03:57:07,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 03:57:07,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 03:57:07,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:57:07,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 03:57:07,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 03:57:07,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:07,522 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:57:07,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 03:57:07,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:07,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:07,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 03:57:07,585 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 03:57:07,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:57:07,586 INFO L85 PathProgramCache]: Analyzing trace with hash 2072012938, now seen corresponding path program 1 times [2022-11-16 03:57:07,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:57:07,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140651306] [2022-11-16 03:57:07,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:57:07,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:57:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:57:08,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:57:08,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:57:08,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140651306] [2022-11-16 03:57:08,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140651306] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 03:57:08,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 03:57:08,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 03:57:08,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921541717] [2022-11-16 03:57:08,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 03:57:08,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 03:57:08,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:57:08,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 03:57:08,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-11-16 03:57:08,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:08,136 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:57:08,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 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) [2022-11-16 03:57:08,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:08,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:08,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:08,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:57:08,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 03:57:08,337 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 03:57:08,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:57:08,338 INFO L85 PathProgramCache]: Analyzing trace with hash 439153583, now seen corresponding path program 1 times [2022-11-16 03:57:08,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:57:08,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890382115] [2022-11-16 03:57:08,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:57:08,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:57:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:57:08,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:57:08,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:57:08,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890382115] [2022-11-16 03:57:08,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890382115] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:57:08,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740327938] [2022-11-16 03:57:08,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:57:08,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:57:08,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:57:08,526 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 03:57:08,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 03:57:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:57:08,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 03:57:08,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:57:08,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:57:08,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:57:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:57:09,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740327938] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 03:57:09,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 03:57:09,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-11-16 03:57:09,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935198084] [2022-11-16 03:57:09,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 03:57:09,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 03:57:09,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:57:09,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 03:57:09,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-16 03:57:09,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:09,018 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:57:09,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 03:57:09,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:09,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:57:09,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:09,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:09,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:57:09,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:57:09,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-16 03:57:09,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-16 03:57:09,320 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 03:57:09,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:57:09,320 INFO L85 PathProgramCache]: Analyzing trace with hash 232719478, now seen corresponding path program 1 times [2022-11-16 03:57:09,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:57:09,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397708048] [2022-11-16 03:57:09,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:57:09,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:57:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:57:09,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:57:09,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:57:09,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397708048] [2022-11-16 03:57:09,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397708048] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:57:09,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186784253] [2022-11-16 03:57:09,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:57:09,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:57:09,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:57:09,542 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 03:57:09,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 03:57:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:57:09,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 03:57:09,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:57:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:57:09,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:57:09,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:57:09,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186784253] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 03:57:09,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 03:57:09,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 19 [2022-11-16 03:57:09,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621825491] [2022-11-16 03:57:09,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 03:57:09,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 03:57:09,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:57:09,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 03:57:09,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-11-16 03:57:09,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:09,970 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:57:09,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 03:57:09,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:09,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:57:09,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:57:09,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:10,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:10,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:57:10,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:57:10,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:57:10,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-16 03:57:10,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:57:10,332 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 03:57:10,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:57:10,333 INFO L85 PathProgramCache]: Analyzing trace with hash 100827375, now seen corresponding path program 1 times [2022-11-16 03:57:10,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:57:10,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349639367] [2022-11-16 03:57:10,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:57:10,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:57:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:57:11,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:57:11,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:57:11,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349639367] [2022-11-16 03:57:11,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349639367] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:57:11,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424539785] [2022-11-16 03:57:11,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:57:11,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:57:11,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:57:11,716 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 03:57:11,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 03:57:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:57:11,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-16 03:57:11,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:57:12,704 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:57:12,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 43 [2022-11-16 03:57:13,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:57:13,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:57:13,983 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:57:13,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 75 [2022-11-16 03:57:15,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:57:15,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424539785] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 03:57:15,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 03:57:15,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 20, 19] total 53 [2022-11-16 03:57:15,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864853043] [2022-11-16 03:57:15,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 03:57:15,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-16 03:57:15,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:57:15,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-16 03:57:15,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=2248, Unknown=0, NotChecked=0, Total=2756 [2022-11-16 03:57:15,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:15,313 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:57:15,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 5.773584905660377) internal successors, (306), 53 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 03:57:15,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:15,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:57:15,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:57:15,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:57:15,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:17,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:17,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:57:17,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:57:17,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:57:17,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-16 03:57:17,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-16 03:57:17,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:57:17,908 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 03:57:17,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:57:17,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1303894886, now seen corresponding path program 2 times [2022-11-16 03:57:17,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:57:17,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143974292] [2022-11-16 03:57:17,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:57:17,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:57:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:57:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:57:18,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:57:18,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143974292] [2022-11-16 03:57:18,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143974292] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:57:18,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830112221] [2022-11-16 03:57:18,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 03:57:18,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:57:18,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:57:18,192 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 03:57:18,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 03:57:18,268 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 03:57:18,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 03:57:18,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 03:57:18,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:57:18,625 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 03:57:18,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:57:18,917 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 03:57:18,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830112221] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 03:57:18,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 03:57:18,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 33 [2022-11-16 03:57:18,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094713564] [2022-11-16 03:57:18,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 03:57:18,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-16 03:57:18,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:57:18,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-16 03:57:18,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=937, Unknown=0, NotChecked=0, Total=1056 [2022-11-16 03:57:18,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:18,919 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:57:18,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.666666666666667) internal successors, (253), 33 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 03:57:18,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:18,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:57:18,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:57:18,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:57:18,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-11-16 03:57:18,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:20,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:20,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:57:20,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:57:20,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:57:20,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-16 03:57:20,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 03:57:20,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 03:57:20,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:57:20,602 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 03:57:20,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:57:20,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1964803798, now seen corresponding path program 3 times [2022-11-16 03:57:20,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:57:20,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067411267] [2022-11-16 03:57:20,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:57:20,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:57:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:57:20,825 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:57:20,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:57:20,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067411267] [2022-11-16 03:57:20,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067411267] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:57:20,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917931748] [2022-11-16 03:57:20,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 03:57:20,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:57:20,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:57:20,842 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 03:57:20,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 03:57:20,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 03:57:20,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 03:57:20,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 03:57:20,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:57:21,161 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:57:21,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:57:21,346 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:57:21,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917931748] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 03:57:21,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 03:57:21,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-11-16 03:57:21,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797751840] [2022-11-16 03:57:21,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 03:57:21,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-16 03:57:21,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:57:21,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-16 03:57:21,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2022-11-16 03:57:21,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:21,349 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:57:21,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.125) internal successors, (219), 24 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 03:57:21,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:21,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:57:21,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:57:21,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:57:21,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-11-16 03:57:21,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-16 03:57:21,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:22,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:22,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:57:22,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:57:22,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:57:22,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-16 03:57:22,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 03:57:22,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 03:57:22,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-16 03:57:22,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:57:22,537 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 03:57:22,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:57:22,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1094981842, now seen corresponding path program 1 times [2022-11-16 03:57:22,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:57:22,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125112597] [2022-11-16 03:57:22,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:57:22,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:57:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:57:22,915 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:57:22,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:57:22,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125112597] [2022-11-16 03:57:22,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125112597] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:57:22,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744734591] [2022-11-16 03:57:22,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:57:22,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:57:22,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:57:22,924 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 03:57:22,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 03:57:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:57:23,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-16 03:57:23,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:57:23,371 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:57:23,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:57:23,656 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:57:23,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744734591] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 03:57:23,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 03:57:23,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 39 [2022-11-16 03:57:23,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782860988] [2022-11-16 03:57:23,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 03:57:23,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-16 03:57:23,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:57:23,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-16 03:57:23,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1311, Unknown=0, NotChecked=0, Total=1482 [2022-11-16 03:57:23,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:23,659 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:57:23,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.435897435897436) internal successors, (290), 39 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 03:57:23,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:23,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:57:23,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:57:23,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:57:23,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2022-11-16 03:57:23,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-16 03:57:23,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-16 03:57:23,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:25,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:25,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:57:25,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:57:25,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:57:25,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-16 03:57:25,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-16 03:57:25,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 03:57:25,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 03:57:25,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 03:57:25,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:57:25,512 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 03:57:25,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:57:25,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1229161583, now seen corresponding path program 4 times [2022-11-16 03:57:25,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:57:25,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140169755] [2022-11-16 03:57:25,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:57:25,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:57:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:57:26,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:57:26,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:57:26,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140169755] [2022-11-16 03:57:26,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140169755] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:57:26,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055767615] [2022-11-16 03:57:26,859 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 03:57:26,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:57:26,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:57:26,861 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 03:57:26,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 03:57:26,967 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 03:57:26,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 03:57:26,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 03:57:26,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:57:27,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 03:57:27,892 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 33 [2022-11-16 03:57:28,095 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:57:28,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 43 [2022-11-16 03:57:28,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:57:28,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:57:29,746 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~max1~0 c_~max2~0))) (and (or .cse0 (forall ((~M~0 Int) (v_ArrVal_253 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_253) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (< c_~max2~0 .cse1) (not (< c_~max3~0 .cse1)) (< (+ ~M~0 1) c_~N~0))))) (or (and (or .cse0 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (forall ((~M~0 Int) (v_ArrVal_253 (Array Int Int))) (or (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_253) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))) (forall ((~M~0 Int) (v_ArrVal_253 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_253) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse2 c_~max2~0) (not (< ~M~0 c_~N~0)) (= c_~max1~0 .cse2) (not (< c_~max3~0 .cse2)) (< (+ ~M~0 1) c_~N~0)))))) is different from false [2022-11-16 03:57:29,806 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:57:29,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 276 treesize of output 276 [2022-11-16 03:57:29,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 181 treesize of output 163 [2022-11-16 03:57:29,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 163 treesize of output 151 [2022-11-16 03:57:29,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 151 treesize of output 145 [2022-11-16 03:57:33,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:57:33,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055767615] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 03:57:33,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 03:57:33,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 72 [2022-11-16 03:57:33,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467642401] [2022-11-16 03:57:33,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 03:57:33,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-16 03:57:33,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:57:33,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-16 03:57:33,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=639, Invalid=4334, Unknown=1, NotChecked=138, Total=5112 [2022-11-16 03:57:33,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:33,777 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:57:33,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 4.388888888888889) internal successors, (316), 72 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 03:57:33,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:33,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:57:33,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:57:33,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:57:33,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-11-16 03:57:33,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-16 03:57:33,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-16 03:57:33,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-16 03:57:33,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:37,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:37,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:57:37,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:57:37,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:57:37,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-16 03:57:37,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-16 03:57:37,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 03:57:37,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 03:57:37,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-16 03:57:37,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 03:57:37,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-16 03:57:37,302 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 03:57:37,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:57:37,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1717655339, now seen corresponding path program 5 times [2022-11-16 03:57:37,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:57:37,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971175809] [2022-11-16 03:57:37,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:57:37,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:57:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:57:38,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:57:38,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:57:38,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971175809] [2022-11-16 03:57:38,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971175809] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:57:38,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374266675] [2022-11-16 03:57:38,635 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 03:57:38,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:57:38,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:57:38,640 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 03:57:38,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 03:57:38,715 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 03:57:38,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 03:57:38,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-16 03:57:38,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:57:38,751 INFO L350 Elim1Store]: Elim1 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 [2022-11-16 03:57:38,791 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 03:57:38,791 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-16 03:57:38,835 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 03:57:38,835 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-16 03:57:39,159 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-16 03:57:39,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 30 [2022-11-16 03:57:39,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2022-11-16 03:57:39,654 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2022-11-16 03:57:39,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 03:57:39,899 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 33 [2022-11-16 03:57:40,077 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 33 [2022-11-16 03:57:40,396 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:57:40,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 43 [2022-11-16 03:57:40,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:57:40,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:57:43,897 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (< c_~max2~0 c_~max3~0)) (.cse6 (<= c_~max3~0 c_~max2~0)) (.cse4 (= c_~max1~0 c_~max2~0))) (and (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse0 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse0)) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse1)) (= .cse1 .cse0) (< 0 ~M~0) (< ~M~0 0) (<= .cse1 c_~max2~0)))))))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (or (< 0 ~M~0) (< ~M~0 0) (< c_~max1~0 (select (select .cse3 c_~A~0.base) c_~A~0.offset)) (< c_~max3~0 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) (and (or .cse4 .cse5) (or (= c_~max1~0 c_~max3~0) .cse6))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse7 (select (select .cse8 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse7)) (< 0 ~M~0) (< ~M~0 0) (= .cse7 c_~max2~0) (< c_~max3~0 (select (select (store (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))))))) .cse5) (or .cse6 (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse9 (select (select .cse10 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse9)) (< 0 ~M~0) (< ~M~0 0) (= .cse9 c_~max3~0) (< c_~max3~0 (select (select (store (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))))) (or .cse4 (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse11 (select (select (store (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse11)) (< 0 ~M~0) (< ~M~0 0) (< c_~max2~0 .cse11) (< c_~max1~0 (select (select .cse12 c_~A~0.base) c_~A~0.offset))))))) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse13 (select (select .cse15 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse13)) (= .cse13 c_~max2~0) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse14 (select (select (store (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse14)) (< 0 ~M~0) (< ~M~0 0) (< c_~max2~0 .cse14)))))))) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (or (< c_~max1~0 (select (select .cse16 c_~A~0.base) c_~A~0.offset)) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse17 (select (select (store (store .cse16 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse17)) (< 0 ~M~0) (< ~M~0 0) (= c_~max1~0 .cse17) (<= .cse17 c_~max2~0))))))))) is different from false [2022-11-16 03:57:45,024 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (= c_~max1~0 c_~max2~0)) (.cse4 (< c_~max2~0 c_~max3~0)) (.cse5 (<= c_~max3~0 c_~max2~0))) (and (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (or (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< 0 ~M~0) (= c_~max1~0 .cse0) (<= .cse0 c_~max2~0) (< ~M~0 0) (not (< c_~max3~0 .cse0))))) (< c_~max1~0 (select (select .cse1 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (or (< 0 ~M~0) (< c_~max1~0 (select (select .cse2 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (< ~M~0 0) (< c_~max3~0 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))))) (and (or .cse3 .cse4) (or (= c_~max1~0 c_~max3~0) .cse5))) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (= .cse6 c_~max2~0) (not (< c_~max1~0 .cse6)) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse7 (select (select (store (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< 0 ~M~0) (< ~M~0 0) (not (< c_~max3~0 .cse7)) (< c_~max2~0 .cse7)))))))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse10 (select (select (store (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< 0 ~M~0) (< c_~max1~0 (select (select .cse9 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (< ~M~0 0) (not (< c_~max3~0 .cse10)) (< c_~max2~0 .cse10))))) .cse3) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (< 0 ~M~0) (= .cse11 c_~max2~0) (not (< c_~max1~0 .cse11)) (< ~M~0 0) (< c_~max3~0 (select (select (store (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))))))) .cse4) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (< 0 ~M~0) (= .cse13 c_~max3~0) (not (< c_~max1~0 .cse13)) (< ~M~0 0) (< c_~max3~0 (select (select (store (store .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))))))) .cse5) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse15 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< 0 ~M~0) (<= .cse15 c_~max2~0) (< ~M~0 0) (= .cse15 .cse16) (not (< c_~max3~0 .cse15))))) (not (< c_~max1~0 .cse16)))))))) is different from false [2022-11-16 03:57:45,238 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~max2~0 c_~max3~0)) (.cse2 (<= c_~max3~0 c_~max2~0)) (.cse0 (= c_~max1~0 c_~max2~0))) (and (or (and (or .cse0 .cse1) (or (= c_~max1~0 c_~max3~0) .cse2)) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (or (< 0 ~M~0) (< c_~max3~0 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (< ~M~0 0) (< c_~max1~0 (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= .cse4 c_~max2~0) (< 0 ~M~0) (< c_~max3~0 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (< ~M~0 0) (not (< c_~max1~0 .cse4)))))) .cse1) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= .cse6 c_~max2~0) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse7 (select (select (store (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< c_~max2~0 .cse7) (< 0 ~M~0) (not (< c_~max3~0 .cse7)) (< ~M~0 0)))) (not (< c_~max1~0 .cse6)))))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= .cse9 c_~max3~0) (< 0 ~M~0) (< c_~max3~0 (select (select (store (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (< ~M~0 0) (not (< c_~max1~0 .cse9)))))) .cse2) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse11 (select (select (store (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (= .cse11 .cse12) (< 0 ~M~0) (not (< c_~max3~0 .cse11)) (< ~M~0 0) (<= .cse11 c_~max2~0)))) (not (< c_~max1~0 .cse12)))))) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (or (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse14 (select (select (store (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (= .cse14 c_~max1~0) (< 0 ~M~0) (not (< c_~max3~0 .cse14)) (< ~M~0 0) (<= .cse14 c_~max2~0)))) (< c_~max1~0 (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))) (or .cse0 (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse16 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< c_~max2~0 .cse16) (< 0 ~M~0) (not (< c_~max3~0 .cse16)) (< ~M~0 0) (< c_~max1~0 (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))))))) is different from false [2022-11-16 03:57:45,351 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~max1~0 c_~max2~0)) (.cse6 (< c_~max2~0 c_~max3~0)) (.cse9 (<= c_~max3~0 c_~max2~0))) (and (or .cse0 (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< c_~max3~0 .cse1)) (< 0 ~M~0) (< ~M~0 0) (< c_~max1~0 (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max2~0 .cse1)))))) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< c_~max3~0 .cse3)) (< 0 ~M~0) (< ~M~0 0) (< c_~max2~0 .cse3)))) (not (< c_~max1~0 .cse5)) (= c_~max2~0 .cse5))))) (or .cse6 (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 ~M~0) (not (< c_~max1~0 .cse7)) (< c_~max3~0 (select (select (store (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< ~M~0 0) (= c_~max2~0 .cse7)))))) (or (and (or .cse0 .cse6) (or (= c_~max1~0 c_~max3~0) .cse9)) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (or (< 0 ~M~0) (< c_~max3~0 (select (select (store (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< ~M~0 0) (< c_~max1~0 (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (or (< c_~max1~0 (select (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse12 (select (select (store (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< c_~max3~0 .cse12)) (< 0 ~M~0) (= c_~max1~0 .cse12) (< ~M~0 0) (<= .cse12 c_~max2~0))))))) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse13 (select (select (store (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< c_~max3~0 .cse13)) (< 0 ~M~0) (< ~M~0 0) (<= .cse13 c_~max2~0) (= .cse14 .cse13)))) (not (< c_~max1~0 .cse14)))))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 ~M~0) (not (< c_~max1~0 .cse16)) (< c_~max3~0 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< ~M~0 0) (= c_~max3~0 .cse16))))) .cse9))) is different from false [2022-11-16 03:57:45,922 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:57:45,922 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 84 [2022-11-16 03:57:45,930 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 03:57:45,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 460 treesize of output 436 [2022-11-16 03:57:45,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 415 treesize of output 343 [2022-11-16 03:57:45,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 343 treesize of output 307 [2022-11-16 03:57:45,951 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 03:57:45,951 INFO L350 Elim1Store]: Elim1 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 222 treesize of output 206 [2022-11-16 03:57:46,161 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:57:46,161 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 54 [2022-11-16 03:57:46,164 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 03:57:46,164 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 03:57:46,169 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 03:57:46,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 63 [2022-11-16 03:57:46,177 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 03:57:46,177 INFO L350 Elim1Store]: Elim1 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 43 treesize of output 37 [2022-11-16 03:57:46,212 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 03:57:46,212 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 1 [2022-11-16 03:57:46,218 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:57:46,218 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 75 [2022-11-16 03:57:46,221 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 03:57:46,221 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 03:57:46,227 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 03:57:46,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 87 [2022-11-16 03:57:46,235 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 03:57:46,236 INFO L350 Elim1Store]: Elim1 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 67 treesize of output 55 [2022-11-16 03:57:46,270 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:57:46,270 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 54 [2022-11-16 03:57:46,273 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 03:57:46,273 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 03:57:46,279 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 03:57:46,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 63 [2022-11-16 03:57:46,287 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 03:57:46,288 INFO L350 Elim1Store]: Elim1 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 43 treesize of output 37 [2022-11-16 03:57:46,313 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:57:46,313 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 43 [2022-11-16 03:57:46,316 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 03:57:46,317 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 03:57:46,322 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 03:57:46,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 43 [2022-11-16 03:57:46,333 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 03:57:46,333 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 19 [2022-11-16 03:57:46,349 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 03:57:46,349 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 1 [2022-11-16 03:57:47,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-16 03:57:47,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374266675] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 03:57:47,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 03:57:47,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 28] total 76 [2022-11-16 03:57:47,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422889206] [2022-11-16 03:57:47,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 03:57:47,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-11-16 03:57:47,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:57:47,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-11-16 03:57:47,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=727, Invalid=4386, Unknown=15, NotChecked=572, Total=5700 [2022-11-16 03:57:47,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:47,386 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:57:47,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 4.368421052631579) internal successors, (332), 76 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 03:57:47,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:57:47,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:57:47,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:57:47,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:57:47,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-11-16 03:57:47,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-16 03:57:47,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-16 03:57:47,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-16 03:57:47,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-16 03:57:47,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:08,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:08,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:58:08,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:58:08,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:58:08,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-16 03:58:08,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-11-16 03:58:08,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 03:58:08,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-16 03:58:08,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-16 03:58:08,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-16 03:58:08,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-16 03:58:08,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 03:58:08,352 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 03:58:08,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:58:08,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1206971023, now seen corresponding path program 6 times [2022-11-16 03:58:08,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:58:08,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314045573] [2022-11-16 03:58:08,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:58:08,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:58:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:58:08,565 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:08,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:58:08,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314045573] [2022-11-16 03:58:08,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314045573] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:58:08,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81838584] [2022-11-16 03:58:08,566 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 03:58:08,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:58:08,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:58:08,567 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 03:58:08,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 03:58:08,671 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-16 03:58:08,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 03:58:08,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 03:58:08,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:58:08,915 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 03:58:08,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:58:09,107 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 03:58:09,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81838584] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 03:58:09,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 03:58:09,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2022-11-16 03:58:09,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639540424] [2022-11-16 03:58:09,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 03:58:09,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-16 03:58:09,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:58:09,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-16 03:58:09,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2022-11-16 03:58:09,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:09,109 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:58:09,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.275862068965518) internal successors, (240), 29 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 03:58:09,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:09,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:58:09,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:58:09,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:58:09,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-11-16 03:58:09,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2022-11-16 03:58:09,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-16 03:58:09,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-16 03:58:09,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-11-16 03:58:09,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-16 03:58:09,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:12,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:12,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:58:12,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:58:12,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:58:12,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-16 03:58:12,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-16 03:58:12,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 03:58:12,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-16 03:58:12,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-16 03:58:12,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-16 03:58:12,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-11-16 03:58:12,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 03:58:12,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-16 03:58:12,334 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 03:58:12,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:58:12,335 INFO L85 PathProgramCache]: Analyzing trace with hash 333021814, now seen corresponding path program 7 times [2022-11-16 03:58:12,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:58:12,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338664677] [2022-11-16 03:58:12,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:58:12,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:58:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:58:16,030 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:16,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:58:16,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338664677] [2022-11-16 03:58:16,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338664677] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:58:16,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509415407] [2022-11-16 03:58:16,044 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 03:58:16,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:58:16,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:58:16,045 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 03:58:16,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 03:58:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:58:16,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-16 03:58:16,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:58:18,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 03:58:18,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:58:18,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 164 treesize of output 108 [2022-11-16 03:58:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:19,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:58:22,974 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:58:22,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 621 treesize of output 265 [2022-11-16 03:58:26,033 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:26,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509415407] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 03:58:26,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 03:58:26,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 33, 27] total 94 [2022-11-16 03:58:26,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570968009] [2022-11-16 03:58:26,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 03:58:26,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2022-11-16 03:58:26,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:58:26,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2022-11-16 03:58:26,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=7654, Unknown=0, NotChecked=0, Total=8742 [2022-11-16 03:58:26,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:26,036 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:58:26,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 4.074468085106383) internal successors, (383), 94 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 03:58:26,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:26,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:58:26,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:58:26,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:58:26,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-11-16 03:58:26,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-16 03:58:26,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-16 03:58:26,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-16 03:58:26,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-11-16 03:58:26,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-16 03:58:26,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2022-11-16 03:58:26,037 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:36,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:36,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:58:36,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:58:36,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:58:36,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-16 03:58:36,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-16 03:58:36,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 03:58:36,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-16 03:58:36,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-16 03:58:36,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-16 03:58:36,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-11-16 03:58:36,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-11-16 03:58:36,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 03:58:36,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-16 03:58:36,936 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 03:58:36,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:58:36,936 INFO L85 PathProgramCache]: Analyzing trace with hash 648238083, now seen corresponding path program 8 times [2022-11-16 03:58:36,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:58:36,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164219932] [2022-11-16 03:58:36,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:58:36,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:58:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:58:37,229 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:37,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:58:37,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164219932] [2022-11-16 03:58:37,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164219932] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:58:37,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255862918] [2022-11-16 03:58:37,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 03:58:37,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:58:37,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:58:37,230 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 03:58:37,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 03:58:37,388 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 03:58:37,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 03:58:37,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 03:58:37,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:58:37,713 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:37,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:58:38,018 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:38,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255862918] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 03:58:38,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 03:58:38,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2022-11-16 03:58:38,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222116861] [2022-11-16 03:58:38,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 03:58:38,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-16 03:58:38,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:58:38,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-16 03:58:38,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2022-11-16 03:58:38,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:38,020 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:58:38,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.647058823529412) internal successors, (260), 34 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 03:58:38,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:38,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:58:38,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:58:38,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:58:38,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-11-16 03:58:38,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-16 03:58:38,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-16 03:58:38,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-16 03:58:38,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-11-16 03:58:38,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-16 03:58:38,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2022-11-16 03:58:38,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2022-11-16 03:58:38,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:41,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:41,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:58:41,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:58:41,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:58:41,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-16 03:58:41,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-16 03:58:41,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 03:58:41,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 03:58:41,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-11-16 03:58:41,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-16 03:58:41,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-11-16 03:58:41,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-11-16 03:58:41,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 03:58:41,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 03:58:42,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-16 03:58:42,056 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 03:58:42,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:58:42,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1304833281, now seen corresponding path program 2 times [2022-11-16 03:58:42,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:58:42,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18507939] [2022-11-16 03:58:42,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:58:42,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:58:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:58:42,236 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:42,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:58:42,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18507939] [2022-11-16 03:58:42,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18507939] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:58:42,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636071734] [2022-11-16 03:58:42,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 03:58:42,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:58:42,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:58:42,238 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 03:58:42,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 03:58:42,324 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 03:58:42,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 03:58:42,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 03:58:42,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:58:42,567 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 03:58:42,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:58:42,774 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 03:58:42,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636071734] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 03:58:42,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 03:58:42,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2022-11-16 03:58:42,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197001947] [2022-11-16 03:58:42,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 03:58:42,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-16 03:58:42,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:58:42,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-16 03:58:42,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2022-11-16 03:58:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:42,776 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:58:42,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.275862068965518) internal successors, (240), 29 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 03:58:42,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:42,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:58:42,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:58:42,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:58:42,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-11-16 03:58:42,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-16 03:58:42,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-16 03:58:42,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-16 03:58:42,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-11-16 03:58:42,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-11-16 03:58:42,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2022-11-16 03:58:42,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 88 states. [2022-11-16 03:58:42,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-16 03:58:42,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:47,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:47,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:58:47,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:58:47,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:58:47,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-16 03:58:47,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-16 03:58:47,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 03:58:47,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 03:58:47,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-11-16 03:58:47,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-16 03:58:47,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-11-16 03:58:47,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-11-16 03:58:47,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 03:58:47,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-11-16 03:58:47,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-16 03:58:47,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-16 03:58:47,521 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 03:58:47,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:58:47,521 INFO L85 PathProgramCache]: Analyzing trace with hash 6681437, now seen corresponding path program 1 times [2022-11-16 03:58:47,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:58:47,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468046726] [2022-11-16 03:58:47,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:58:47,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:58:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:58:47,758 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:47,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:58:47,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468046726] [2022-11-16 03:58:47,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468046726] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:58:47,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215916263] [2022-11-16 03:58:47,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:58:47,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:58:47,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:58:47,786 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 03:58:47,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 03:58:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:58:47,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 03:58:47,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:58:48,112 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:48,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:58:48,331 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:48,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215916263] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 03:58:48,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 03:58:48,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-11-16 03:58:48,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125251488] [2022-11-16 03:58:48,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 03:58:48,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-16 03:58:48,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:58:48,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-16 03:58:48,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-11-16 03:58:48,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:48,335 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:58:48,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.5) internal successors, (228), 24 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 03:58:48,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:48,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:58:48,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:58:48,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:58:48,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-11-16 03:58:48,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-16 03:58:48,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-16 03:58:48,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-16 03:58:48,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-11-16 03:58:48,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-16 03:58:48,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2022-11-16 03:58:48,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2022-11-16 03:58:48,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-16 03:58:48,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2022-11-16 03:58:48,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:48,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:48,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:58:48,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:58:48,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:58:48,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-16 03:58:48,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-16 03:58:48,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 03:58:48,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 03:58:48,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-11-16 03:58:48,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-16 03:58:48,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-16 03:58:48,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-11-16 03:58:48,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 03:58:48,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-11-16 03:58:48,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 03:58:48,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-16 03:58:49,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:58:49,032 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 03:58:49,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:58:49,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1755799160, now seen corresponding path program 2 times [2022-11-16 03:58:49,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:58:49,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869091222] [2022-11-16 03:58:49,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:58:49,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:58:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:58:51,130 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:51,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:58:51,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869091222] [2022-11-16 03:58:51,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869091222] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:58:51,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458635792] [2022-11-16 03:58:51,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 03:58:51,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:58:51,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:58:51,140 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 03:58:51,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-16 03:58:51,246 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 03:58:51,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 03:58:51,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-16 03:58:51,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:58:51,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 03:58:52,364 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2022-11-16 03:58:52,527 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2022-11-16 03:58:52,685 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2022-11-16 03:58:53,653 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 03:58:53,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 03:58:53,709 INFO L321 Elim1Store]: treesize reduction 28, result has 68.2 percent of original size [2022-11-16 03:58:53,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 152 treesize of output 139 [2022-11-16 03:58:55,499 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:55,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 04:00:18,645 WARN L233 SmtUtils]: Spent 1.19m on a formula simplification. DAG size of input: 193 DAG size of output: 166 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 04:01:02,902 WARN L233 SmtUtils]: Spent 32.40s on a formula simplification that was a NOOP. DAG size: 164 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 04:01:04,859 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse103 (* c_thread1Thread1of1ForFork2_~i~0 4)) (.cse13 (+ c_~max2~0 1))) (let ((.cse10 (= c_~max1~0 c_~max3~0)) (.cse14 (= c_~max1~0 c_~max2~0)) (.cse37 (<= c_~max3~0 c_~max2~0)) (.cse22 (<= .cse13 c_~max3~0)) (.cse4 (+ c_thread1Thread1of1ForFork2_~i~0 1)) (.cse7 (+ c_~A~0.offset .cse103 4)) (.cse6 (+ c_~A~0.offset .cse103))) (and (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse1 (select .cse5 .cse7)) (.cse0 (select .cse5 c_~A~0.offset)) (.cse2 (select .cse5 .cse6))) (or (not (< c_~max2~0 .cse0)) (= .cse0 .cse1) (not (< .cse2 .cse1)) (forall ((~M~0 Int)) (let ((.cse3 (select .cse5 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< c_~max3~0 .cse3)) (< .cse4 ~M~0) (<= (+ .cse0 1) .cse3)))) (not (< c_~max1~0 .cse2)))))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse9 (select .cse8 c_~A~0.offset))) (or (< c_~max3~0 (select .cse8 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (not (< c_~max2~0 .cse9)) (< .cse4 ~M~0) (< c_~max1~0 (select .cse8 .cse7)) (< c_~max1~0 (select .cse8 .cse6)) (<= c_~max3~0 .cse9))))) .cse10) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse11 (select .cse12 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< c_~max3~0 .cse11)) (< .cse4 ~M~0) (< c_~max1~0 (select .cse12 .cse7)) (<= .cse13 .cse11) (< c_~max1~0 (select .cse12 .cse6)) (< c_~max2~0 (select .cse12 c_~A~0.offset)))))) .cse14) (forall ((v_ArrVal_513 (Array Int Int)) (~M~0 Int)) (or (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse15 (select .cse16 .cse6)) (.cse17 (select .cse16 c_~A~0.offset))) (or (= .cse15 c_~max3~0) (< c_~max3~0 (select .cse16 (+ c_~A~0.offset (* ~M~0 4)))) (< .cse15 (select .cse16 .cse7)) (not (< c_~max2~0 .cse17)) (not (< c_~max1~0 .cse15)) (<= c_~max3~0 .cse17))))) (not (< 0 ~M~0)) (< .cse4 ~M~0))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse21 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse19 (select .cse21 c_~A~0.offset)) (.cse18 (select .cse21 .cse7))) (or (not (< c_~max1~0 .cse18)) (not (< c_~max2~0 .cse19)) (forall ((~M~0 Int)) (let ((.cse20 (select .cse21 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse20 .cse19) (not (< 0 ~M~0)) (not (< c_~max3~0 .cse20)) (< .cse4 ~M~0) (= .cse18 .cse20)))) (< c_~max1~0 (select .cse21 .cse6)))))) (or .cse22 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse24 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse23 (select .cse24 .cse7))) (or (= .cse23 c_~max2~0) (< c_~max3~0 (select .cse24 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (not (< c_~max1~0 .cse23)) (< .cse4 ~M~0) (< c_~max1~0 (select .cse24 .cse6)) (< c_~max2~0 (select .cse24 c_~A~0.offset))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse28 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse26 (select .cse28 c_~A~0.offset)) (.cse27 (select .cse28 .cse6))) (or (forall ((~M~0 Int)) (let ((.cse25 (select .cse28 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse25 .cse26) (not (< 0 ~M~0)) (not (< c_~max3~0 .cse25)) (< .cse4 ~M~0) (= .cse27 .cse25)))) (< .cse27 (select .cse28 .cse7)) (not (< c_~max2~0 .cse26)) (not (< c_~max1~0 .cse27)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse30 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse29 (select .cse30 c_~A~0.offset))) (or (= .cse29 c_~max1~0) (not (< c_~max2~0 .cse29)) (< c_~max1~0 (select .cse30 .cse7)) (< c_~max1~0 (select .cse30 .cse6)) (forall ((~M~0 Int)) (let ((.cse31 (select .cse30 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< c_~max3~0 .cse31)) (< .cse4 ~M~0) (<= (+ .cse29 1) .cse31)))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse33 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse32 (select .cse33 .cse6))) (or (< .cse32 (select .cse33 .cse7)) (< c_~max2~0 (select .cse33 c_~A~0.offset)) (not (< c_~max1~0 .cse32)) (forall ((~M~0 Int)) (let ((.cse34 (select .cse33 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse34 c_~max2~0) (not (< 0 ~M~0)) (not (< c_~max3~0 .cse34)) (< .cse4 ~M~0) (= .cse32 .cse34)))))))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse36 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse35 (select .cse36 .cse6))) (or (= .cse35 c_~max3~0) (< c_~max3~0 (select .cse36 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (< .cse35 (select .cse36 .cse7)) (< .cse4 ~M~0) (< c_~max2~0 (select .cse36 c_~A~0.offset)) (not (< c_~max1~0 .cse35)))))) .cse37) (or .cse37 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse38 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse39 (select .cse38 .cse7)) (.cse40 (select .cse38 .cse6))) (or (< c_~max3~0 (select .cse38 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (= .cse39 c_~max3~0) (not (< .cse40 .cse39)) (< .cse4 ~M~0) (< c_~max2~0 (select .cse38 c_~A~0.offset)) (not (< c_~max1~0 .cse40))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse42 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse41 (select .cse42 c_~A~0.offset))) (or (not (< c_~max2~0 .cse41)) (< c_~max1~0 (select .cse42 .cse7)) (forall ((~M~0 Int)) (let ((.cse43 (select .cse42 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse43 .cse41) (not (< 0 ~M~0)) (not (< c_~max3~0 .cse43)) (< .cse4 ~M~0) (= c_~max1~0 .cse43)))) (< c_~max1~0 (select .cse42 .cse6)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse45 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse44 (select .cse45 .cse6))) (or (< .cse44 (select .cse45 .cse7)) (= .cse44 c_~max2~0) (< c_~max2~0 (select .cse45 c_~A~0.offset)) (not (< c_~max1~0 .cse44)) (forall ((~M~0 Int)) (let ((.cse46 (select .cse45 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< c_~max3~0 .cse46)) (< .cse4 ~M~0) (<= .cse13 .cse46)))))))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse47 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (or (< c_~max3~0 (select .cse47 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (< .cse4 ~M~0) (< c_~max1~0 (select .cse47 .cse7)) (< c_~max1~0 (select .cse47 .cse6)) (< c_~max2~0 (select .cse47 c_~A~0.offset))))) (and .cse10 .cse22) (and .cse14 .cse37)) (or .cse37 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse48 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse49 (select .cse48 .cse7))) (or (< c_~max3~0 (select .cse48 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (= .cse49 c_~max3~0) (not (< c_~max1~0 .cse49)) (< .cse4 ~M~0) (< c_~max1~0 (select .cse48 .cse6)) (< c_~max2~0 (select .cse48 c_~A~0.offset))))))) (forall ((v_ArrVal_513 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (< .cse4 ~M~0) (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse50 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse51 (select .cse50 .cse7)) (.cse53 (select .cse50 .cse6)) (.cse52 (select .cse50 c_~A~0.offset))) (or (< c_~max3~0 (select .cse50 (+ c_~A~0.offset (* ~M~0 4)))) (= .cse51 c_~max3~0) (not (< c_~max2~0 .cse52)) (not (< .cse53 .cse51)) (not (< c_~max1~0 .cse53)) (<= c_~max3~0 .cse52))))))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse55 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse54 (select .cse55 .cse7)) (.cse56 (select .cse55 .cse6))) (or (= .cse54 c_~max2~0) (< c_~max3~0 (select .cse55 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (not (< .cse56 .cse54)) (< .cse4 ~M~0) (< c_~max2~0 (select .cse55 c_~A~0.offset)) (not (< c_~max1~0 .cse56)))))) .cse22) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse61 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse57 (select .cse61 c_~A~0.offset)) (.cse59 (select .cse61 .cse7)) (.cse58 (select .cse61 .cse6))) (or (not (< c_~max2~0 .cse57)) (not (< .cse58 .cse59)) (forall ((~M~0 Int)) (let ((.cse60 (select .cse61 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse60 .cse57) (not (< 0 ~M~0)) (not (< c_~max3~0 .cse60)) (< .cse4 ~M~0) (= .cse59 .cse60)))) (not (< c_~max1~0 .cse58)))))) (forall ((v_ArrVal_513 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (< .cse4 ~M~0) (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse62 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse63 (select .cse62 c_~A~0.offset)) (.cse64 (select .cse62 .cse6))) (or (< c_~max3~0 (select .cse62 (+ c_~A~0.offset (* ~M~0 4)))) (<= (+ .cse63 1) c_~max3~0) (< .cse64 (select .cse62 .cse7)) (= .cse63 .cse64) (not (< c_~max2~0 .cse63)) (not (< c_~max1~0 .cse64)))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse67 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse65 (select .cse67 .cse7)) (.cse66 (select .cse67 c_~A~0.offset))) (or (not (< c_~max1~0 .cse65)) (not (< c_~max2~0 .cse66)) (= .cse66 .cse65) (< c_~max1~0 (select .cse67 .cse6)) (forall ((~M~0 Int)) (let ((.cse68 (select .cse67 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< c_~max3~0 .cse68)) (< .cse4 ~M~0) (<= (+ .cse66 1) .cse68)))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse70 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse71 (select .cse70 c_~A~0.offset)) (.cse69 (select .cse70 .cse6))) (or (< .cse69 (select .cse70 .cse7)) (= .cse71 .cse69) (not (< c_~max2~0 .cse71)) (forall ((~M~0 Int)) (let ((.cse72 (select .cse70 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< c_~max3~0 .cse72)) (< .cse4 ~M~0) (<= (+ .cse71 1) .cse72)))) (not (< c_~max1~0 .cse69)))))) (forall ((v_ArrVal_513 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (< .cse4 ~M~0) (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse73 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse74 (select .cse73 c_~A~0.offset)) (.cse75 (select .cse73 .cse7))) (or (< c_~max3~0 (select .cse73 (+ c_~A~0.offset (* ~M~0 4)))) (<= (+ .cse74 1) c_~max3~0) (not (< c_~max1~0 .cse75)) (not (< c_~max2~0 .cse74)) (= .cse74 .cse75) (< c_~max1~0 (select .cse73 .cse6)))))))) (or .cse22 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse76 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse77 (select .cse76 .cse6))) (or (< c_~max3~0 (select .cse76 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (< .cse77 (select .cse76 .cse7)) (< .cse4 ~M~0) (= .cse77 c_~max2~0) (< c_~max2~0 (select .cse76 c_~A~0.offset)) (not (< c_~max1~0 .cse77))))))) (forall ((v_ArrVal_513 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (< .cse4 ~M~0) (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse78 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse79 (select .cse78 .cse7)) (.cse80 (select .cse78 c_~A~0.offset))) (or (< c_~max3~0 (select .cse78 (+ c_~A~0.offset (* ~M~0 4)))) (= .cse79 c_~max3~0) (not (< c_~max1~0 .cse79)) (not (< c_~max2~0 .cse80)) (< c_~max1~0 (select .cse78 .cse6)) (<= c_~max3~0 .cse80))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse82 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse81 (select .cse82 .cse7))) (or (not (< c_~max1~0 .cse81)) (< c_~max1~0 (select .cse82 .cse6)) (< c_~max2~0 (select .cse82 c_~A~0.offset)) (forall ((~M~0 Int)) (let ((.cse83 (select .cse82 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse83 c_~max2~0) (not (< 0 ~M~0)) (not (< c_~max3~0 .cse83)) (< .cse4 ~M~0) (= .cse81 .cse83)))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse86 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse84 (select .cse86 .cse7)) (.cse85 (select .cse86 .cse6))) (or (= .cse84 c_~max2~0) (not (< .cse85 .cse84)) (< c_~max2~0 (select .cse86 c_~A~0.offset)) (not (< c_~max1~0 .cse85)) (forall ((~M~0 Int)) (let ((.cse87 (select .cse86 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< c_~max3~0 .cse87)) (< .cse4 ~M~0) (<= .cse13 .cse87)))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse89 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse88 (select .cse89 .cse7))) (or (= .cse88 c_~max2~0) (not (< c_~max1~0 .cse88)) (< c_~max1~0 (select .cse89 .cse6)) (< c_~max2~0 (select .cse89 c_~A~0.offset)) (forall ((~M~0 Int)) (let ((.cse90 (select .cse89 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< c_~max3~0 .cse90)) (< .cse4 ~M~0) (<= .cse13 .cse90)))))))) (forall ((v_ArrVal_513 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse91 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse92 (select .cse91 c_~A~0.offset)) (.cse93 (select .cse91 .cse7)) (.cse94 (select .cse91 .cse6))) (or (< c_~max3~0 (select .cse91 (+ c_~A~0.offset (* ~M~0 4)))) (<= (+ .cse92 1) c_~max3~0) (not (< c_~max2~0 .cse92)) (= .cse92 .cse93) (not (< .cse94 .cse93)) (not (< c_~max1~0 .cse94)))))) (< .cse4 ~M~0))) (forall ((v_ArrVal_513 (Array Int Int)) (~M~0 Int)) (or (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse95 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse96 (select .cse95 c_~A~0.offset))) (or (< c_~max3~0 (select .cse95 (+ c_~A~0.offset (* ~M~0 4)))) (= .cse96 c_~max1~0) (<= (+ .cse96 1) c_~max3~0) (not (< c_~max2~0 .cse96)) (< c_~max1~0 (select .cse95 .cse7)) (< c_~max1~0 (select .cse95 .cse6)))))) (not (< 0 ~M~0)) (< .cse4 ~M~0))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse98 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (or (forall ((~M~0 Int)) (let ((.cse97 (select .cse98 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse97 c_~max2~0) (not (< 0 ~M~0)) (not (< c_~max3~0 .cse97)) (< .cse4 ~M~0) (= c_~max1~0 .cse97)))) (< c_~max1~0 (select .cse98 .cse7)) (< c_~max1~0 (select .cse98 .cse6)) (< c_~max2~0 (select .cse98 c_~A~0.offset))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse101 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse99 (select .cse101 .cse6)) (.cse100 (select .cse101 .cse7))) (or (not (< .cse99 .cse100)) (< c_~max2~0 (select .cse101 c_~A~0.offset)) (not (< c_~max1~0 .cse99)) (forall ((~M~0 Int)) (let ((.cse102 (select .cse101 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse102 c_~max2~0) (not (< 0 ~M~0)) (not (< c_~max3~0 .cse102)) (< .cse4 ~M~0) (= .cse100 .cse102))))))))))) is different from false [2022-11-16 04:01:09,209 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse22 (+ c_~max2~0 1))) (let ((.cse6 (<= c_~max3~0 c_~max2~0)) (.cse4 (<= .cse22 c_~max3~0)) (.cse3 (= c_~max1~0 c_~max3~0)) (.cse2 (+ c_~A~0.offset 4)) (.cse5 (= c_~max1~0 c_~max2~0))) (and (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse0 (select .cse1 c_~A~0.offset))) (or (< c_~max1~0 .cse0) (< c_~max3~0 (select .cse1 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (< c_~max1~0 (select .cse1 .cse2)) (< c_~max2~0 .cse0) (< 1 ~M~0))))) (and .cse3 .cse4) (and .cse5 .cse6)) (or .cse6 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse7 (select .cse8 c_~A~0.offset)) (.cse9 (select .cse8 .cse2))) (or (< c_~max1~0 .cse7) (< c_~max3~0 (select .cse8 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (not (< c_~max1~0 .cse9)) (< c_~max2~0 .cse7) (< 1 ~M~0) (= .cse9 c_~max3~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse10 (select .cse11 c_~A~0.offset))) (or (not (< c_~max1~0 .cse10)) (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (not (< c_~max3~0 (select .cse11 (+ c_~A~0.offset (* ~M~0 4))))) (< 1 ~M~0))) (= .cse10 c_~max2~0) (< c_~max2~0 .cse10) (< .cse10 (select .cse11 .cse2)))))) (or .cse4 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse12 (select .cse13 c_~A~0.offset)) (.cse14 (select .cse13 .cse2))) (or (not (< c_~max1~0 .cse12)) (< c_~max3~0 (select .cse13 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (not (< .cse12 .cse14)) (= .cse14 c_~max2~0) (< 1 ~M~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse15 (select .cse16 c_~A~0.offset))) (or (< c_~max1~0 .cse15) (< c_~max1~0 (select .cse16 .cse2)) (< c_~max2~0 .cse15) (forall ((~M~0 Int)) (let ((.cse17 (select .cse16 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse17 c_~max2~0) (not (< 0 ~M~0)) (not (< c_~max3~0 .cse17)) (< 1 ~M~0) (= c_~max1~0 .cse17)))))))) (or .cse4 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse19 (select .cse18 .cse2))) (or (< c_~max1~0 (select .cse18 c_~A~0.offset)) (< c_~max3~0 (select .cse18 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (not (< c_~max1~0 .cse19)) (= .cse19 c_~max2~0) (< 1 ~M~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse23 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse20 (select .cse23 c_~A~0.offset)) (.cse24 (select .cse23 .cse2))) (or (not (< c_~max1~0 .cse20)) (forall ((~M~0 Int)) (let ((.cse21 (select .cse23 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< c_~max3~0 .cse21)) (<= .cse22 .cse21) (< 1 ~M~0)))) (not (< .cse20 .cse24)) (< c_~max2~0 .cse20) (= .cse24 c_~max2~0))))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse26 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse25 (select .cse26 c_~A~0.offset))) (or (not (< c_~max1~0 .cse25)) (not (< 0 ~M~0)) (< c_~max2~0 .cse25) (< 1 ~M~0) (< .cse25 (select .cse26 .cse2)))))) .cse6) (forall ((v_ArrVal_513 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (< 1 ~M~0) (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse28 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse27 (select .cse28 c_~A~0.offset)) (.cse29 (select .cse28 .cse2))) (or (not (< c_~max1~0 .cse27)) (< c_~max3~0 (select .cse28 (+ c_~A~0.offset (* ~M~0 4)))) (not (< .cse27 .cse29)) (not (< c_~max2~0 .cse27)) (= .cse29 c_~max3~0))))))) (or .cse6 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse31 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse30 (select .cse31 c_~A~0.offset)) (.cse32 (select .cse31 .cse2))) (or (not (< c_~max1~0 .cse30)) (< c_~max3~0 (select .cse31 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (not (< .cse30 .cse32)) (< c_~max2~0 .cse30) (< 1 ~M~0) (= .cse32 c_~max3~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse34 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse33 (select .cse34 c_~A~0.offset))) (or (<= .cse33 c_~max1~0) (<= .cse33 c_~max2~0) (<= c_~max3~0 .cse33) (< .cse33 (select .cse34 .cse2)))))) (< 1 ~M~0))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse37 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse35 (select .cse37 c_~A~0.offset))) (or (< c_~max1~0 .cse35) (forall ((~M~0 Int)) (let ((.cse36 (select .cse37 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< c_~max3~0 .cse36)) (< 1 ~M~0) (<= (+ .cse35 1) .cse36)))) (< c_~max1~0 (select .cse37 .cse2)) (= .cse35 c_~max1~0) (not (< c_~max2~0 .cse35)))))) (or .cse4 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse39 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse38 (select .cse39 c_~A~0.offset))) (or (not (< c_~max1~0 .cse38)) (< c_~max3~0 (select .cse39 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (= .cse38 c_~max2~0) (< c_~max2~0 .cse38) (< 1 ~M~0) (< .cse38 (select .cse39 .cse2))))))) (forall ((v_ArrVal_513 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse41 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse40 (select .cse41 c_~A~0.offset))) (or (< c_~max1~0 .cse40) (< c_~max3~0 (select .cse41 (+ c_~A~0.offset (* ~M~0 4)))) (= .cse40 c_~max1~0) (<= (+ .cse40 1) c_~max3~0) (not (< c_~max2~0 .cse40)))))) (< 1 ~M~0))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse44 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse42 (select .cse44 c_~A~0.offset)) (.cse45 (select .cse44 .cse2))) (or (< c_~max1~0 .cse42) (forall ((~M~0 Int)) (let ((.cse43 (select .cse44 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< c_~max3~0 .cse43)) (<= .cse22 .cse43) (< 1 ~M~0)))) (not (< c_~max1~0 .cse45)) (< c_~max2~0 .cse42) (= .cse45 c_~max2~0))))) (or .cse3 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse47 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse46 (select .cse47 c_~A~0.offset))) (or (< c_~max1~0 .cse46) (< c_~max3~0 (select .cse47 (+ c_~A~0.offset (* ~M~0 4)))) (not (< 0 ~M~0)) (< c_~max1~0 (select .cse47 .cse2)) (not (< c_~max2~0 .cse46)) (<= c_~max3~0 .cse46) (< 1 ~M~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (< 1 ~M~0) (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse49 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse48 (select .cse49 c_~A~0.offset)) (.cse50 (select .cse49 .cse2))) (or (< c_~max1~0 .cse48) (< c_~max3~0 (select .cse49 (+ c_~A~0.offset (* ~M~0 4)))) (not (< c_~max2~0 .cse48)) (not (< c_~max1~0 .cse50)) (= .cse50 c_~max3~0))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse52 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse51 (select .cse52 c_~A~0.offset))) (or (< c_~max1~0 .cse51) (< c_~max1~0 (select .cse52 .cse2)) (not (< c_~max2~0 .cse51)) (forall ((~M~0 Int)) (let ((.cse53 (select .cse52 (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse53 .cse51) (not (< 0 ~M~0)) (not (< c_~max3~0 .cse53)) (< 1 ~M~0) (= c_~max1~0 .cse53)))))))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse55 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse56 (select .cse55 (+ c_~A~0.offset (* ~M~0 4)))) (.cse54 (select .cse55 c_~A~0.offset))) (or (< c_~max1~0 .cse54) (not (< 0 ~M~0)) (< c_~max1~0 (select .cse55 .cse2)) (not (< c_~max3~0 .cse56)) (<= .cse22 .cse56) (< c_~max2~0 .cse54) (< 1 ~M~0))))) .cse5)))) is different from false [2022-11-16 04:01:11,407 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse18 (+ c_~max2~0 1))) (let ((.cse0 (= c_~max1~0 c_~max3~0)) (.cse7 (<= c_~max3~0 c_~max2~0)) (.cse11 (<= .cse18 c_~max3~0)) (.cse12 (= c_~max1~0 c_~max2~0)) (.cse3 (+ c_~A~0.offset 4))) (and (or .cse0 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse1 (select .cse2 c_~A~0.offset))) (or (not (< 0 ~M~0)) (< c_~max1~0 .cse1) (not (< c_~max2~0 .cse1)) (< c_~max1~0 (select .cse2 .cse3)) (< c_~max3~0 (select .cse2 (+ c_~A~0.offset (* ~M~0 4)))) (<= c_~max3~0 .cse1) (< 1 ~M~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse4 (select .cse6 c_~A~0.offset)) (.cse5 (select .cse6 .cse3))) (or (< c_~max1~0 .cse4) (not (< c_~max2~0 .cse4)) (not (< c_~max1~0 .cse5)) (= .cse5 c_~max3~0) (< c_~max3~0 (select .cse6 (+ c_~A~0.offset (* ~M~0 4)))))))) (< 1 ~M~0))) (or .cse7 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse9 (select .cse10 .cse3)) (.cse8 (select .cse10 c_~A~0.offset))) (or (not (< 0 ~M~0)) (< c_~max1~0 .cse8) (not (< c_~max1~0 .cse9)) (= .cse9 c_~max3~0) (< c_~max3~0 (select .cse10 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max2~0 .cse8) (< 1 ~M~0)))))) (or (and .cse0 .cse11) (and .cse12 .cse7) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse14 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse13 (select .cse14 c_~A~0.offset))) (or (not (< 0 ~M~0)) (< c_~max1~0 .cse13) (< c_~max1~0 (select .cse14 .cse3)) (< c_~max3~0 (select .cse14 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max2~0 .cse13) (< 1 ~M~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse19 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse16 (select .cse19 .cse3)) (.cse15 (select .cse19 c_~A~0.offset))) (or (< c_~max1~0 .cse15) (not (< c_~max1~0 .cse16)) (= .cse16 c_~max2~0) (< c_~max2~0 .cse15) (forall ((~M~0 Int)) (let ((.cse17 (select .cse19 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< c_~max3~0 .cse17)) (<= .cse18 .cse17) (< 1 ~M~0)))))))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse21 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse20 (select .cse21 c_~A~0.offset))) (or (< .cse20 (select .cse21 .cse3)) (not (< c_~max1~0 .cse20)) (< c_~max2~0 .cse20))))) .cse7) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse23 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse22 (select .cse23 c_~A~0.offset))) (or (< c_~max1~0 .cse22) (not (< c_~max2~0 .cse22)) (< c_~max1~0 (select .cse23 .cse3)) (= .cse22 c_~max1~0) (forall ((~M~0 Int)) (let ((.cse24 (select .cse23 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< c_~max3~0 .cse24)) (< 1 ~M~0) (<= (+ .cse22 1) .cse24)))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse27 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse26 (select .cse27 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse25 (select .cse27 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< c_~max3~0 .cse25)) (= .cse25 c_~max1~0) (<= .cse25 .cse26) (< 1 ~M~0)))) (< c_~max1~0 .cse26) (not (< c_~max2~0 .cse26)) (< c_~max1~0 (select .cse27 .cse3)))))) (or .cse11 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse30 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse28 (select .cse30 c_~A~0.offset)) (.cse29 (select .cse30 .cse3))) (or (not (< 0 ~M~0)) (not (< .cse28 .cse29)) (not (< c_~max1~0 .cse28)) (< c_~max3~0 (select .cse30 (+ c_~A~0.offset (* ~M~0 4)))) (= .cse29 c_~max2~0) (< 1 ~M~0)))))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse31 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse32 (select .cse31 .cse3))) (or (not (< 0 ~M~0)) (< c_~max1~0 (select .cse31 c_~A~0.offset)) (not (< c_~max1~0 .cse32)) (< c_~max3~0 (select .cse31 (+ c_~A~0.offset (* ~M~0 4)))) (= .cse32 c_~max2~0) (< 1 ~M~0))))) .cse11) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse34 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse33 (select .cse34 c_~A~0.offset))) (or (< .cse33 (select .cse34 .cse3)) (<= .cse33 c_~max1~0) (<= .cse33 c_~max2~0) (<= c_~max3~0 .cse33))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse38 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse36 (select .cse38 .cse3)) (.cse35 (select .cse38 c_~A~0.offset))) (or (not (< .cse35 .cse36)) (not (< c_~max1~0 .cse35)) (= .cse36 c_~max2~0) (< c_~max2~0 .cse35) (forall ((~M~0 Int)) (let ((.cse37 (select .cse38 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< c_~max3~0 .cse37)) (<= .cse18 .cse37) (< 1 ~M~0)))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse40 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse39 (select .cse40 c_~A~0.offset))) (or (< .cse39 (select .cse40 .cse3)) (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (not (< c_~max3~0 (select .cse40 (+ c_~A~0.offset (* ~M~0 4))))) (< 1 ~M~0))) (= .cse39 c_~max2~0) (not (< c_~max1~0 .cse39)) (< c_~max2~0 .cse39))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (or (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse42 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse41 (select .cse42 c_~A~0.offset))) (or (<= (+ .cse41 1) c_~max3~0) (< c_~max1~0 .cse41) (not (< c_~max2~0 .cse41)) (= .cse41 c_~max1~0) (< c_~max3~0 (select .cse42 (+ c_~A~0.offset (* ~M~0 4)))))))) (not (< 0 ~M~0)) (< 1 ~M~0))) (or .cse7 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse45 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse44 (select .cse45 .cse3)) (.cse43 (select .cse45 c_~A~0.offset))) (or (not (< 0 ~M~0)) (not (< .cse43 .cse44)) (= .cse44 c_~max3~0) (not (< c_~max1~0 .cse43)) (< c_~max3~0 (select .cse45 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max2~0 .cse43) (< 1 ~M~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (or (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse48 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse47 (select .cse48 .cse3)) (.cse46 (select .cse48 c_~A~0.offset))) (or (not (< c_~max2~0 .cse46)) (not (< .cse46 .cse47)) (= .cse47 c_~max3~0) (not (< c_~max1~0 .cse46)) (< c_~max3~0 (select .cse48 (+ c_~A~0.offset (* ~M~0 4)))))))) (not (< 0 ~M~0)) (< 1 ~M~0))) (or .cse11 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse50 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse49 (select .cse50 c_~A~0.offset))) (or (< .cse49 (select .cse50 .cse3)) (not (< 0 ~M~0)) (= .cse49 c_~max2~0) (not (< c_~max1~0 .cse49)) (< c_~max3~0 (select .cse50 (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max2~0 .cse49) (< 1 ~M~0)))))) (or .cse12 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse53 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse51 (select .cse53 (+ c_~A~0.offset (* ~M~0 4)))) (.cse52 (select .cse53 c_~A~0.offset))) (or (not (< 0 ~M~0)) (not (< c_~max3~0 .cse51)) (< c_~max1~0 .cse52) (<= .cse18 .cse51) (< c_~max1~0 (select .cse53 .cse3)) (< c_~max2~0 .cse52) (< 1 ~M~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse56 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse54 (select .cse56 c_~A~0.offset))) (or (< c_~max1~0 .cse54) (forall ((~M~0 Int)) (let ((.cse55 (select .cse56 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< c_~max3~0 .cse55)) (<= .cse55 c_~max2~0) (= .cse55 c_~max1~0) (< 1 ~M~0)))) (< c_~max1~0 (select .cse56 .cse3)) (< c_~max2~0 .cse54)))))))) is different from false [2022-11-16 04:01:18,357 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse20 (+ c_~max2~0 1))) (let ((.cse2 (= c_~max1~0 c_~max2~0)) (.cse3 (<= c_~max3~0 c_~max2~0)) (.cse1 (<= .cse20 c_~max3~0)) (.cse0 (= c_~max1~0 c_~max3~0)) (.cse6 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4))) (and (or (and .cse0 .cse1) (and .cse2 .cse3) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~max2~0 .cse4) (not (< 0 ~M~0)) (< c_~max1~0 (select .cse5 .cse6)) (< c_~max3~0 (select .cse5 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (< 1 ~M~0) (< c_~max1~0 .cse4)))))) (or .cse3 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~max2~0 .cse7) (not (< c_~max1~0 .cse7)) (< .cse7 (select .cse8 .cse6))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~max2~0 .cse9) (= c_~max2~0 .cse9) (not (< c_~max1~0 .cse9)) (< .cse9 (select .cse10 .cse6)) (forall ((~M~0 Int)) (or (not (< c_~max3~0 (select .cse10 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (not (< 0 ~M~0)) (< 1 ~M~0))))))) (or .cse3 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse12 (select .cse13 .cse6))) (or (< c_~max2~0 .cse11) (not (< c_~max1~0 .cse11)) (= .cse12 c_~max3~0) (not (< 0 ~M~0)) (< c_~max3~0 (select .cse13 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (not (< .cse11 .cse12)) (< 1 ~M~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse16 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse15 (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (forall ((~M~0 Int)) (let ((.cse14 (select .cse16 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< c_~max3~0 .cse14)) (not (< 0 ~M~0)) (<= .cse14 .cse15) (< 1 ~M~0) (= c_~max1~0 .cse14)))) (< c_~max1~0 (select .cse16 .cse6)) (not (< c_~max2~0 .cse15)) (< c_~max1~0 .cse15))))) (or .cse2 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse19 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse17 (select .cse19 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (.cse18 (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (not (< c_~max3~0 .cse17)) (< c_~max2~0 .cse18) (not (< 0 ~M~0)) (< c_~max1~0 (select .cse19 .cse6)) (<= .cse20 .cse17) (< 1 ~M~0) (< c_~max1~0 .cse18)))))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse23 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse21 (select .cse23 .cse6)) (.cse22 (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (not (< c_~max1~0 .cse21)) (< c_~max2~0 .cse22) (= .cse21 c_~max3~0) (not (< 0 ~M~0)) (< c_~max3~0 (select .cse23 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (< 1 ~M~0) (< c_~max1~0 .cse22))))) .cse3) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse27 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse24 (select .cse27 .cse6)) (.cse25 (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (not (< c_~max1~0 .cse24)) (< c_~max2~0 .cse25) (forall ((~M~0 Int)) (let ((.cse26 (select .cse27 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< c_~max3~0 .cse26)) (not (< 0 ~M~0)) (<= .cse20 .cse26) (< 1 ~M~0)))) (= .cse24 c_~max2~0) (< c_~max1~0 .cse25))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse30 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse29 (select .cse30 .cse6)) (.cse28 (select .cse30 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (not (< c_~max1~0 .cse28)) (= .cse29 c_~max3~0) (< c_~max3~0 (select .cse30 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (not (< .cse28 .cse29)) (not (< c_~max2~0 .cse28)))))) (< 1 ~M~0))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse32 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse31 (select .cse32 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~max2~0 .cse31) (< c_~max1~0 (select .cse32 .cse6)) (forall ((~M~0 Int)) (let ((.cse33 (select .cse32 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< c_~max3~0 .cse33)) (not (< 0 ~M~0)) (<= .cse33 c_~max2~0) (< 1 ~M~0) (= c_~max1~0 .cse33)))) (< c_~max1~0 .cse31))))) (or .cse1 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse35 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse34 (select .cse35 .cse6))) (or (not (< c_~max1~0 .cse34)) (not (< 0 ~M~0)) (< c_~max3~0 (select .cse35 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (= .cse34 c_~max2~0) (< 1 ~M~0) (< c_~max1~0 (select .cse35 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (or (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse37 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse36 (select .cse37 .cse6)) (.cse38 (select .cse37 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (not (< c_~max1~0 .cse36)) (= .cse36 c_~max3~0) (< c_~max3~0 (select .cse37 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (not (< c_~max2~0 .cse38)) (< c_~max1~0 .cse38))))) (not (< 0 ~M~0)) (< 1 ~M~0))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse40 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse39 (select .cse40 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse41 (select .cse40 .cse6))) (or (not (< c_~max1~0 .cse39)) (not (< 0 ~M~0)) (< c_~max3~0 (select .cse40 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (= .cse41 c_~max2~0) (not (< .cse39 .cse41)) (< 1 ~M~0))))) .cse1) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse44 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse42 (select .cse44 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse45 (select .cse44 .cse6))) (or (< c_~max2~0 .cse42) (not (< c_~max1~0 .cse42)) (forall ((~M~0 Int)) (let ((.cse43 (select .cse44 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< c_~max3~0 .cse43)) (not (< 0 ~M~0)) (<= .cse20 .cse43) (< 1 ~M~0)))) (= .cse45 c_~max2~0) (not (< .cse42 .cse45)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse48 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse46 (select .cse48 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= c_~max1~0 .cse46) (forall ((~M~0 Int)) (let ((.cse47 (select .cse48 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< c_~max3~0 .cse47)) (<= (+ .cse46 1) .cse47) (not (< 0 ~M~0)) (< 1 ~M~0)))) (< c_~max1~0 (select .cse48 .cse6)) (not (< c_~max2~0 .cse46)) (< c_~max1~0 .cse46))))) (or .cse0 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse50 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse49 (select .cse50 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (not (< 0 ~M~0)) (<= c_~max3~0 .cse49) (< c_~max1~0 (select .cse50 .cse6)) (< c_~max3~0 (select .cse50 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (< 1 ~M~0) (not (< c_~max2~0 .cse49)) (< c_~max1~0 .cse49)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse52 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse51 (select .cse52 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~max2~0 .cse51) (= c_~max2~0 .cse51) (not (< c_~max1~0 .cse51)) (not (< 0 ~M~0)) (< .cse51 (select .cse52 .cse6)) (< c_~max3~0 (select .cse52 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (< 1 ~M~0))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse54 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse53 (select .cse54 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= c_~max1~0 .cse53) (< c_~max3~0 (select .cse54 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (<= (+ .cse53 1) c_~max3~0) (not (< c_~max2~0 .cse53)) (< c_~max1~0 .cse53))))) (< 1 ~M~0))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse56 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse55 (select .cse56 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (<= .cse55 c_~max2~0) (<= c_~max3~0 .cse55) (< .cse55 (select .cse56 .cse6)) (<= .cse55 c_~max1~0)))))))) is different from false [2022-11-16 04:01:18,882 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse31 (+ c_~max2~0 1))) (let ((.cse28 (= c_~max1~0 c_~max3~0)) (.cse11 (<= .cse31 c_~max3~0)) (.cse6 (<= c_~max3~0 c_~max2~0)) (.cse41 (= c_~max1~0 c_~max2~0)) (.cse2 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse0 (select .cse1 .cse2)) (forall ((~M~0 Int)) (or (not (< 0 ~M~0)) (not (< c_~max3~0 (select .cse1 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< 1 ~M~0))) (not (< c_~max1~0 .cse0)) (< c_~max2~0 .cse0) (= .cse0 c_~max2~0))))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (select .cse5 .cse2))) (or (< c_~max1~0 .cse3) (not (< c_~max1~0 .cse4)) (not (< 0 ~M~0)) (< c_~max3~0 (select .cse5 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< c_~max2~0 .cse3) (= c_~max3~0 .cse4) (< 1 ~M~0))))) .cse6) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< c_~max1~0 .cse7) (<= (+ .cse7 1) c_~max3~0) (< c_~max3~0 (select .cse8 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (= .cse7 c_~max1~0) (not (< c_~max2~0 .cse7)))))) (< 1 ~M~0))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse10 (select .cse9 .cse2))) (or (< c_~max1~0 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (not (< c_~max1~0 .cse10)) (not (< 0 ~M~0)) (< c_~max3~0 (select .cse9 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (= c_~max2~0 .cse10) (< 1 ~M~0))))) .cse11) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse12 (select .cse13 .cse2)) (<= .cse12 c_~max1~0) (<= .cse12 c_~max2~0) (<= c_~max3~0 .cse12))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse15 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse14 (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< 0 ~M~0)) (< .cse14 (select .cse15 .cse2)) (< c_~max3~0 (select .cse15 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (< c_~max1~0 .cse14)) (< c_~max2~0 .cse14) (= .cse14 c_~max2~0) (< 1 ~M~0))))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse16 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse18 (select .cse16 .cse2))) (or (not (< 0 ~M~0)) (< c_~max3~0 (select .cse16 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (< c_~max1~0 .cse17)) (< c_~max2~0 .cse17) (not (< .cse17 .cse18)) (= c_~max3~0 .cse18) (< 1 ~M~0))))) .cse6) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (or (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse21 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse19 (select .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse20 (select .cse21 .cse2))) (or (< c_~max1~0 .cse19) (not (< c_~max1~0 .cse20)) (< c_~max3~0 (select .cse21 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (< c_~max2~0 .cse19)) (= c_~max3~0 .cse20))))) (not (< 0 ~M~0)) (< 1 ~M~0))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse22 (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< c_~max1~0 .cse22) (= .cse22 c_~max1~0) (forall ((~M~0 Int)) (let ((.cse23 (select .cse24 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= (+ .cse22 1) .cse23) (not (< 0 ~M~0)) (not (< c_~max3~0 .cse23)) (< 1 ~M~0)))) (not (< c_~max2~0 .cse22)) (< c_~max1~0 (select .cse24 .cse2)))))) (or .cse11 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse25 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse27 (select .cse25 .cse2))) (or (not (< 0 ~M~0)) (< c_~max3~0 (select .cse25 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (< c_~max1~0 .cse26)) (not (< .cse26 .cse27)) (= c_~max2~0 .cse27) (< 1 ~M~0)))))) (or .cse28 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse30 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse29 (select .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< c_~max1~0 .cse29) (not (< 0 ~M~0)) (< c_~max3~0 (select .cse30 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (< c_~max2~0 .cse29)) (<= c_~max3~0 .cse29) (< 1 ~M~0) (< c_~max1~0 (select .cse30 .cse2))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse33 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse34 (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse35 (select .cse33 .cse2))) (or (forall ((~M~0 Int)) (let ((.cse32 (select .cse33 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< 0 ~M~0)) (<= .cse31 .cse32) (not (< c_~max3~0 .cse32)) (< 1 ~M~0)))) (not (< c_~max1~0 .cse34)) (< c_~max2~0 .cse34) (not (< .cse34 .cse35)) (= c_~max2~0 .cse35))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse38 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse36 (select .cse38 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< c_~max1~0 .cse36) (< c_~max2~0 .cse36) (forall ((~M~0 Int)) (let ((.cse37 (select .cse38 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< 0 ~M~0)) (= c_~max1~0 .cse37) (not (< c_~max3~0 .cse37)) (<= .cse37 c_~max2~0) (< 1 ~M~0)))) (< c_~max1~0 (select .cse38 .cse2)))))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse40 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse39 (select .cse40 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< c_~max1~0 .cse39) (not (< 0 ~M~0)) (< c_~max3~0 (select .cse40 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< c_~max2~0 .cse39) (< 1 ~M~0) (< c_~max1~0 (select .cse40 .cse2)))))) (and .cse28 .cse11) (and .cse41 .cse6)) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse44 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse43 (select .cse44 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((~M~0 Int)) (let ((.cse42 (select .cse44 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< 0 ~M~0)) (<= .cse42 .cse43) (= c_~max1~0 .cse42) (not (< c_~max3~0 .cse42)) (< 1 ~M~0)))) (< c_~max1~0 .cse43) (not (< c_~max2~0 .cse43)) (< c_~max1~0 (select .cse44 .cse2)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse48 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse45 (select .cse48 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse46 (select .cse48 .cse2))) (or (< c_~max1~0 .cse45) (not (< c_~max1~0 .cse46)) (forall ((~M~0 Int)) (let ((.cse47 (select .cse48 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< 0 ~M~0)) (<= .cse31 .cse47) (not (< c_~max3~0 .cse47)) (< 1 ~M~0)))) (< c_~max2~0 .cse45) (= c_~max2~0 .cse46))))) (or .cse6 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse50 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse49 (select .cse50 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse49 (select .cse50 .cse2)) (not (< c_~max1~0 .cse49)) (< c_~max2~0 .cse49)))))) (or .cse41 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse53 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse51 (select .cse53 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse52 (select .cse53 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< c_~max1~0 .cse51) (not (< 0 ~M~0)) (<= .cse31 .cse52) (< c_~max2~0 .cse51) (not (< c_~max3~0 .cse52)) (< 1 ~M~0) (< c_~max1~0 (select .cse53 .cse2))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse54 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_512) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse55 (select .cse54 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse56 (select .cse54 .cse2))) (or (< c_~max3~0 (select .cse54 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (< c_~max1~0 .cse55)) (not (< .cse55 .cse56)) (not (< c_~max2~0 .cse55)) (= c_~max3~0 .cse56))))) (< 1 ~M~0)))))) is different from false [2022-11-16 04:01:21,351 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:01:21,351 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 185 treesize of output 125 [2022-11-16 04:01:21,371 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:01:21,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1657 treesize of output 1589 [2022-11-16 04:01:21,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 04:01:21,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1079 treesize of output 1031 [2022-11-16 04:01:21,451 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:01:21,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1537 treesize of output 1349 [2022-11-16 04:01:21,504 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:01:21,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1345 treesize of output 1253 [2022-11-16 04:01:22,704 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 04:01:22,704 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 1 [2022-11-16 04:01:22,714 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:01:22,714 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 86 [2022-11-16 04:01:22,728 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:01:22,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 518 treesize of output 498 [2022-11-16 04:01:22,748 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:01:22,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 494 treesize of output 434 [2022-11-16 04:01:22,765 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:01:22,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 430 treesize of output 402 [2022-11-16 04:01:22,787 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:01:22,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 257 treesize of output 245 [2022-11-16 04:01:23,217 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:01:23,217 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 208 treesize of output 136 [2022-11-16 04:01:23,237 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:01:23,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1661 treesize of output 1589 [2022-11-16 04:01:23,273 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:01:23,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1585 treesize of output 1397 [2022-11-16 04:01:23,306 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:01:23,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1393 treesize of output 1301 [2022-11-16 04:01:23,341 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:01:23,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1297 treesize of output 1253 [2022-11-16 04:01:24,555 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:01:24,556 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 113 [2022-11-16 04:01:24,576 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:01:24,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1315 treesize of output 1259 [2022-11-16 04:01:24,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 04:01:24,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 751 treesize of output 715 [2022-11-16 04:01:24,628 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:01:24,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1219 treesize of output 1079 [2022-11-16 04:01:24,660 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:01:24,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1075 treesize of output 1007 [2022-11-16 04:01:26,460 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 04:01:26,460 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 1 [2022-11-16 04:01:26,467 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:01:26,467 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 77 [2022-11-16 04:01:26,476 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:01:26,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 377 treesize of output 359 [2022-11-16 04:01:26,505 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:01:26,506 INFO L350 Elim1Store]: Elim1 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 359 treesize of output 319 [2022-11-16 04:01:26,515 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:01:26,516 INFO L350 Elim1Store]: Elim1 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 319 treesize of output 299 [2022-11-16 04:01:26,526 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:01:26,527 INFO L350 Elim1Store]: Elim1 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 205 treesize of output 195 [2022-11-16 04:01:26,875 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:01:26,875 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 102 [2022-11-16 04:01:26,901 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:01:26,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5403 treesize of output 5183 [2022-11-16 04:01:26,977 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:01:26,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5179 treesize of output 4607 [2022-11-16 04:01:27,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 04:01:27,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2795 treesize of output 2651 [2022-11-16 04:01:27,109 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:01:27,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4459 treesize of output 4175 [2022-11-16 04:03:44,087 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 04:03:44,089 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 1 [2022-11-16 04:03:44,097 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 04:03:44,097 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 1 [2022-11-16 04:03:44,104 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 04:03:44,105 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 1 [2022-11-16 04:03:44,112 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:03:44,113 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 100 [2022-11-16 04:03:44,127 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 04:03:44,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1279 treesize of output 1231 [2022-11-16 04:03:44,146 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 04:03:44,147 INFO L350 Elim1Store]: Elim1 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 1231 treesize of output 1119 [2022-11-16 04:03:44,166 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 04:03:44,166 INFO L350 Elim1Store]: Elim1 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 1119 treesize of output 1063 [2022-11-16 04:03:44,188 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-16 04:03:44,188 INFO L350 Elim1Store]: Elim1 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 651 treesize of output 623 [2022-11-16 04:03:46,395 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:03:46,396 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 83 [2022-11-16 04:03:46,429 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:03:46,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2101 treesize of output 2017 [2022-11-16 04:03:46,483 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:03:46,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2013 treesize of output 1793 [2022-11-16 04:03:46,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 04:03:46,523 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 04:03:46,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 897 treesize of output 841 [2022-11-16 04:03:46,559 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:03:46,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1733 treesize of output 1625 [2022-11-16 04:03:50,813 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 04:03:50,813 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 1 [2022-11-16 04:03:50,825 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 04:03:50,826 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 1 [2022-11-16 04:03:50,835 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 04:03:50,836 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 1 [2022-11-16 04:03:50,845 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 04:03:50,845 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 1 [2022-11-16 04:03:50,853 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 04:03:50,854 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 1 [2022-11-16 04:03:50,863 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 04:03:50,863 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 211 treesize of output 1 [2022-11-16 04:03:51,420 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2022-11-16 04:03:51,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458635792] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 04:03:51,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 04:03:51,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 35, 28] total 84 [2022-11-16 04:03:51,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006441559] [2022-11-16 04:03:51,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 04:03:51,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-11-16 04:03:51,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 04:03:51,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-11-16 04:03:51,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=700, Invalid=5446, Unknown=36, NotChecked=790, Total=6972 [2022-11-16 04:03:51,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:03:51,424 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 04:03:51,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 4.392857142857143) internal successors, (369), 84 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 04:03:51,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:03:51,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 04:03:51,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 04:03:51,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 04:03:51,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-11-16 04:03:51,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-16 04:03:51,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-16 04:03:51,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-16 04:03:51,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-11-16 04:03:51,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-16 04:03:51,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-16 04:03:51,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2022-11-16 04:03:51,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-16 04:03:51,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2022-11-16 04:03:51,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-16 04:03:51,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:05:06,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:05:06,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 04:05:06,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 04:05:06,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 04:05:06,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-16 04:05:06,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-16 04:05:06,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 04:05:06,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 04:05:06,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-11-16 04:05:06,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-16 04:05:06,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-16 04:05:06,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-11-16 04:05:06,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 04:05:06,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-11-16 04:05:06,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 04:05:06,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-11-16 04:05:06,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-16 04:05:07,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-16 04:05:07,134 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 04:05:07,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 04:05:07,134 INFO L85 PathProgramCache]: Analyzing trace with hash -2017837283, now seen corresponding path program 3 times [2022-11-16 04:05:07,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 04:05:07,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348833336] [2022-11-16 04:05:07,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 04:05:07,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 04:05:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 04:05:07,436 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 04:05:07,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 04:05:07,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348833336] [2022-11-16 04:05:07,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348833336] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 04:05:07,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492302128] [2022-11-16 04:05:07,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 04:05:07,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 04:05:07,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 04:05:07,440 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 04:05:07,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-16 04:05:07,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 04:05:07,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 04:05:07,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 04:05:07,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 04:05:07,897 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 04:05:07,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 04:05:08,141 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 04:05:08,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492302128] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 04:05:08,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 04:05:08,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 12] total 36 [2022-11-16 04:05:08,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470785003] [2022-11-16 04:05:08,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 04:05:08,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-16 04:05:08,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 04:05:08,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-16 04:05:08,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1152, Unknown=0, NotChecked=0, Total=1260 [2022-11-16 04:05:08,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:05:08,144 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 04:05:08,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.638888888888889) internal successors, (275), 36 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) [2022-11-16 04:05:08,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:05:08,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 04:05:08,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 04:05:08,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 04:05:08,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-11-16 04:05:08,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-16 04:05:08,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-16 04:05:08,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-16 04:05:08,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-11-16 04:05:08,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-16 04:05:08,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-16 04:05:08,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2022-11-16 04:05:08,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-16 04:05:08,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2022-11-16 04:05:08,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-16 04:05:08,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 111 states. [2022-11-16 04:05:08,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:06:17,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:06:17,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 04:06:17,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 04:06:17,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 04:06:17,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-16 04:06:17,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-11-16 04:06:17,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 04:06:17,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 04:06:17,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-11-16 04:06:17,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-16 04:06:17,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-11-16 04:06:17,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2022-11-16 04:06:17,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 04:06:17,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2022-11-16 04:06:17,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 04:06:17,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2022-11-16 04:06:17,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2022-11-16 04:06:17,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-16 04:06:17,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-16 04:06:17,890 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 04:06:17,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 04:06:17,891 INFO L85 PathProgramCache]: Analyzing trace with hash -22792143, now seen corresponding path program 3 times [2022-11-16 04:06:17,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 04:06:17,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161440529] [2022-11-16 04:06:17,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 04:06:17,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 04:06:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 04:06:18,105 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 04:06:18,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 04:06:18,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161440529] [2022-11-16 04:06:18,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161440529] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 04:06:18,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041861350] [2022-11-16 04:06:18,106 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 04:06:18,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 04:06:18,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 04:06:18,110 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 04:06:18,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-16 04:06:18,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-16 04:06:18,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 04:06:18,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 04:06:18,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 04:06:18,421 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-16 04:06:18,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 04:06:18,528 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-16 04:06:18,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041861350] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 04:06:18,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 04:06:18,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 20 [2022-11-16 04:06:18,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203320549] [2022-11-16 04:06:18,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 04:06:18,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-16 04:06:18,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 04:06:18,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-16 04:06:18,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2022-11-16 04:06:18,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:06:18,530 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 04:06:18,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 12.7) internal successors, (254), 20 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 04:06:18,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:06:18,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 04:06:18,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 04:06:18,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 04:06:18,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-11-16 04:06:18,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-11-16 04:06:18,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-16 04:06:18,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-16 04:06:18,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2022-11-16 04:06:18,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-11-16 04:06:18,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2022-11-16 04:06:18,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 126 states. [2022-11-16 04:06:18,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-16 04:06:18,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2022-11-16 04:06:18,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-16 04:06:18,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 157 states. [2022-11-16 04:06:18,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 175 states. [2022-11-16 04:06:18,530 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:06:20,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:06:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 04:06:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 04:06:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 04:06:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-16 04:06:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-11-16 04:06:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 04:06:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 04:06:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-11-16 04:06:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-16 04:06:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-11-16 04:06:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2022-11-16 04:06:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 04:06:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2022-11-16 04:06:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 04:06:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2022-11-16 04:06:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2022-11-16 04:06:20,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-16 04:06:20,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-16 04:06:20,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 04:06:20,469 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 04:06:20,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 04:06:20,469 INFO L85 PathProgramCache]: Analyzing trace with hash 245328404, now seen corresponding path program 4 times [2022-11-16 04:06:20,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 04:06:20,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092228171] [2022-11-16 04:06:20,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 04:06:20,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 04:06:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 04:06:22,761 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 04:06:22,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 04:06:22,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092228171] [2022-11-16 04:06:22,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092228171] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 04:06:22,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192817451] [2022-11-16 04:06:22,762 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 04:06:22,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 04:06:22,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 04:06:22,763 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 04:06:22,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-16 04:06:22,895 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 04:06:22,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 04:06:22,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-16 04:06:22,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 04:06:24,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 04:06:24,797 INFO L350 Elim1Store]: Elim1 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 125 treesize of output 103 [2022-11-16 04:06:25,695 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 04:06:25,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 04:06:25,698 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:06:25,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 78 [2022-11-16 04:06:26,201 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 04:06:26,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 04:06:28,524 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse27 (select |c_#memory_int| c_~A~0.base))) (let ((.cse7 (select .cse27 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (let ((.cse18 (select .cse27 (+ (* c_thread2Thread1of1ForFork0_~i~1 4) c_~A~0.offset))) (.cse8 (+ c_thread2Thread1of1ForFork0_~i~1 1)) (.cse10 (< c_~max1~0 .cse7))) (let ((.cse9 (not .cse10)) (.cse3 (= .cse7 c_~max3~0)) (.cse13 (= c_~max1~0 c_~max3~0)) (.cse5 (forall ((v_ArrVal_623 (Array Int Int)) (~M~0 Int)) (or (not (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)) (< .cse8 ~M~0) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_623) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) (.cse16 (< c_~max2~0 .cse18))) (and (or (let ((.cse14 (+ c_~max2~0 1))) (let ((.cse0 (forall ((v_ArrVal_623 (Array Int Int)) (~M~0 Int)) (let ((.cse15 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_623) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)) (< .cse8 ~M~0) (not (< c_~max3~0 .cse15)) (<= .cse14 .cse15))))) (.cse2 (<= .cse14 c_~max3~0)) (.cse4 (<= c_~max3~0 c_~max2~0))) (and (or (let ((.cse1 (= .cse7 c_~max2~0))) (and (or .cse0 .cse1) (or (and .cse2 .cse3) (and .cse4 .cse1) .cse5) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_623 (Array Int Int))) (let ((.cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_623) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse6)) (= .cse7 .cse6) (<= .cse6 c_~max2~0)))) (not (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)) (< .cse8 ~M~0))))) .cse9) (or .cse10 (let ((.cse12 (= c_~max1~0 c_~max2~0))) (and (forall ((~M~0 Int)) (or (not (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)) (< .cse8 ~M~0) (forall ((v_ArrVal_623 (Array Int Int))) (let ((.cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_623) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse11)) (<= .cse11 c_~max2~0) (= c_~max1~0 .cse11)))))) (or .cse12 .cse0) (or (and .cse13 .cse2) (and .cse12 .cse4) .cse5))))))) .cse16) (or (let ((.cse25 (+ .cse18 1))) (let ((.cse22 (forall ((v_ArrVal_623 (Array Int Int)) (~M~0 Int)) (let ((.cse26 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_623) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (<= .cse25 .cse26) (not (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)) (< .cse8 ~M~0) (not (< c_~max3~0 .cse26)))))) (.cse19 (<= .cse25 c_~max3~0)) (.cse21 (<= c_~max3~0 .cse18))) (and (or .cse9 (let ((.cse20 (= .cse18 .cse7))) (and (forall ((~M~0 Int)) (or (not (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)) (< .cse8 ~M~0) (forall ((v_ArrVal_623 (Array Int Int))) (let ((.cse17 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_623) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse17)) (= .cse7 .cse17) (<= .cse17 .cse18)))))) (or (and .cse19 .cse3) .cse5 (and .cse20 .cse21)) (or .cse22 .cse20)))) (or .cse10 (let ((.cse23 (= .cse18 c_~max1~0))) (and (or .cse22 .cse23) (or (and .cse19 .cse13) .cse5 (and .cse23 .cse21)) (forall ((~M~0 Int)) (or (not (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)) (< .cse8 ~M~0) (forall ((v_ArrVal_623 (Array Int Int))) (let ((.cse24 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_623) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse24)) (<= .cse24 .cse18) (= c_~max1~0 .cse24)))))))))))) (not .cse16))))))) is different from false [2022-11-16 04:06:43,544 WARN L233 SmtUtils]: Spent 14.15s on a formula simplification that was a NOOP. DAG size: 104 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 04:06:59,874 WARN L233 SmtUtils]: Spent 15.69s on a formula simplification that was a NOOP. DAG size: 104 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 04:07:02,322 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:07:02,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 1283 treesize of output 2071 [2022-11-16 04:07:02,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 774 treesize of output 762 [2022-11-16 04:07:02,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 762 treesize of output 756 [2022-11-16 04:07:02,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 756 treesize of output 738 [2022-11-16 04:07:02,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 738 treesize of output 732 [2022-11-16 04:07:02,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 732 treesize of output 714 [2022-11-16 04:07:03,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 714 treesize of output 702 [2022-11-16 04:07:03,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 702 treesize of output 696 [2022-11-16 04:07:03,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 696 treesize of output 684 [2022-11-16 04:07:03,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 684 treesize of output 666 [2022-11-16 04:07:03,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 666 treesize of output 654 [2022-11-16 04:07:03,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 654 treesize of output 636 [2022-11-16 04:07:03,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 636 treesize of output 630 [2022-11-16 04:08:32,146 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. Received shutdown request... [2022-11-16 04:11:14,016 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-11-16 04:11:14,018 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-11-16 04:11:14,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-16 04:11:14,028 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-16 04:11:14,032 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-16 04:11:14,032 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-16 04:11:14,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 04:11:14,218 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 141 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 42ms.. [2022-11-16 04:11:14,220 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-11-16 04:11:14,220 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-11-16 04:11:14,220 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-11-16 04:11:14,223 INFO L444 BasicCegarLoop]: Path program histogram: [8, 4, 3, 1, 1, 1, 1] [2022-11-16 04:11:14,225 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 04:11:14,225 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 04:11:14,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 04:11:14 BasicIcfg [2022-11-16 04:11:14,226 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 04:11:14,226 INFO L158 Benchmark]: Toolchain (without parser) took 848289.25ms. Allocated memory was 202.4MB in the beginning and 815.8MB in the end (delta: 613.4MB). Free memory was 179.4MB in the beginning and 243.6MB in the end (delta: -64.2MB). Peak memory consumption was 599.7MB. Max. memory is 8.0GB. [2022-11-16 04:11:14,226 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 202.4MB. Free memory was 161.0MB in the beginning and 161.0MB in the end (delta: 75.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-11-16 04:11:14,227 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.72ms. Allocated memory is still 202.4MB. Free memory was 179.2MB in the beginning and 175.4MB in the end (delta: 3.8MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. [2022-11-16 04:11:14,227 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.94ms. Allocated memory is still 202.4MB. Free memory was 175.4MB in the beginning and 173.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-11-16 04:11:14,227 INFO L158 Benchmark]: Boogie Preprocessor took 37.53ms. Allocated memory is still 202.4MB. Free memory was 173.4MB in the beginning and 171.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-11-16 04:11:14,227 INFO L158 Benchmark]: RCFGBuilder took 468.21ms. Allocated memory is still 202.4MB. Free memory was 171.9MB in the beginning and 151.4MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-11-16 04:11:14,227 INFO L158 Benchmark]: TraceAbstraction took 847491.77ms. Allocated memory was 202.4MB in the beginning and 815.8MB in the end (delta: 613.4MB). Free memory was 150.8MB in the beginning and 243.6MB in the end (delta: -92.7MB). Peak memory consumption was 571.5MB. Max. memory is 8.0GB. [2022-11-16 04:11:14,228 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.14ms. Allocated memory is still 202.4MB. Free memory was 161.0MB in the beginning and 161.0MB in the end (delta: 75.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 252.72ms. Allocated memory is still 202.4MB. Free memory was 179.2MB in the beginning and 175.4MB in the end (delta: 3.8MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.94ms. Allocated memory is still 202.4MB. Free memory was 175.4MB in the beginning and 173.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.53ms. Allocated memory is still 202.4MB. Free memory was 173.4MB in the beginning and 171.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 468.21ms. Allocated memory is still 202.4MB. Free memory was 171.9MB in the beginning and 151.4MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 847491.77ms. Allocated memory was 202.4MB in the beginning and 815.8MB in the end (delta: 613.4MB). Free memory was 150.8MB in the beginning and 243.6MB in the end (delta: -92.7MB). Peak memory consumption was 571.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 119506, independent: 97832, independent conditional: 95496, independent unconditional: 2336, dependent: 21674, dependent conditional: 21655, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 97855, independent: 97832, independent conditional: 95496, independent unconditional: 2336, dependent: 23, dependent conditional: 4, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 97855, independent: 97832, independent conditional: 95496, independent unconditional: 2336, dependent: 23, dependent conditional: 4, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 98059, independent: 97832, independent conditional: 39, independent unconditional: 97793, dependent: 227, dependent conditional: 165, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 98059, independent: 97832, independent conditional: 39, independent unconditional: 97793, dependent: 227, dependent conditional: 109, dependent unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 98059, independent: 97832, independent conditional: 39, independent unconditional: 97793, dependent: 227, dependent conditional: 109, dependent unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2043, independent: 1986, independent conditional: 10, independent unconditional: 1976, dependent: 57, dependent conditional: 38, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2043, independent: 1974, independent conditional: 0, independent unconditional: 1974, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 69, independent: 12, independent conditional: 10, independent unconditional: 2, dependent: 57, dependent conditional: 38, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 69, independent: 12, independent conditional: 10, independent unconditional: 2, dependent: 57, dependent conditional: 38, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 251, independent: 72, independent conditional: 23, independent unconditional: 49, dependent: 179, dependent conditional: 87, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 98059, independent: 95846, independent conditional: 29, independent unconditional: 95817, dependent: 170, dependent conditional: 71, dependent unconditional: 99, unknown: 2043, unknown conditional: 48, unknown unconditional: 1995] , Statistics on independence cache: Total cache size (in pairs): 2043, Positive cache size: 1986, Positive conditional cache size: 10, Positive unconditional cache size: 1976, Negative cache size: 57, Negative conditional cache size: 38, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 56, Maximal queried relation: 17, Independence queries for same thread: 21651 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 1914, Number of trivial persistent sets: 1706, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2355, independent: 2336, independent conditional: 0, independent unconditional: 2336, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 119506, independent: 97832, independent conditional: 95496, independent unconditional: 2336, dependent: 21674, dependent conditional: 21655, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 97855, independent: 97832, independent conditional: 95496, independent unconditional: 2336, dependent: 23, dependent conditional: 4, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 97855, independent: 97832, independent conditional: 95496, independent unconditional: 2336, dependent: 23, dependent conditional: 4, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 98059, independent: 97832, independent conditional: 39, independent unconditional: 97793, dependent: 227, dependent conditional: 165, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 98059, independent: 97832, independent conditional: 39, independent unconditional: 97793, dependent: 227, dependent conditional: 109, dependent unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 98059, independent: 97832, independent conditional: 39, independent unconditional: 97793, dependent: 227, dependent conditional: 109, dependent unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2043, independent: 1986, independent conditional: 10, independent unconditional: 1976, dependent: 57, dependent conditional: 38, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2043, independent: 1974, independent conditional: 0, independent unconditional: 1974, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 69, independent: 12, independent conditional: 10, independent unconditional: 2, dependent: 57, dependent conditional: 38, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 69, independent: 12, independent conditional: 10, independent unconditional: 2, dependent: 57, dependent conditional: 38, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 251, independent: 72, independent conditional: 23, independent unconditional: 49, dependent: 179, dependent conditional: 87, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 98059, independent: 95846, independent conditional: 29, independent unconditional: 95817, dependent: 170, dependent conditional: 71, dependent unconditional: 99, unknown: 2043, unknown conditional: 48, unknown unconditional: 1995] , Statistics on independence cache: Total cache size (in pairs): 2043, Positive cache size: 1986, Positive conditional cache size: 10, Positive unconditional cache size: 1976, Negative cache size: 57, Negative conditional cache size: 38, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 56, Maximal queried relation: 17, Independence queries for same thread: 21651 - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 141 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 42ms.. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 141 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 42ms.. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 141 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 42ms.. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 141 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 42ms.. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 173 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 847.3s, OverallIterations: 19, TraceHistogramMax: 0, PathProgramHistogramMax: 8, EmptinessCheckTime: 200.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 1096, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 346.8s InterpolantComputationTime, 4404 NumberOfCodeBlocks, 4387 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 6448 ConstructedInterpolants, 106 QuantifiedInterpolants, 182518 SizeOfPredicates, 272 NumberOfNonLiveVariables, 4751 ConjunctsInSsa, 365 ConjunctsInUnsatCore, 50 InterpolantComputations, 4 PerfectInterpolantSequences, 287/603 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown