/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.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 03:13:32,925 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 03:13:32,926 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 03:13:32,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 03:13:32,963 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 03:13:32,963 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 03:13:32,966 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 03:13:32,970 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 03:13:32,972 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 03:13:32,976 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 03:13:32,977 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 03:13:32,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 03:13:32,980 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 03:13:32,982 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 03:13:32,983 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 03:13:32,984 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 03:13:32,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 03:13:32,985 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 03:13:32,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 03:13:32,992 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 03:13:32,995 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 03:13:32,996 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 03:13:32,998 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 03:13:32,999 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 03:13:33,005 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 03:13:33,005 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 03:13:33,006 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 03:13:33,007 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 03:13:33,008 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 03:13:33,008 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 03:13:33,009 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 03:13:33,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 03:13:33,011 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 03:13:33,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 03:13:33,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 03:13:33,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 03:13:33,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 03:13:33,013 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 03:13:33,013 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 03:13:33,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 03:13:33,014 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 03:13:33,015 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 03:13:33,045 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 03:13:33,045 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 03:13:33,046 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 03:13:33,046 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 03:13:33,046 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 03:13:33,047 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 03:13:33,047 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 03:13:33,047 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 03:13:33,047 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 03:13:33,047 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 03:13:33,048 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 03:13:33,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 03:13:33,048 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 03:13:33,048 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 03:13:33,049 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 03:13:33,049 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 03:13:33,049 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 03:13:33,049 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 03:13:33,049 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 03:13:33,049 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 03:13:33,049 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 03:13:33,049 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 03:13:33,049 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 03:13:33,050 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 03:13:33,050 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 03:13:33,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 03:13:33,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 03:13:33,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 03:13:33,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 03:13:33,050 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 03:13:33,050 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 03:13:33,050 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 03:13:33,051 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 03:13:33,051 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 03:13:33,051 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 03:13:33,051 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 03:13:33,051 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: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> true [2023-05-04 03:13:33,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 03:13:33,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 03:13:33,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 03:13:33,313 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 03:13:33,314 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 03:13:33,315 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2023-05-04 03:13:33,368 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b94bd1e03/71bde7dbc3a84508bf1e767629fe87e3/FLAGc42371092 [2023-05-04 03:13:33,810 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 03:13:33,810 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2023-05-04 03:13:33,821 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b94bd1e03/71bde7dbc3a84508bf1e767629fe87e3/FLAGc42371092 [2023-05-04 03:13:33,833 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b94bd1e03/71bde7dbc3a84508bf1e767629fe87e3 [2023-05-04 03:13:33,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 03:13:33,836 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 03:13:33,837 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 03:13:33,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 03:13:33,840 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 03:13:33,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 03:13:33" (1/1) ... [2023-05-04 03:13:33,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f157093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:13:33, skipping insertion in model container [2023-05-04 03:13:33,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 03:13:33" (1/1) ... [2023-05-04 03:13:33,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 03:13:33,863 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 03:13:34,080 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c[2412,2425] [2023-05-04 03:13:34,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 03:13:34,104 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 03:13:34,135 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c[2412,2425] [2023-05-04 03:13:34,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 03:13:34,148 INFO L208 MainTranslator]: Completed translation [2023-05-04 03:13:34,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:13:34 WrapperNode [2023-05-04 03:13:34,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 03:13:34,153 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 03:13:34,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 03:13:34,154 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 03:13:34,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:13:34" (1/1) ... [2023-05-04 03:13:34,172 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:13:34" (1/1) ... [2023-05-04 03:13:34,205 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 271 [2023-05-04 03:13:34,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 03:13:34,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 03:13:34,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 03:13:34,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 03:13:34,212 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:13:34" (1/1) ... [2023-05-04 03:13:34,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:13:34" (1/1) ... [2023-05-04 03:13:34,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:13:34" (1/1) ... [2023-05-04 03:13:34,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:13:34" (1/1) ... [2023-05-04 03:13:34,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:13:34" (1/1) ... [2023-05-04 03:13:34,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:13:34" (1/1) ... [2023-05-04 03:13:34,232 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:13:34" (1/1) ... [2023-05-04 03:13:34,245 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:13:34" (1/1) ... [2023-05-04 03:13:34,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 03:13:34,249 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 03:13:34,249 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 03:13:34,250 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 03:13:34,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:13:34" (1/1) ... [2023-05-04 03:13:34,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 03:13:34,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 03:13:34,271 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) [2023-05-04 03:13:34,287 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 [2023-05-04 03:13:34,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 03:13:34,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 03:13:34,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 03:13:34,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 03:13:34,315 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-05-04 03:13:34,315 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-05-04 03:13:34,316 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-05-04 03:13:34,316 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-05-04 03:13:34,316 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-05-04 03:13:34,316 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-05-04 03:13:34,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 03:13:34,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-05-04 03:13:34,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 03:13:34,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 03:13:34,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 03:13:34,318 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-04 03:13:34,422 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 03:13:34,423 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 03:13:34,824 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 03:13:34,836 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 03:13:34,837 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2023-05-04 03:13:34,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 03:13:34 BoogieIcfgContainer [2023-05-04 03:13:34,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 03:13:34,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 03:13:34,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 03:13:34,850 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 03:13:34,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 03:13:33" (1/3) ... [2023-05-04 03:13:34,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c537436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 03:13:34, skipping insertion in model container [2023-05-04 03:13:34,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 03:13:34" (2/3) ... [2023-05-04 03:13:34,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c537436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 03:13:34, skipping insertion in model container [2023-05-04 03:13:34,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 03:13:34" (3/3) ... [2023-05-04 03:13:34,852 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2023-05-04 03:13:34,857 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 03:13:34,864 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 03:13:34,864 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-05-04 03:13:34,864 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 03:13:35,001 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-05-04 03:13:35,057 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 03:13:35,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 03:13:35,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 03:13:35,059 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) [2023-05-04 03:13:35,076 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 [2023-05-04 03:13:35,109 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 03:13:35,160 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 03:13:35,167 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;@145bd8f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 03:13:35,167 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-05-04 03:13:35,451 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)] === [2023-05-04 03:13:35,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 03:13:35,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1805584930, now seen corresponding path program 1 times [2023-05-04 03:13:35,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 03:13:35,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380833988] [2023-05-04 03:13:35,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:13:35,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 03:13:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:13:35,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 03:13:35,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 03:13:35,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380833988] [2023-05-04 03:13:35,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380833988] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 03:13:35,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 03:13:35,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 03:13:35,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764367349] [2023-05-04 03:13:35,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 03:13:35,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 03:13:35,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 03:13:35,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 03:13:35,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 03:13:35,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:35,787 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 03:13:35,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 03:13:35,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:35,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:35,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 03:13:35,856 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)] === [2023-05-04 03:13:35,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 03:13:35,857 INFO L85 PathProgramCache]: Analyzing trace with hash -926291870, now seen corresponding path program 1 times [2023-05-04 03:13:35,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 03:13:35,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532828519] [2023-05-04 03:13:35,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:13:35,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 03:13:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:13:36,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 03:13:36,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 03:13:36,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532828519] [2023-05-04 03:13:36,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532828519] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 03:13:36,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 03:13:36,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-05-04 03:13:36,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509829774] [2023-05-04 03:13:36,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 03:13:36,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-05-04 03:13:36,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 03:13:36,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-05-04 03:13:36,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-05-04 03:13:36,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:36,906 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 03:13:36,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.583333333333334) internal successors, (175), 12 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 03:13:36,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:36,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:37,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:37,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:37,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-04 03:13:37,088 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)] === [2023-05-04 03:13:37,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 03:13:37,088 INFO L85 PathProgramCache]: Analyzing trace with hash -23318240, now seen corresponding path program 1 times [2023-05-04 03:13:37,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 03:13:37,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344703862] [2023-05-04 03:13:37,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:13:37,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 03:13:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:13:37,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 03:13:37,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 03:13:37,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344703862] [2023-05-04 03:13:37,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344703862] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 03:13:37,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 03:13:37,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-05-04 03:13:37,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429863624] [2023-05-04 03:13:37,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 03:13:37,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-04 03:13:37,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 03:13:37,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-04 03:13:37,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-05-04 03:13:37,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:37,411 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 03:13:37,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 7 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 03:13:37,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:37,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:37,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:37,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:37,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:37,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:37,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-05-04 03:13:37,572 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)] === [2023-05-04 03:13:37,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 03:13:37,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1370226749, now seen corresponding path program 1 times [2023-05-04 03:13:37,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 03:13:37,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074541751] [2023-05-04 03:13:37,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:13:37,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 03:13:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:13:37,781 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 03:13:37,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 03:13:37,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074541751] [2023-05-04 03:13:37,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074541751] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 03:13:37,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850311218] [2023-05-04 03:13:37,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:13:37,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:13:37,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 03:13:37,786 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) [2023-05-04 03:13:37,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-05-04 03:13:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:13:38,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-04 03:13:38,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 03:13:38,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 03:13:38,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 03:13:38,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 03:13:38,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850311218] provided 1 perfect and 1 imperfect interpolant sequences [2023-05-04 03:13:38,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-05-04 03:13:38,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-05-04 03:13:38,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35326052] [2023-05-04 03:13:38,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 03:13:38,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-04 03:13:38,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 03:13:38,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-04 03:13:38,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-05-04 03:13:38,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:38,446 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 03:13:38,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 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) [2023-05-04 03:13:38,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:38,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:38,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:38,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:40,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:40,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:40,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:40,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:40,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-05-04 03:13:40,909 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,SelfDestructingSolverStorable3 [2023-05-04 03:13:40,910 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)] === [2023-05-04 03:13:40,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 03:13:40,910 INFO L85 PathProgramCache]: Analyzing trace with hash 2024103871, now seen corresponding path program 1 times [2023-05-04 03:13:40,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 03:13:40,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974915916] [2023-05-04 03:13:40,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:13:40,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 03:13:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:13:41,258 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-05-04 03:13:41,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 03:13:41,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974915916] [2023-05-04 03:13:41,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974915916] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 03:13:41,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053602107] [2023-05-04 03:13:41,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:13:41,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:13:41,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 03:13:41,261 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) [2023-05-04 03:13:41,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-04 03:13:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:13:41,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-04 03:13:41,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 03:13:41,655 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-05-04 03:13:41,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 03:13:41,887 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-05-04 03:13:41,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053602107] provided 1 perfect and 1 imperfect interpolant sequences [2023-05-04 03:13:41,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-05-04 03:13:41,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-05-04 03:13:41,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344455094] [2023-05-04 03:13:41,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 03:13:41,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-04 03:13:41,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 03:13:41,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-04 03:13:41,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-05-04 03:13:41,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:41,889 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 03:13:41,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 44.857142857142854) internal successors, (314), 7 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 03:13:41,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:41,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:41,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:41,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:41,889 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:42,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:42,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:42,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:42,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:42,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:42,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-05-04 03:13:43,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:13:43,147 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)] === [2023-05-04 03:13:43,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 03:13:43,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1937210791, now seen corresponding path program 1 times [2023-05-04 03:13:43,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 03:13:43,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182397618] [2023-05-04 03:13:43,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:13:43,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 03:13:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:13:43,536 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 03:13:43,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 03:13:43,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182397618] [2023-05-04 03:13:43,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182397618] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 03:13:43,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451574994] [2023-05-04 03:13:43,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:13:43,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:13:43,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 03:13:43,538 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) [2023-05-04 03:13:43,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-04 03:13:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:13:43,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 10 conjunts are in the unsatisfiable core [2023-05-04 03:13:43,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 03:13:44,064 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 03:13:44,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 03:13:44,402 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 03:13:44,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451574994] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 03:13:44,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 03:13:44,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2023-05-04 03:13:44,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370235931] [2023-05-04 03:13:44,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 03:13:44,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-05-04 03:13:44,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 03:13:44,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-05-04 03:13:44,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2023-05-04 03:13:44,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:44,406 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 03:13:44,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 20.375) internal successors, (489), 24 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 03:13:44,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:44,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:44,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:44,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:44,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:44,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:45,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:45,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:45,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:45,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:45,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:45,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 03:13:46,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-05-04 03:13:46,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:13:46,195 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)] === [2023-05-04 03:13:46,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 03:13:46,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1825293930, now seen corresponding path program 2 times [2023-05-04 03:13:46,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 03:13:46,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174648206] [2023-05-04 03:13:46,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:13:46,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 03:13:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:13:46,654 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 03:13:46,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 03:13:46,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174648206] [2023-05-04 03:13:46,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174648206] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 03:13:46,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760707237] [2023-05-04 03:13:46,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 03:13:46,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:13:46,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 03:13:46,669 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) [2023-05-04 03:13:46,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-05-04 03:13:46,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 03:13:46,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 03:13:46,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 10 conjunts are in the unsatisfiable core [2023-05-04 03:13:46,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 03:13:47,368 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 32 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 03:13:47,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 03:13:47,680 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 9 proven. 32 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 03:13:47,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760707237] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 03:13:47,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 03:13:47,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2023-05-04 03:13:47,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520281606] [2023-05-04 03:13:47,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 03:13:47,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-05-04 03:13:47,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 03:13:47,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-05-04 03:13:47,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2023-05-04 03:13:47,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:47,683 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 03:13:47,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 20.583333333333332) internal successors, (494), 24 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 03:13:47,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:47,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:47,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:47,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:47,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:47,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 03:13:47,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:49,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:49,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:49,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:49,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:49,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:49,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 03:13:49,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-05-04 03:13:49,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-05-04 03:13:49,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:13:49,257 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)] === [2023-05-04 03:13:49,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 03:13:49,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1780697944, now seen corresponding path program 3 times [2023-05-04 03:13:49,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 03:13:49,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726592214] [2023-05-04 03:13:49,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:13:49,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 03:13:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:13:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-05-04 03:13:49,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 03:13:49,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726592214] [2023-05-04 03:13:49,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726592214] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 03:13:49,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911523374] [2023-05-04 03:13:49,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 03:13:49,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:13:49,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 03:13:49,720 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) [2023-05-04 03:13:49,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-05-04 03:13:49,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-05-04 03:13:49,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 03:13:49,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 10 conjunts are in the unsatisfiable core [2023-05-04 03:13:49,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 03:13:50,552 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 32 proven. 9 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-05-04 03:13:50,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 03:13:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 9 proven. 32 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-05-04 03:13:51,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911523374] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 03:13:51,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 03:13:51,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2023-05-04 03:13:51,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315167322] [2023-05-04 03:13:51,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 03:13:51,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-05-04 03:13:51,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 03:13:51,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-05-04 03:13:51,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2023-05-04 03:13:51,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:51,042 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 03:13:51,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 24.25) internal successors, (582), 24 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 03:13:51,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:51,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:51,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:51,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:51,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:51,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 03:13:51,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-05-04 03:13:51,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:53,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 03:13:53,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:53,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:53,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:53,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 03:13:53,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 03:13:53,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-05-04 03:13:53,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-05-04 03:13:53,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-05-04 03:13:53,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:13:53,485 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)] === [2023-05-04 03:13:53,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 03:13:53,486 INFO L85 PathProgramCache]: Analyzing trace with hash 902419606, now seen corresponding path program 4 times [2023-05-04 03:13:53,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 03:13:53,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265400512] [2023-05-04 03:13:53,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 03:13:53,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 03:13:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 03:14:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-04 03:14:08,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 03:14:08,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265400512] [2023-05-04 03:14:08,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265400512] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 03:14:08,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43697267] [2023-05-04 03:14:08,923 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-05-04 03:14:08,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:14:08,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 03:14:08,928 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) [2023-05-04 03:14:08,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-05-04 03:14:09,194 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-05-04 03:14:09,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 03:14:09,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 255 conjunts are in the unsatisfiable core [2023-05-04 03:14:09,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 03:14:09,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-04 03:14:10,975 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-05-04 03:14:10,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-05-04 03:14:12,585 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-05-04 03:14:12,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 03:14:17,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 03:14:17,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-05-04 03:14:20,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 03:14:20,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 03:14:20,368 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-05-04 03:14:20,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2023-05-04 03:14:27,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 03:14:27,522 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 03:14:27,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 03:14:27,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 03:14:27,523 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 03:14:27,525 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 03:14:27,531 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-05-04 03:14:27,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 64 treesize of output 64 [2023-05-04 03:14:32,797 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 03:14:32,812 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-05-04 03:14:32,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 106 treesize of output 84 [2023-05-04 03:14:33,190 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 03:14:33,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 47 [2023-05-04 03:14:33,522 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 131 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 03:14:33,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 03:14:41,513 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_~A~0.offset 4)) (.cse7 (+ 4 c_~B~0.offset)) (.cse1 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (.cse3 (+ (* |c_thread2Thread1of1ForFork0_~i~1#1| 4) c_~B~0.offset))) (and (forall ((v_ArrVal_412 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse2 (select .cse9 c_~B~0.base)) (.cse0 (select .cse9 c_~A~0.base))) (<= (+ c_~asum~0 c_~bsum~0 (select .cse0 .cse1) (select .cse2 .cse3)) (let ((.cse4 (select .cse0 c_~A~0.offset)) (.cse8 (select .cse2 c_~B~0.offset))) (let ((.cse5 (store .cse9 c_~C~0.base (store (select .cse9 c_~C~0.base) c_~C~0.offset (+ .cse4 .cse8))))) (+ .cse4 (select (select .cse5 c_~A~0.base) .cse6) c_~csum~0 (select (select .cse5 c_~B~0.base) .cse7) .cse8))))))) (forall ((v_ArrVal_412 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse15 (select .cse13 c_~A~0.base)) (.cse14 (select .cse13 c_~B~0.base))) (<= (let ((.cse10 (select .cse15 c_~A~0.offset)) (.cse12 (select .cse14 c_~B~0.offset))) (let ((.cse11 (store .cse13 c_~C~0.base (store (select .cse13 c_~C~0.base) c_~C~0.offset (+ .cse10 .cse12))))) (+ .cse10 (select (select .cse11 c_~A~0.base) .cse6) c_~csum~0 (select (select .cse11 c_~B~0.base) .cse7) .cse12))) (+ c_~asum~0 c_~bsum~0 (select .cse15 .cse1) (select .cse14 .cse3)))))))) is different from false [2023-05-04 03:14:41,630 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (.cse9 (+ (* |c_thread2Thread1of1ForFork0_#t~post4#1| 4) 4 c_~B~0.offset)) (.cse2 (+ c_~A~0.offset 4)) (.cse3 (+ 4 c_~B~0.offset))) (and (forall ((v_ArrVal_412 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse7 (select .cse5 c_~A~0.base)) (.cse6 (select .cse5 c_~B~0.base))) (<= (let ((.cse0 (select .cse7 c_~A~0.offset)) (.cse4 (select .cse6 c_~B~0.offset))) (let ((.cse1 (store .cse5 c_~C~0.base (store (select .cse5 c_~C~0.base) c_~C~0.offset (+ .cse0 .cse4))))) (+ .cse0 (select (select .cse1 c_~A~0.base) .cse2) c_~csum~0 (select (select .cse1 c_~B~0.base) .cse3) .cse4))) (+ c_~asum~0 c_~bsum~0 (select .cse7 .cse8) (select .cse6 .cse9)))))) (forall ((v_ArrVal_412 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse11 (select .cse15 c_~B~0.base)) (.cse10 (select .cse15 c_~A~0.base))) (<= (+ c_~asum~0 c_~bsum~0 (select .cse10 .cse8) (select .cse11 .cse9)) (let ((.cse12 (select .cse10 c_~A~0.offset)) (.cse14 (select .cse11 c_~B~0.offset))) (let ((.cse13 (store .cse15 c_~C~0.base (store (select .cse15 c_~C~0.base) c_~C~0.offset (+ .cse12 .cse14))))) (+ .cse12 (select (select .cse13 c_~A~0.base) .cse2) c_~csum~0 (select (select .cse13 c_~B~0.base) .cse3) .cse14))))))))) is different from false [2023-05-04 03:14:41,659 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (+ (* |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4 c_~B~0.offset)) (.cse9 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (.cse2 (+ c_~A~0.offset 4)) (.cse3 (+ 4 c_~B~0.offset))) (and (forall ((v_ArrVal_412 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse6 (select .cse5 c_~B~0.base)) (.cse7 (select .cse5 c_~A~0.base))) (<= (let ((.cse0 (select .cse7 c_~A~0.offset)) (.cse4 (select .cse6 c_~B~0.offset))) (let ((.cse1 (store .cse5 c_~C~0.base (store (select .cse5 c_~C~0.base) c_~C~0.offset (+ .cse0 .cse4))))) (+ .cse0 (select (select .cse1 c_~A~0.base) .cse2) c_~csum~0 (select (select .cse1 c_~B~0.base) .cse3) .cse4))) (+ c_~asum~0 (select .cse6 .cse8) c_~bsum~0 (select .cse7 .cse9)))))) (forall ((v_ArrVal_412 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse10 (select .cse15 c_~B~0.base)) (.cse11 (select .cse15 c_~A~0.base))) (<= (+ c_~asum~0 (select .cse10 .cse8) c_~bsum~0 (select .cse11 .cse9)) (let ((.cse12 (select .cse11 c_~A~0.offset)) (.cse14 (select .cse10 c_~B~0.offset))) (let ((.cse13 (store .cse15 c_~C~0.base (store (select .cse15 c_~C~0.base) c_~C~0.offset (+ .cse12 .cse14))))) (+ .cse12 (select (select .cse13 c_~A~0.base) .cse2) c_~csum~0 (select (select .cse13 c_~B~0.base) .cse3) .cse14))))))))) is different from false [2023-05-04 03:14:41,693 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (+ (* |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4 c_~B~0.offset)) (.cse9 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (.cse2 (+ c_~A~0.offset 4)) (.cse3 (+ 4 c_~B~0.offset))) (and (forall ((v_ArrVal_412 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse6 (select .cse5 c_~B~0.base)) (.cse7 (select .cse5 c_~A~0.base))) (<= (let ((.cse0 (select .cse7 c_~A~0.offset)) (.cse4 (select .cse6 c_~B~0.offset))) (let ((.cse1 (store .cse5 c_~C~0.base (store (select .cse5 c_~C~0.base) c_~C~0.offset (+ .cse0 .cse4))))) (+ .cse0 (select (select .cse1 c_~A~0.base) .cse2) c_~csum~0 (select (select .cse1 c_~B~0.base) .cse3) .cse4))) (+ c_~asum~0 (select .cse6 .cse8) (select .cse7 .cse9) |c_thread2Thread1of1ForFork0_#t~ret6#1|))))) (forall ((v_ArrVal_412 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse10 (select .cse15 c_~B~0.base)) (.cse11 (select .cse15 c_~A~0.base))) (<= (+ c_~asum~0 (select .cse10 .cse8) (select .cse11 .cse9) |c_thread2Thread1of1ForFork0_#t~ret6#1|) (let ((.cse12 (select .cse11 c_~A~0.offset)) (.cse14 (select .cse10 c_~B~0.offset))) (let ((.cse13 (store .cse15 c_~C~0.base (store (select .cse15 c_~C~0.base) c_~C~0.offset (+ .cse12 .cse14))))) (+ .cse12 (select (select .cse13 c_~A~0.base) .cse2) c_~csum~0 (select (select .cse13 c_~B~0.base) .cse3) .cse14))))))))) is different from false [2023-05-04 03:14:42,118 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_~A~0.offset 4)) (.cse7 (+ 4 c_~B~0.offset)) (.cse1 (+ (* |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4 c_~B~0.offset)) (.cse3 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4)))) (and (forall ((v_ArrVal_412 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse0 (select .cse9 c_~B~0.base)) (.cse2 (select .cse9 c_~A~0.base))) (<= (+ c_~asum~0 (select .cse0 .cse1) |c_thread2Thread1of1ForFork0_plus_#res#1| (select .cse2 .cse3)) (let ((.cse4 (select .cse2 c_~A~0.offset)) (.cse8 (select .cse0 c_~B~0.offset))) (let ((.cse5 (store .cse9 c_~C~0.base (store (select .cse9 c_~C~0.base) c_~C~0.offset (+ .cse4 .cse8))))) (+ .cse4 (select (select .cse5 c_~A~0.base) .cse6) c_~csum~0 (select (select .cse5 c_~B~0.base) .cse7) .cse8))))))) (forall ((v_ArrVal_412 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse14 (select .cse13 c_~B~0.base)) (.cse15 (select .cse13 c_~A~0.base))) (<= (let ((.cse10 (select .cse15 c_~A~0.offset)) (.cse12 (select .cse14 c_~B~0.offset))) (let ((.cse11 (store .cse13 c_~C~0.base (store (select .cse13 c_~C~0.base) c_~C~0.offset (+ .cse10 .cse12))))) (+ .cse10 (select (select .cse11 c_~A~0.base) .cse6) c_~csum~0 (select (select .cse11 c_~B~0.base) .cse7) .cse12))) (+ c_~asum~0 (select .cse14 .cse1) |c_thread2Thread1of1ForFork0_plus_#res#1| (select .cse15 .cse3)))))))) is different from false [2023-05-04 03:14:42,158 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_~A~0.offset 4)) (.cse7 (+ 4 c_~B~0.offset)) (.cse1 (+ (* |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4 c_~B~0.offset)) (.cse3 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4)))) (and (forall ((v_ArrVal_412 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse0 (select .cse9 c_~B~0.base)) (.cse2 (select .cse9 c_~A~0.base))) (<= (+ |c_thread2Thread1of1ForFork0_plus_~a#1| c_~asum~0 (select .cse0 .cse1) (select .cse2 .cse3) |c_thread2Thread1of1ForFork0_plus_~b#1|) (let ((.cse4 (select .cse2 c_~A~0.offset)) (.cse8 (select .cse0 c_~B~0.offset))) (let ((.cse5 (store .cse9 c_~C~0.base (store (select .cse9 c_~C~0.base) c_~C~0.offset (+ .cse4 .cse8))))) (+ .cse4 (select (select .cse5 c_~A~0.base) .cse6) c_~csum~0 (select (select .cse5 c_~B~0.base) .cse7) .cse8))))))) (forall ((v_ArrVal_412 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse14 (select .cse13 c_~B~0.base)) (.cse15 (select .cse13 c_~A~0.base))) (<= (let ((.cse10 (select .cse15 c_~A~0.offset)) (.cse12 (select .cse14 c_~B~0.offset))) (let ((.cse11 (store .cse13 c_~C~0.base (store (select .cse13 c_~C~0.base) c_~C~0.offset (+ .cse10 .cse12))))) (+ .cse10 (select (select .cse11 c_~A~0.base) .cse6) c_~csum~0 (select (select .cse11 c_~B~0.base) .cse7) .cse12))) (+ |c_thread2Thread1of1ForFork0_plus_~a#1| c_~asum~0 (select .cse14 .cse1) (select .cse15 .cse3) |c_thread2Thread1of1ForFork0_plus_~b#1|))))))) is different from false [2023-05-04 03:14:42,313 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (+ (* |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4 c_~B~0.offset)) (.cse9 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (.cse2 (+ c_~A~0.offset 4)) (.cse3 (+ 4 c_~B~0.offset))) (and (forall ((v_ArrVal_412 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse6 (select .cse5 c_~B~0.base)) (.cse7 (select .cse5 c_~A~0.base))) (<= (let ((.cse0 (select .cse7 c_~A~0.offset)) (.cse4 (select .cse6 c_~B~0.offset))) (let ((.cse1 (store .cse5 c_~C~0.base (store (select .cse5 c_~C~0.base) c_~C~0.offset (+ .cse0 .cse4))))) (+ .cse0 (select (select .cse1 c_~A~0.base) .cse2) c_~csum~0 (select (select .cse1 c_~B~0.base) .cse3) .cse4))) (+ |c_thread2Thread1of1ForFork0_plus_#in~b#1| |c_thread2Thread1of1ForFork0_plus_~a#1| c_~asum~0 (select .cse6 .cse8) (select .cse7 .cse9)))))) (forall ((v_ArrVal_412 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse10 (select .cse15 c_~B~0.base)) (.cse11 (select .cse15 c_~A~0.base))) (<= (+ |c_thread2Thread1of1ForFork0_plus_#in~b#1| |c_thread2Thread1of1ForFork0_plus_~a#1| c_~asum~0 (select .cse10 .cse8) (select .cse11 .cse9)) (let ((.cse12 (select .cse11 c_~A~0.offset)) (.cse14 (select .cse10 c_~B~0.offset))) (let ((.cse13 (store .cse15 c_~C~0.base (store (select .cse15 c_~C~0.base) c_~C~0.offset (+ .cse12 .cse14))))) (+ .cse12 (select (select .cse13 c_~A~0.base) .cse2) c_~csum~0 (select (select .cse13 c_~B~0.base) .cse3) .cse14))))))))) is different from false [2023-05-04 03:14:42,332 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_~A~0.offset 4)) (.cse7 (+ 4 c_~B~0.offset)) (.cse1 (+ (* |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4 c_~B~0.offset)) (.cse3 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4)))) (and (forall ((v_ArrVal_412 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse0 (select .cse9 c_~B~0.base)) (.cse2 (select .cse9 c_~A~0.base))) (<= (+ |c_thread2Thread1of1ForFork0_plus_#in~b#1| c_~asum~0 (select .cse0 .cse1) (select .cse2 .cse3) |c_thread2Thread1of1ForFork0_plus_#in~a#1|) (let ((.cse4 (select .cse2 c_~A~0.offset)) (.cse8 (select .cse0 c_~B~0.offset))) (let ((.cse5 (store .cse9 c_~C~0.base (store (select .cse9 c_~C~0.base) c_~C~0.offset (+ .cse4 .cse8))))) (+ .cse4 (select (select .cse5 c_~A~0.base) .cse6) c_~csum~0 (select (select .cse5 c_~B~0.base) .cse7) .cse8))))))) (forall ((v_ArrVal_412 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse14 (select .cse13 c_~B~0.base)) (.cse15 (select .cse13 c_~A~0.base))) (<= (let ((.cse10 (select .cse15 c_~A~0.offset)) (.cse12 (select .cse14 c_~B~0.offset))) (let ((.cse11 (store .cse13 c_~C~0.base (store (select .cse13 c_~C~0.base) c_~C~0.offset (+ .cse10 .cse12))))) (+ .cse10 (select (select .cse11 c_~A~0.base) .cse6) c_~csum~0 (select (select .cse11 c_~B~0.base) .cse7) .cse12))) (+ |c_thread2Thread1of1ForFork0_plus_#in~b#1| c_~asum~0 (select .cse14 .cse1) (select .cse15 .cse3) |c_thread2Thread1of1ForFork0_plus_#in~a#1|))))))) is different from false [2023-05-04 03:14:42,371 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (+ (* |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4 c_~B~0.offset)) (.cse9 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (.cse2 (+ c_~A~0.offset 4)) (.cse3 (+ 4 c_~B~0.offset))) (and (forall ((v_ArrVal_412 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse6 (select .cse5 c_~B~0.base)) (.cse7 (select .cse5 c_~A~0.base))) (<= (let ((.cse0 (select .cse7 c_~A~0.offset)) (.cse4 (select .cse6 c_~B~0.offset))) (let ((.cse1 (store .cse5 c_~C~0.base (store (select .cse5 c_~C~0.base) c_~C~0.offset (+ .cse0 .cse4))))) (+ .cse0 (select (select .cse1 c_~A~0.base) .cse2) c_~csum~0 (select (select .cse1 c_~B~0.base) .cse3) .cse4))) (+ |c_thread2Thread1of1ForFork0_#t~mem5#1| c_~asum~0 (select .cse6 .cse8) c_~bsum~0 (select .cse7 .cse9)))))) (forall ((v_ArrVal_412 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse10 (select .cse15 c_~B~0.base)) (.cse11 (select .cse15 c_~A~0.base))) (<= (+ |c_thread2Thread1of1ForFork0_#t~mem5#1| c_~asum~0 (select .cse10 .cse8) c_~bsum~0 (select .cse11 .cse9)) (let ((.cse12 (select .cse11 c_~A~0.offset)) (.cse14 (select .cse10 c_~B~0.offset))) (let ((.cse13 (store .cse15 c_~C~0.base (store (select .cse15 c_~C~0.base) c_~C~0.offset (+ .cse12 .cse14))))) (+ .cse12 (select (select .cse13 c_~A~0.base) .cse2) c_~csum~0 (select (select .cse13 c_~B~0.base) .cse3) .cse14))))))))) is different from false [2023-05-04 03:14:42,399 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse17 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse7 (+ c_~A~0.offset 4)) (.cse8 (+ 4 c_~B~0.offset)) (.cse1 (+ .cse17 4 c_~B~0.offset)) (.cse3 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (.cse4 (select (select |c_#memory_int| c_~B~0.base) (+ .cse17 c_~B~0.offset)))) (and (forall ((v_ArrVal_412 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse0 (select .cse10 c_~B~0.base)) (.cse2 (select .cse10 c_~A~0.base))) (<= (+ c_~asum~0 (select .cse0 .cse1) c_~bsum~0 (select .cse2 .cse3) .cse4) (let ((.cse5 (select .cse2 c_~A~0.offset)) (.cse9 (select .cse0 c_~B~0.offset))) (let ((.cse6 (store .cse10 c_~C~0.base (store (select .cse10 c_~C~0.base) c_~C~0.offset (+ .cse5 .cse9))))) (+ .cse5 (select (select .cse6 c_~A~0.base) .cse7) c_~csum~0 (select (select .cse6 c_~B~0.base) .cse8) .cse9))))))) (forall ((v_ArrVal_412 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse15 (select .cse14 c_~B~0.base)) (.cse16 (select .cse14 c_~A~0.base))) (<= (let ((.cse11 (select .cse16 c_~A~0.offset)) (.cse13 (select .cse15 c_~B~0.offset))) (let ((.cse12 (store .cse14 c_~C~0.base (store (select .cse14 c_~C~0.base) c_~C~0.offset (+ .cse11 .cse13))))) (+ .cse11 (select (select .cse12 c_~A~0.base) .cse7) c_~csum~0 (select (select .cse12 c_~B~0.base) .cse8) .cse13))) (+ c_~asum~0 (select .cse15 .cse1) c_~bsum~0 (select .cse16 .cse3) .cse4)))))))) is different from false [2023-05-04 03:14:42,440 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (.cse9 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse2 (+ c_~A~0.offset 4)) (.cse3 (+ 4 c_~B~0.offset))) (and (forall ((v_ArrVal_412 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse7 (select .cse5 c_~A~0.base)) (.cse6 (select .cse5 c_~B~0.base))) (<= (let ((.cse0 (select .cse7 c_~A~0.offset)) (.cse4 (select .cse6 c_~B~0.offset))) (let ((.cse1 (store .cse5 c_~C~0.base (store (select .cse5 c_~C~0.base) c_~C~0.offset (+ .cse0 .cse4))))) (+ .cse0 (select (select .cse1 c_~A~0.base) .cse2) c_~csum~0 (select (select .cse1 c_~B~0.base) .cse3) .cse4))) (+ c_~asum~0 c_~bsum~0 (select .cse7 .cse8) .cse9 (select .cse6 .cse3)))))) (forall ((v_ArrVal_412 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse11 (select .cse15 c_~B~0.base)) (.cse10 (select .cse15 c_~A~0.base))) (<= (+ c_~asum~0 c_~bsum~0 (select .cse10 .cse8) .cse9 (select .cse11 .cse3)) (let ((.cse12 (select .cse10 c_~A~0.offset)) (.cse14 (select .cse11 c_~B~0.offset))) (let ((.cse13 (store .cse15 c_~C~0.base (store (select .cse15 c_~C~0.base) c_~C~0.offset (+ .cse12 .cse14))))) (+ .cse12 (select (select .cse13 c_~A~0.base) .cse2) c_~csum~0 (select (select .cse13 c_~B~0.base) .cse3) .cse14))))))))) is different from false [2023-05-04 03:14:42,470 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_~A~0.offset 4)) (.cse2 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (.cse4 (+ 4 c_~B~0.offset))) (and (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411))) (let ((.cse9 (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse3 (select .cse9 c_~B~0.base)) (.cse1 (select .cse9 c_~A~0.base))) (<= (+ c_~asum~0 c_~bsum~0 (select (select .cse0 c_~B~0.base) c_~B~0.offset) (select .cse1 .cse2) (select .cse3 .cse4)) (let ((.cse5 (select .cse1 c_~A~0.offset)) (.cse8 (select .cse3 c_~B~0.offset))) (let ((.cse6 (store .cse9 c_~C~0.base (store (select .cse9 c_~C~0.base) c_~C~0.offset (+ .cse5 .cse8))))) (+ .cse5 (select (select .cse6 c_~A~0.base) .cse7) (select (select .cse6 c_~B~0.base) .cse4) .cse8 c_~csum~0)))))))) (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411))) (let ((.cse13 (store .cse16 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse15 (select .cse13 c_~A~0.base)) (.cse14 (select .cse13 c_~B~0.base))) (<= (let ((.cse10 (select .cse15 c_~A~0.offset)) (.cse12 (select .cse14 c_~B~0.offset))) (let ((.cse11 (store .cse13 c_~C~0.base (store (select .cse13 c_~C~0.base) c_~C~0.offset (+ .cse10 .cse12))))) (+ .cse10 (select (select .cse11 c_~A~0.base) .cse7) (select (select .cse11 c_~B~0.base) .cse4) .cse12 c_~csum~0))) (+ c_~asum~0 c_~bsum~0 (select (select .cse16 c_~B~0.base) c_~B~0.offset) (select .cse15 .cse2) (select .cse14 .cse4))))))))) is different from false [2023-05-04 03:14:42,543 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_~A~0.offset (* 4 |c_thread1Thread1of1ForFork2_#t~post1#1|) 4)) (.cse2 (+ c_~A~0.offset 4)) (.cse3 (+ 4 c_~B~0.offset))) (and (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411))) (let ((.cse5 (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse7 (select .cse5 c_~A~0.base)) (.cse6 (select .cse5 c_~B~0.base))) (<= (let ((.cse0 (select .cse7 c_~A~0.offset)) (.cse4 (select .cse6 c_~B~0.offset))) (let ((.cse1 (store .cse5 c_~C~0.base (store (select .cse5 c_~C~0.base) c_~C~0.offset (+ .cse0 .cse4))))) (+ .cse0 (select (select .cse1 c_~A~0.base) .cse2) (select (select .cse1 c_~B~0.base) .cse3) .cse4 c_~csum~0))) (+ c_~asum~0 c_~bsum~0 (select .cse7 .cse8) (select (select .cse9 c_~B~0.base) c_~B~0.offset) (select .cse6 .cse3))))))) (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411))) (let ((.cse16 (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse12 (select .cse16 c_~B~0.base)) (.cse10 (select .cse16 c_~A~0.base))) (<= (+ c_~asum~0 c_~bsum~0 (select .cse10 .cse8) (select (select .cse11 c_~B~0.base) c_~B~0.offset) (select .cse12 .cse3)) (let ((.cse13 (select .cse10 c_~A~0.offset)) (.cse15 (select .cse12 c_~B~0.offset))) (let ((.cse14 (store .cse16 c_~C~0.base (store (select .cse16 c_~C~0.base) c_~C~0.offset (+ .cse13 .cse15))))) (+ .cse13 (select (select .cse14 c_~A~0.base) .cse2) (select (select .cse14 c_~B~0.base) .cse3) .cse15 c_~csum~0)))))))))) is different from false [2023-05-04 03:14:42,561 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_~A~0.offset 4 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (.cse2 (+ c_~A~0.offset 4)) (.cse3 (+ 4 c_~B~0.offset))) (and (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411))) (let ((.cse5 (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse6 (select .cse5 c_~B~0.base)) (.cse7 (select .cse5 c_~A~0.base))) (<= (let ((.cse0 (select .cse7 c_~A~0.offset)) (.cse4 (select .cse6 c_~B~0.offset))) (let ((.cse1 (store .cse5 c_~C~0.base (store (select .cse5 c_~C~0.base) c_~C~0.offset (+ .cse0 .cse4))))) (+ .cse0 (select (select .cse1 c_~A~0.base) .cse2) (select (select .cse1 c_~B~0.base) .cse3) .cse4 c_~csum~0))) (+ c_~asum~0 c_~bsum~0 (select (select .cse8 c_~B~0.base) c_~B~0.offset) (select .cse6 .cse3) (select .cse7 .cse9))))))) (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411))) (let ((.cse16 (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse11 (select .cse16 c_~B~0.base)) (.cse12 (select .cse16 c_~A~0.base))) (<= (+ c_~asum~0 c_~bsum~0 (select (select .cse10 c_~B~0.base) c_~B~0.offset) (select .cse11 .cse3) (select .cse12 .cse9)) (let ((.cse13 (select .cse12 c_~A~0.offset)) (.cse15 (select .cse11 c_~B~0.offset))) (let ((.cse14 (store .cse16 c_~C~0.base (store (select .cse16 c_~C~0.base) c_~C~0.offset (+ .cse13 .cse15))))) (+ .cse13 (select (select .cse14 c_~A~0.base) .cse2) (select (select .cse14 c_~B~0.base) .cse3) .cse15 c_~csum~0)))))))))) is different from false [2023-05-04 03:14:42,601 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_~A~0.offset 4 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (.cse2 (+ c_~A~0.offset 4)) (.cse3 (+ 4 c_~B~0.offset))) (and (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411))) (let ((.cse5 (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse6 (select .cse5 c_~B~0.base)) (.cse7 (select .cse5 c_~A~0.base))) (<= (let ((.cse0 (select .cse7 c_~A~0.offset)) (.cse4 (select .cse6 c_~B~0.offset))) (let ((.cse1 (store .cse5 c_~C~0.base (store (select .cse5 c_~C~0.base) c_~C~0.offset (+ .cse0 .cse4))))) (+ .cse0 (select (select .cse1 c_~A~0.base) .cse2) (select (select .cse1 c_~B~0.base) .cse3) .cse4 c_~csum~0))) (+ |c_thread1Thread1of1ForFork2_#t~ret3#1| c_~bsum~0 (select (select .cse8 c_~B~0.base) c_~B~0.offset) (select .cse6 .cse3) (select .cse7 .cse9))))))) (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411))) (let ((.cse16 (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse11 (select .cse16 c_~B~0.base)) (.cse12 (select .cse16 c_~A~0.base))) (<= (+ |c_thread1Thread1of1ForFork2_#t~ret3#1| c_~bsum~0 (select (select .cse10 c_~B~0.base) c_~B~0.offset) (select .cse11 .cse3) (select .cse12 .cse9)) (let ((.cse13 (select .cse12 c_~A~0.offset)) (.cse15 (select .cse11 c_~B~0.offset))) (let ((.cse14 (store .cse16 c_~C~0.base (store (select .cse16 c_~C~0.base) c_~C~0.offset (+ .cse13 .cse15))))) (+ .cse13 (select (select .cse14 c_~A~0.base) .cse2) (select (select .cse14 c_~B~0.base) .cse3) .cse15 c_~csum~0)))))))))) is different from false [2023-05-04 03:14:42,639 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_~A~0.offset 4)) (.cse2 (+ 4 c_~B~0.offset)) (.cse4 (+ c_~A~0.offset 4 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4)))) (and (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411))) (let ((.cse9 (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse1 (select .cse9 c_~B~0.base)) (.cse3 (select .cse9 c_~A~0.base))) (<= (+ |c_thread1Thread1of1ForFork2_plus_#res#1| c_~bsum~0 (select (select .cse0 c_~B~0.base) c_~B~0.offset) (select .cse1 .cse2) (select .cse3 .cse4)) (let ((.cse5 (select .cse3 c_~A~0.offset)) (.cse8 (select .cse1 c_~B~0.offset))) (let ((.cse6 (store .cse9 c_~C~0.base (store (select .cse9 c_~C~0.base) c_~C~0.offset (+ .cse5 .cse8))))) (+ .cse5 (select (select .cse6 c_~A~0.base) .cse7) (select (select .cse6 c_~B~0.base) .cse2) .cse8 c_~csum~0)))))))) (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411))) (let ((.cse13 (store .cse16 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse14 (select .cse13 c_~B~0.base)) (.cse15 (select .cse13 c_~A~0.base))) (<= (let ((.cse10 (select .cse15 c_~A~0.offset)) (.cse12 (select .cse14 c_~B~0.offset))) (let ((.cse11 (store .cse13 c_~C~0.base (store (select .cse13 c_~C~0.base) c_~C~0.offset (+ .cse10 .cse12))))) (+ .cse10 (select (select .cse11 c_~A~0.base) .cse7) (select (select .cse11 c_~B~0.base) .cse2) .cse12 c_~csum~0))) (+ |c_thread1Thread1of1ForFork2_plus_#res#1| c_~bsum~0 (select (select .cse16 c_~B~0.base) c_~B~0.offset) (select .cse14 .cse2) (select .cse15 .cse4))))))))) is different from false [2023-05-04 03:14:43,085 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_~A~0.offset 4)) (.cse2 (+ 4 c_~B~0.offset)) (.cse4 (+ c_~A~0.offset 4 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4)))) (and (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411))) (let ((.cse9 (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse1 (select .cse9 c_~B~0.base)) (.cse3 (select .cse9 c_~A~0.base))) (<= (+ |c_thread1Thread1of1ForFork2_plus_~a#1| |c_thread1Thread1of1ForFork2_plus_~b#1| c_~bsum~0 (select (select .cse0 c_~B~0.base) c_~B~0.offset) (select .cse1 .cse2) (select .cse3 .cse4)) (let ((.cse5 (select .cse3 c_~A~0.offset)) (.cse8 (select .cse1 c_~B~0.offset))) (let ((.cse6 (store .cse9 c_~C~0.base (store (select .cse9 c_~C~0.base) c_~C~0.offset (+ .cse5 .cse8))))) (+ .cse5 (select (select .cse6 c_~A~0.base) .cse7) (select (select .cse6 c_~B~0.base) .cse2) .cse8 c_~csum~0)))))))) (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411))) (let ((.cse13 (store .cse16 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse14 (select .cse13 c_~B~0.base)) (.cse15 (select .cse13 c_~A~0.base))) (<= (let ((.cse10 (select .cse15 c_~A~0.offset)) (.cse12 (select .cse14 c_~B~0.offset))) (let ((.cse11 (store .cse13 c_~C~0.base (store (select .cse13 c_~C~0.base) c_~C~0.offset (+ .cse10 .cse12))))) (+ .cse10 (select (select .cse11 c_~A~0.base) .cse7) (select (select .cse11 c_~B~0.base) .cse2) .cse12 c_~csum~0))) (+ |c_thread1Thread1of1ForFork2_plus_~a#1| |c_thread1Thread1of1ForFork2_plus_~b#1| c_~bsum~0 (select (select .cse16 c_~B~0.base) c_~B~0.offset) (select .cse14 .cse2) (select .cse15 .cse4))))))))) is different from false [2023-05-04 03:14:43,234 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_~A~0.offset 4 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (.cse2 (+ c_~A~0.offset 4)) (.cse3 (+ 4 c_~B~0.offset))) (and (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411))) (let ((.cse5 (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse6 (select .cse5 c_~B~0.base)) (.cse7 (select .cse5 c_~A~0.base))) (<= (let ((.cse0 (select .cse7 c_~A~0.offset)) (.cse4 (select .cse6 c_~B~0.offset))) (let ((.cse1 (store .cse5 c_~C~0.base (store (select .cse5 c_~C~0.base) c_~C~0.offset (+ .cse0 .cse4))))) (+ .cse0 (select (select .cse1 c_~A~0.base) .cse2) (select (select .cse1 c_~B~0.base) .cse3) .cse4 c_~csum~0))) (+ |c_thread1Thread1of1ForFork2_plus_~a#1| c_~bsum~0 |c_thread1Thread1of1ForFork2_plus_#in~b#1| (select (select .cse8 c_~B~0.base) c_~B~0.offset) (select .cse6 .cse3) (select .cse7 .cse9))))))) (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411))) (let ((.cse16 (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse11 (select .cse16 c_~B~0.base)) (.cse12 (select .cse16 c_~A~0.base))) (<= (+ |c_thread1Thread1of1ForFork2_plus_~a#1| c_~bsum~0 |c_thread1Thread1of1ForFork2_plus_#in~b#1| (select (select .cse10 c_~B~0.base) c_~B~0.offset) (select .cse11 .cse3) (select .cse12 .cse9)) (let ((.cse13 (select .cse12 c_~A~0.offset)) (.cse15 (select .cse11 c_~B~0.offset))) (let ((.cse14 (store .cse16 c_~C~0.base (store (select .cse16 c_~C~0.base) c_~C~0.offset (+ .cse13 .cse15))))) (+ .cse13 (select (select .cse14 c_~A~0.base) .cse2) (select (select .cse14 c_~B~0.base) .cse3) .cse15 c_~csum~0)))))))))) is different from false [2023-05-04 03:14:43,279 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (+ c_~A~0.offset 4 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (.cse2 (+ c_~A~0.offset 4)) (.cse3 (+ 4 c_~B~0.offset))) (and (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411))) (let ((.cse5 (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse6 (select .cse5 c_~B~0.base)) (.cse7 (select .cse5 c_~A~0.base))) (<= (let ((.cse0 (select .cse7 c_~A~0.offset)) (.cse4 (select .cse6 c_~B~0.offset))) (let ((.cse1 (store .cse5 c_~C~0.base (store (select .cse5 c_~C~0.base) c_~C~0.offset (+ .cse0 .cse4))))) (+ .cse0 (select (select .cse1 c_~A~0.base) .cse2) (select (select .cse1 c_~B~0.base) .cse3) .cse4 c_~csum~0))) (+ |c_thread1Thread1of1ForFork2_plus_#in~a#1| c_~bsum~0 |c_thread1Thread1of1ForFork2_plus_#in~b#1| (select (select .cse8 c_~B~0.base) c_~B~0.offset) (select .cse6 .cse3) (select .cse7 .cse9))))))) (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411))) (let ((.cse16 (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse11 (select .cse16 c_~B~0.base)) (.cse12 (select .cse16 c_~A~0.base))) (<= (+ |c_thread1Thread1of1ForFork2_plus_#in~a#1| c_~bsum~0 |c_thread1Thread1of1ForFork2_plus_#in~b#1| (select (select .cse10 c_~B~0.base) c_~B~0.offset) (select .cse11 .cse3) (select .cse12 .cse9)) (let ((.cse13 (select .cse12 c_~A~0.offset)) (.cse15 (select .cse11 c_~B~0.offset))) (let ((.cse14 (store .cse16 c_~C~0.base (store (select .cse16 c_~C~0.base) c_~C~0.offset (+ .cse13 .cse15))))) (+ .cse13 (select (select .cse14 c_~A~0.base) .cse2) (select (select .cse14 c_~B~0.base) .cse3) .cse15 c_~csum~0)))))))))) is different from false [2023-05-04 03:14:43,308 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_~A~0.offset 4)) (.cse2 (+ 4 c_~B~0.offset)) (.cse4 (+ c_~A~0.offset 4 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4)))) (and (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411))) (let ((.cse9 (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse1 (select .cse9 c_~B~0.base)) (.cse3 (select .cse9 c_~A~0.base))) (<= (+ c_~asum~0 c_~bsum~0 |c_thread1Thread1of1ForFork2_#t~mem2#1| (select (select .cse0 c_~B~0.base) c_~B~0.offset) (select .cse1 .cse2) (select .cse3 .cse4)) (let ((.cse5 (select .cse3 c_~A~0.offset)) (.cse8 (select .cse1 c_~B~0.offset))) (let ((.cse6 (store .cse9 c_~C~0.base (store (select .cse9 c_~C~0.base) c_~C~0.offset (+ .cse5 .cse8))))) (+ .cse5 (select (select .cse6 c_~A~0.base) .cse7) (select (select .cse6 c_~B~0.base) .cse2) .cse8 c_~csum~0)))))))) (forall ((v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_411))) (let ((.cse13 (store .cse16 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_412))) (let ((.cse14 (select .cse13 c_~B~0.base)) (.cse15 (select .cse13 c_~A~0.base))) (<= (let ((.cse10 (select .cse15 c_~A~0.offset)) (.cse12 (select .cse14 c_~B~0.offset))) (let ((.cse11 (store .cse13 c_~C~0.base (store (select .cse13 c_~C~0.base) c_~C~0.offset (+ .cse10 .cse12))))) (+ .cse10 (select (select .cse11 c_~A~0.base) .cse7) (select (select .cse11 c_~B~0.base) .cse2) .cse12 c_~csum~0))) (+ c_~asum~0 c_~bsum~0 |c_thread1Thread1of1ForFork2_#t~mem2#1| (select (select .cse16 c_~B~0.base) c_~B~0.offset) (select .cse14 .cse2) (select .cse15 .cse4))))))))) is different from false [2023-05-04 03:14:44,389 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 03:14:44,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 8273782 treesize of output 7525006 [2023-05-04 03:14:53,807 WARN L233 SmtUtils]: Spent 9.39s on a formula simplification that was a NOOP. DAG size: 9424 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 03:14:55,291 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 03:14:55,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 8636406 treesize of output 7912905 [2023-05-04 03:15:06,723 WARN L233 SmtUtils]: Spent 11.41s on a formula simplification that was a NOOP. DAG size: 9876 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 03:15:08,738 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 03:15:08,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 11585910 treesize of output 9063369 [2023-05-04 03:15:27,556 WARN L233 SmtUtils]: Spent 18.79s on a formula simplification that was a NOOP. DAG size: 9952 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 03:16:26,612 WARN L233 SmtUtils]: Spent 39.47s on a formula simplification that was a NOOP. DAG size: 9895 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 03:16:58,503 WARN L233 SmtUtils]: Spent 15.94s on a formula simplification that was a NOOP. DAG size: 9887 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 03:22:24,343 WARN L233 SmtUtils]: Spent 35.29s on a formula simplification that was a NOOP. DAG size: 9891 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 03:23:00,596 WARN L233 SmtUtils]: Spent 18.48s on a formula simplification that was a NOOP. DAG size: 9884 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 03:26:35,005 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 03:26:35,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 9063286 treesize of output 6963488 [2023-05-04 03:26:53,174 WARN L233 SmtUtils]: Spent 18.15s on a formula simplification that was a NOOP. DAG size: 9899 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2023-05-04 03:27:42,604 WARN L249 SmtUtils]: Removed 1 from assertion stack [2023-05-04 03:27:42,608 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-05-04 03:27:42,616 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 [2023-05-04 03:27:42,617 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 [2023-05-04 03:27:42,617 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 03:27:42,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-05-04 03:27:42,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 03:27:42,817 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 454 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2023-05-04 03:27:42,819 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-05-04 03:27:42,820 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-05-04 03:27:42,820 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-05-04 03:27:42,827 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2023-05-04 03:27:42,830 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-04 03:27:42,830 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 03:27:42,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 03:27:42 BasicIcfg [2023-05-04 03:27:42,832 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 03:27:42,833 INFO L158 Benchmark]: Toolchain (without parser) took 848996.44ms. Allocated memory was 206.6MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 181.0MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2023-05-04 03:27:42,833 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 206.6MB. Free memory is still 166.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 03:27:42,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.46ms. Allocated memory is still 206.6MB. Free memory was 180.9MB in the beginning and 178.3MB in the end (delta: 2.6MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. [2023-05-04 03:27:42,834 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.19ms. Allocated memory is still 206.6MB. Free memory was 178.3MB in the beginning and 175.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 03:27:42,834 INFO L158 Benchmark]: Boogie Preprocessor took 42.83ms. Allocated memory is still 206.6MB. Free memory was 175.5MB in the beginning and 173.6MB in the end (delta: 1.9MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-05-04 03:27:42,835 INFO L158 Benchmark]: RCFGBuilder took 589.74ms. Allocated memory is still 206.6MB. Free memory was 173.4MB in the beginning and 148.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-05-04 03:27:42,835 INFO L158 Benchmark]: TraceAbstraction took 847991.11ms. Allocated memory was 206.6MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 147.2MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2023-05-04 03:27:42,837 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.48ms. Allocated memory is still 206.6MB. Free memory is still 166.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 315.46ms. Allocated memory is still 206.6MB. Free memory was 180.9MB in the beginning and 178.3MB in the end (delta: 2.6MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.19ms. Allocated memory is still 206.6MB. Free memory was 178.3MB in the beginning and 175.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.83ms. Allocated memory is still 206.6MB. Free memory was 175.5MB in the beginning and 173.6MB in the end (delta: 1.9MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 589.74ms. Allocated memory is still 206.6MB. Free memory was 173.4MB in the beginning and 148.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 847991.11ms. Allocated memory was 206.6MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 147.2MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 778322, independent: 662745, independent conditional: 633414, independent unconditional: 29331, dependent: 115577, dependent conditional: 115550, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 663411, independent: 662745, independent conditional: 633414, independent unconditional: 29331, dependent: 666, dependent conditional: 639, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 663411, independent: 662745, independent conditional: 633414, independent unconditional: 29331, dependent: 666, dependent conditional: 639, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 666455, independent: 662745, independent conditional: 0, independent unconditional: 662745, dependent: 3710, dependent conditional: 3044, dependent unconditional: 666, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 666455, independent: 662745, independent conditional: 0, independent unconditional: 662745, dependent: 3710, dependent conditional: 481, dependent unconditional: 3229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 666455, independent: 662745, independent conditional: 0, independent unconditional: 662745, dependent: 3710, dependent conditional: 481, dependent unconditional: 3229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19860, independent: 19812, independent conditional: 0, independent unconditional: 19812, dependent: 48, dependent conditional: 21, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19860, independent: 19810, independent conditional: 0, independent unconditional: 19810, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 50, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 48, dependent conditional: 21, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 50, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 48, dependent conditional: 21, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 166, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 120, dependent conditional: 58, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 666455, independent: 642933, independent conditional: 0, independent unconditional: 642933, dependent: 3662, dependent conditional: 460, dependent unconditional: 3202, unknown: 19860, unknown conditional: 21, unknown unconditional: 19839] , Statistics on independence cache: Total cache size (in pairs): 19860, Positive cache size: 19812, Positive conditional cache size: 0, Positive unconditional cache size: 19812, Negative cache size: 48, Negative conditional cache size: 21, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2563, Maximal queried relation: 7, Independence queries for same thread: 114911 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.8s, Number of persistent set computation: 16169, Number of trivial persistent sets: 9406, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29358, independent: 29331, independent conditional: 0, independent unconditional: 29331, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 778322, independent: 662745, independent conditional: 633414, independent unconditional: 29331, dependent: 115577, dependent conditional: 115550, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 663411, independent: 662745, independent conditional: 633414, independent unconditional: 29331, dependent: 666, dependent conditional: 639, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 663411, independent: 662745, independent conditional: 633414, independent unconditional: 29331, dependent: 666, dependent conditional: 639, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 666455, independent: 662745, independent conditional: 0, independent unconditional: 662745, dependent: 3710, dependent conditional: 3044, dependent unconditional: 666, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 666455, independent: 662745, independent conditional: 0, independent unconditional: 662745, dependent: 3710, dependent conditional: 481, dependent unconditional: 3229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 666455, independent: 662745, independent conditional: 0, independent unconditional: 662745, dependent: 3710, dependent conditional: 481, dependent unconditional: 3229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19860, independent: 19812, independent conditional: 0, independent unconditional: 19812, dependent: 48, dependent conditional: 21, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19860, independent: 19810, independent conditional: 0, independent unconditional: 19810, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 50, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 48, dependent conditional: 21, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 50, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 48, dependent conditional: 21, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 166, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 120, dependent conditional: 58, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 666455, independent: 642933, independent conditional: 0, independent unconditional: 642933, dependent: 3662, dependent conditional: 460, dependent unconditional: 3202, unknown: 19860, unknown conditional: 21, unknown unconditional: 19839] , Statistics on independence cache: Total cache size (in pairs): 19860, Positive cache size: 19812, Positive conditional cache size: 0, Positive unconditional cache size: 19812, Negative cache size: 48, Negative conditional cache size: 21, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2563, Maximal queried relation: 7, Independence queries for same thread: 114911 - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 454 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 84]: 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 454 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 85]: 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 454 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 83]: 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 454 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 481 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 847.7s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 9.1s, 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: 87, 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.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 3929 NumberOfCodeBlocks, 3929 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 5583 ConstructedInterpolants, 0 QuantifiedInterpolants, 16158 SizeOfPredicates, 37 NumberOfNonLiveVariables, 3285 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 18 InterpolantComputations, 5 PerfectInterpolantSequences, 550/691 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