/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 false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps X --traceabstraction.defines.what.statements.are.considered.a.step.in.por LOOP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 19:39:00,088 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 19:39:00,089 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 19:39:00,106 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 19:39:00,106 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 19:39:00,107 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 19:39:00,108 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 19:39:00,109 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 19:39:00,110 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 19:39:00,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 19:39:00,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 19:39:00,112 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 19:39:00,112 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 19:39:00,113 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 19:39:00,113 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 19:39:00,114 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 19:39:00,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 19:39:00,115 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 19:39:00,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 19:39:00,117 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 19:39:00,118 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 19:39:00,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 19:39:00,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 19:39:00,120 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 19:39:00,122 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 19:39:00,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 19:39:00,123 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 19:39:00,123 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 19:39:00,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 19:39:00,124 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 19:39:00,124 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 19:39:00,124 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 19:39:00,125 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 19:39:00,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 19:39:00,126 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 19:39:00,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 19:39:00,126 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 19:39:00,126 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 19:39:00,127 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 19:39:00,127 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 19:39:00,128 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 19:39:00,128 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 19:39:00,144 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 19:39:00,145 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 19:39:00,145 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 19:39:00,145 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 19:39:00,146 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 19:39:00,146 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 19:39:00,146 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 19:39:00,146 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 19:39:00,146 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 19:39:00,146 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 19:39:00,147 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 19:39:00,147 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 19:39:00,147 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 19:39:00,147 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 19:39:00,147 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 19:39:00,147 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 19:39:00,147 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 19:39:00,148 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 19:39:00,148 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 19:39:00,148 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 19:39:00,148 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 19:39:00,148 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 19:39:00,148 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 19:39:00,149 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 19:39:00,149 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 19:39:00,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 19:39:00,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 19:39:00,149 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 19:39:00,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 19:39:00,149 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 19:39:00,150 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 19:39:00,150 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 19:39:00,150 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 19:39:00,150 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 19:39:00,150 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 19:39:00,150 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 19:39:00,150 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 -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> X Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> LOOP [2023-05-04 19:39:00,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 19:39:00,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 19:39:00,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 19:39:00,323 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 19:39:00,324 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 19:39:00,325 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i [2023-05-04 19:39:00,372 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3800320ed/4a248184827c4c099c4518d5036562c9/FLAG1a929e9af [2023-05-04 19:39:00,774 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 19:39:00,775 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i [2023-05-04 19:39:00,783 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3800320ed/4a248184827c4c099c4518d5036562c9/FLAG1a929e9af [2023-05-04 19:39:00,792 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3800320ed/4a248184827c4c099c4518d5036562c9 [2023-05-04 19:39:00,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 19:39:00,795 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 19:39:00,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 19:39:00,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 19:39:00,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 19:39:00,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 07:39:00" (1/1) ... [2023-05-04 19:39:00,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47d85cc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:39:00, skipping insertion in model container [2023-05-04 19:39:00,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 07:39:00" (1/1) ... [2023-05-04 19:39:00,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 19:39:00,833 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 19:39:01,106 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i[30687,30700] [2023-05-04 19:39:01,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 19:39:01,119 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 19:39:01,153 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i[30687,30700] [2023-05-04 19:39:01,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 19:39:01,185 INFO L208 MainTranslator]: Completed translation [2023-05-04 19:39:01,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:39:01 WrapperNode [2023-05-04 19:39:01,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 19:39:01,187 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 19:39:01,187 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 19:39:01,187 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 19:39:01,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:39:01" (1/1) ... [2023-05-04 19:39:01,218 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:39:01" (1/1) ... [2023-05-04 19:39:01,236 INFO L138 Inliner]: procedures = 170, calls = 35, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 102 [2023-05-04 19:39:01,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 19:39:01,236 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 19:39:01,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 19:39:01,237 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 19:39:01,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:39:01" (1/1) ... [2023-05-04 19:39:01,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:39:01" (1/1) ... [2023-05-04 19:39:01,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:39:01" (1/1) ... [2023-05-04 19:39:01,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:39:01" (1/1) ... [2023-05-04 19:39:01,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:39:01" (1/1) ... [2023-05-04 19:39:01,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:39:01" (1/1) ... [2023-05-04 19:39:01,264 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:39:01" (1/1) ... [2023-05-04 19:39:01,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:39:01" (1/1) ... [2023-05-04 19:39:01,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 19:39:01,266 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 19:39:01,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 19:39:01,267 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 19:39:01,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:39:01" (1/1) ... [2023-05-04 19:39:01,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 19:39:01,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:39:01,291 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 19:39:01,308 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 19:39:01,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 19:39:01,319 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-05-04 19:39:01,319 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-05-04 19:39:01,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 19:39:01,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 19:39:01,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 19:39:01,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 19:39:01,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 19:39:01,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 19:39:01,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 19:39:01,323 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 19:39:01,398 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 19:39:01,399 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 19:39:01,592 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 19:39:01,639 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 19:39:01,639 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-05-04 19:39:01,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 07:39:01 BoogieIcfgContainer [2023-05-04 19:39:01,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 19:39:01,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 19:39:01,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 19:39:01,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 19:39:01,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 07:39:00" (1/3) ... [2023-05-04 19:39:01,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133e77a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 07:39:01, skipping insertion in model container [2023-05-04 19:39:01,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:39:01" (2/3) ... [2023-05-04 19:39:01,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133e77a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 07:39:01, skipping insertion in model container [2023-05-04 19:39:01,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 07:39:01" (3/3) ... [2023-05-04 19:39:01,646 INFO L112 eAbstractionObserver]: Analyzing ICFG 36_stack_cas_p0_vs_concur.i [2023-05-04 19:39:01,651 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 19:39:01,657 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 19:39:01,657 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-05-04 19:39:01,657 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 19:39:01,696 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-05-04 19:39:01,721 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 19:39:01,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 19:39:01,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:39:01,723 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 19:39:01,749 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 19:39:01,772 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 19:39:01,783 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2023-05-04 19:39:01,802 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;@18a76528, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 19:39:01,802 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 19:39:02,070 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:39:02,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:39:02,074 INFO L85 PathProgramCache]: Analyzing trace with hash -773551176, now seen corresponding path program 1 times [2023-05-04 19:39:02,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:39:02,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132443606] [2023-05-04 19:39:02,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:39:02,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:39:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:39:02,297 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 19:39:02,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:39:02,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132443606] [2023-05-04 19:39:02,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132443606] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:39:02,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:39:02,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 19:39:02,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530397718] [2023-05-04 19:39:02,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:39:02,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 19:39:02,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:39:02,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 19:39:02,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 19:39:02,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:39:02,325 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:39:02,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 19:39:02,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:39:02,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:39:02,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 19:39:02,370 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:39:02,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:39:02,371 INFO L85 PathProgramCache]: Analyzing trace with hash 220234821, now seen corresponding path program 1 times [2023-05-04 19:39:02,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:39:02,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504832750] [2023-05-04 19:39:02,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:39:02,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:39:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:39:02,495 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:39:02,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:39:02,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504832750] [2023-05-04 19:39:02,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504832750] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:39:02,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:39:02,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 19:39:02,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932233489] [2023-05-04 19:39:02,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:39:02,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 19:39:02,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:39:02,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 19:39:02,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-04 19:39:02,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:39:02,498 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:39:02,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 19:39:02,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:39:02,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:39:02,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:39:02,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:39:02,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-04 19:39:02,534 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:39:02,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:39:02,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1987034589, now seen corresponding path program 1 times [2023-05-04 19:39:02,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:39:02,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512820648] [2023-05-04 19:39:02,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:39:02,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:39:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:39:03,330 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:39:03,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:39:03,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512820648] [2023-05-04 19:39:03,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512820648] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 19:39:03,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415141686] [2023-05-04 19:39:03,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:39:03,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:39:03,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:39:03,373 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 19:39:03,449 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 19:39:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:39:03,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 65 conjunts are in the unsatisfiable core [2023-05-04 19:39:03,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 19:39:03,625 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 19:39:03,733 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 19:39:03,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 19:39:03,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-05-04 19:39:03,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-05-04 19:39:04,142 INFO L356 Elim1Store]: treesize reduction 42, result has 42.5 percent of original size [2023-05-04 19:39:04,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 74 [2023-05-04 19:39:04,179 INFO L356 Elim1Store]: treesize reduction 82, result has 27.4 percent of original size [2023-05-04 19:39:04,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 67 treesize of output 99 [2023-05-04 19:39:04,188 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 8 treesize of output 7 [2023-05-04 19:39:04,253 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 8 treesize of output 7 [2023-05-04 19:39:04,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 19 treesize of output 38 [2023-05-04 19:39:04,330 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 10 treesize of output 9 [2023-05-04 19:39:04,340 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 10 treesize of output 9 [2023-05-04 19:39:04,453 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 0 case distinctions, treesize of input 23 treesize of output 18 [2023-05-04 19:39:04,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-05-04 19:39:04,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-05-04 19:39:04,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-05-04 19:39:04,504 WARN L234 Elim1Store]: Array PQE input equivalent to false [2023-05-04 19:39:04,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-05-04 19:39:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:39:04,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 19:39:06,664 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse1 |c_~#top~0.offset|)))) (and (or (not .cse0) (forall ((v_ArrVal_110 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_5| Int)) (not (= (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_#t~mem8#1|)) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_5| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_110) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_5|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (or (forall ((v_ArrVal_109 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_5| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_5| v_ArrVal_109) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse0)))) is different from false [2023-05-04 19:39:27,692 WARN L233 SmtUtils]: Spent 10.07s on a formula simplification. DAG size of input: 38 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:39:29,720 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#top~0.base|))) (and (forall ((v_ArrVal_110 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_5| Int)) (not (= (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse0 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_5| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_110) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_5|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (= |c_thr1Thread1of1ForFork0_push_#t~mem6#1| (select .cse0 |c_~#top~0.offset|)))) is different from false [2023-05-04 19:39:30,169 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_110 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_5| Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_108))) (store (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse0 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_5| (store (select (store .cse0 |c_~#top~0.base| v_ArrVal_110) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_5|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2023-05-04 19:39:30,209 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:39:30,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 53 [2023-05-04 19:39:30,218 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:39:30,218 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-05-04 19:39:30,294 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2023-05-04 19:39:30,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1221 treesize of output 1183 [2023-05-04 19:39:30,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1163 treesize of output 1131 [2023-05-04 19:39:30,326 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:39:30,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1131 treesize of output 1092 [2023-05-04 19:39:30,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-05-04 19:39:30,485 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:39:30,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 587 treesize of output 569 [2023-05-04 19:39:30,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 554 treesize of output 538 [2023-05-04 19:39:30,503 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:39:30,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 538 treesize of output 523 [2023-05-04 19:39:30,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2023-05-04 19:39:30,957 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-05-04 19:39:30,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415141686] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 19:39:30,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 19:39:30,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 37 [2023-05-04 19:39:30,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326337074] [2023-05-04 19:39:30,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 19:39:30,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-05-04 19:39:30,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:39:30,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-05-04 19:39:30,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=966, Unknown=14, NotChecked=198, Total=1332 [2023-05-04 19:39:30,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:39:30,960 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:39:30,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.54054054054054) internal successors, (168), 37 states have internal predecessors, (168), 0 states have call successors, (0), 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 19:39:30,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:39:30,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:39:30,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:39:31,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:39:31,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:39:31,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-05-04 19:39:31,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-05-04 19:39:31,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-05-04 19:39:31,565 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:39:31,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:39:31,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1660441987, now seen corresponding path program 1 times [2023-05-04 19:39:31,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:39:31,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271486378] [2023-05-04 19:39:31,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:39:31,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:39:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:39:31,885 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-05-04 19:39:31,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:39:31,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271486378] [2023-05-04 19:39:31,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271486378] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 19:39:31,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623641877] [2023-05-04 19:39:31,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:39:31,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:39:31,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:39:31,891 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 19:39:31,944 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 19:39:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:39:32,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 42 conjunts are in the unsatisfiable core [2023-05-04 19:39:32,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 19:39:32,249 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-05-04 19:39:32,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2023-05-04 19:39:32,254 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 8 treesize of output 7 [2023-05-04 19:39:32,259 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 8 treesize of output 7 [2023-05-04 19:39:32,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 11 [2023-05-04 19:39:32,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-05-04 19:39:32,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-05-04 19:39:32,361 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-05-04 19:39:32,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 19:39:32,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623641877] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:39:32,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 19:39:32,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2023-05-04 19:39:32,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793403820] [2023-05-04 19:39:32,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:39:32,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-05-04 19:39:32,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:39:32,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-05-04 19:39:32,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2023-05-04 19:39:32,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:39:32,363 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:39:32,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 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 19:39:32,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:39:32,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:39:32,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-05-04 19:39:32,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:39:32,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:39:32,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:39:32,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-05-04 19:39:32,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:39:32,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-05-04 19:39:32,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:39:32,720 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:39:32,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:39:32,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1156705785, now seen corresponding path program 1 times [2023-05-04 19:39:32,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:39:32,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773975360] [2023-05-04 19:39:32,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:39:32,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:39:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:39:33,251 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:39:33,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:39:33,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773975360] [2023-05-04 19:39:33,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773975360] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 19:39:33,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22672376] [2023-05-04 19:39:33,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:39:33,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:39:33,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:39:33,253 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 19:39:33,273 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 19:39:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:39:33,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 62 conjunts are in the unsatisfiable core [2023-05-04 19:39:33,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 19:39:33,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-05-04 19:39:33,952 INFO L356 Elim1Store]: treesize reduction 42, result has 42.5 percent of original size [2023-05-04 19:39:33,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 74 [2023-05-04 19:39:33,998 INFO L356 Elim1Store]: treesize reduction 78, result has 31.0 percent of original size [2023-05-04 19:39:33,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 67 treesize of output 103 [2023-05-04 19:39:34,004 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 8 treesize of output 7 [2023-05-04 19:39:34,071 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 8 treesize of output 7 [2023-05-04 19:39:34,093 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 10 treesize of output 9 [2023-05-04 19:39:34,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2023-05-04 19:39:34,188 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 0 case distinctions, treesize of input 23 treesize of output 18 [2023-05-04 19:39:34,230 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 0 case distinctions, treesize of input 14 treesize of output 11 [2023-05-04 19:39:34,278 INFO L356 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2023-05-04 19:39:34,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 77 [2023-05-04 19:39:34,520 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:39:34,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2023-05-04 19:39:34,540 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:39:34,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 19:39:36,595 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse1 |c_~#top~0.offset|)))) (and (or (forall ((v_ArrVal_305 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_7| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_7| v_ArrVal_305) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse0) (or (not .cse0) (forall ((v_ArrVal_308 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_7| Int)) (not (= (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_#t~mem8#1|)) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_7| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_308) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_7|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))))) is different from false [2023-05-04 19:39:38,624 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse1 |c_~#top~0.offset|)))) (and (or (not .cse0) (forall ((v_ArrVal_308 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_7| Int)) (not (= (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_7| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_308) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_7|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (or (forall ((v_ArrVal_305 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_7| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_7| v_ArrVal_305) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse0)))) is different from false [2023-05-04 19:40:00,358 WARN L233 SmtUtils]: Spent 9.08s on a formula simplification. DAG size of input: 38 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:40:02,432 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:40:02,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 53 [2023-05-04 19:40:02,442 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:40:02,442 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-05-04 19:40:02,544 INFO L356 Elim1Store]: treesize reduction 73, result has 45.5 percent of original size [2023-05-04 19:40:02,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 115 treesize of output 154 [2023-05-04 19:40:02,558 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-05-04 19:40:02,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 128 [2023-05-04 19:40:02,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 99 [2023-05-04 19:40:02,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-05-04 19:40:02,654 INFO L356 Elim1Store]: treesize reduction 38, result has 56.8 percent of original size [2023-05-04 19:40:02,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 98 [2023-05-04 19:40:02,661 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:40:02,661 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2023-05-04 19:40:02,676 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:40:02,677 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 99 treesize of output 113 [2023-05-04 19:40:02,687 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:40:02,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 72 [2023-05-04 19:40:02,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-05-04 19:40:02,925 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:40:02,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 50 [2023-05-04 19:40:03,047 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-05-04 19:40:03,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22672376] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 19:40:03,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 19:40:03,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 32 [2023-05-04 19:40:03,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638677292] [2023-05-04 19:40:03,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 19:40:03,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-05-04 19:40:03,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:40:03,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-05-04 19:40:03,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=728, Unknown=18, NotChecked=114, Total=992 [2023-05-04 19:40:03,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:40:03,050 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:40:03,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.625) internal successors, (276), 32 states have internal predecessors, (276), 0 states have call successors, (0), 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 19:40:03,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:40:03,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:40:03,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-05-04 19:40:03,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:40:03,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:40:11,674 WARN L233 SmtUtils]: Spent 8.28s on a formula simplification. DAG size of input: 59 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:40:34,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:40:34,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:40:34,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-05-04 19:40:34,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:40:34,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-05-04 19:40:34,545 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 19:40:34,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:40:34,730 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:40:34,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:40:34,731 INFO L85 PathProgramCache]: Analyzing trace with hash -204085379, now seen corresponding path program 1 times [2023-05-04 19:40:34,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:40:34,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470706982] [2023-05-04 19:40:34,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:40:34,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:40:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:40:35,164 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 129 proven. 16 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-05-04 19:40:35,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:40:35,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470706982] [2023-05-04 19:40:35,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470706982] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 19:40:35,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80620026] [2023-05-04 19:40:35,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:40:35,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:40:35,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:40:35,179 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 19:40:35,180 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 19:40:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:40:35,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 42 conjunts are in the unsatisfiable core [2023-05-04 19:40:35,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 19:40:35,582 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-05-04 19:40:35,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2023-05-04 19:40:35,586 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 8 treesize of output 7 [2023-05-04 19:40:35,590 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 8 treesize of output 7 [2023-05-04 19:40:35,597 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 19:40:35,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 5 [2023-05-04 19:40:35,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-05-04 19:40:35,688 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:40:35,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 51 [2023-05-04 19:40:35,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-05-04 19:40:35,710 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 135 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-05-04 19:40:35,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 19:40:35,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-05-04 19:40:35,737 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-05-04 19:40:35,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80620026] provided 1 perfect and 1 imperfect interpolant sequences [2023-05-04 19:40:35,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-05-04 19:40:35,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 9] total 16 [2023-05-04 19:40:35,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621105235] [2023-05-04 19:40:35,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:40:35,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-05-04 19:40:35,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:40:35,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-05-04 19:40:35,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=199, Unknown=2, NotChecked=0, Total=240 [2023-05-04 19:40:35,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:40:35,738 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:40:35,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 19:40:35,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:40:35,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:40:35,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-05-04 19:40:35,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:40:35,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-05-04 19:40:35,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:40:44,150 WARN L233 SmtUtils]: Spent 8.12s on a formula simplification. DAG size of input: 54 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:40:44,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:40:44,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:40:44,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-05-04 19:40:44,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:40:44,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-05-04 19:40:44,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:40:44,204 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 19:40:44,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:40:44,372 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:40:44,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:40:44,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1780098134, now seen corresponding path program 2 times [2023-05-04 19:40:44,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:40:44,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423833389] [2023-05-04 19:40:44,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:40:44,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:40:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:40:45,032 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:40:45,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:40:45,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423833389] [2023-05-04 19:40:45,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423833389] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 19:40:45,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123153889] [2023-05-04 19:40:45,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 19:40:45,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:40:45,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:40:45,046 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 19:40:45,047 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 19:40:45,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 19:40:45,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 19:40:45,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 47 conjunts are in the unsatisfiable core [2023-05-04 19:40:45,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 19:40:45,205 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 19:40:45,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 19:40:45,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-05-04 19:40:45,485 INFO L356 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-05-04 19:40:45,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2023-05-04 19:40:45,489 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 8 treesize of output 7 [2023-05-04 19:40:45,493 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 8 treesize of output 7 [2023-05-04 19:40:45,505 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 19:40:45,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 5 [2023-05-04 19:40:45,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-05-04 19:40:45,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-05-04 19:40:45,567 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:40:45,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 19:40:45,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-05-04 19:40:45,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-05-04 19:40:45,755 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 19:40:45,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-05-04 19:40:45,772 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 19:40:45,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123153889] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 19:40:45,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 19:40:45,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 10] total 36 [2023-05-04 19:40:45,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739427897] [2023-05-04 19:40:45,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 19:40:45,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-05-04 19:40:45,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:40:45,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-05-04 19:40:45,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1125, Unknown=7, NotChecked=0, Total=1260 [2023-05-04 19:40:45,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:40:45,774 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:40:45,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.472222222222222) internal successors, (197), 36 states have internal predecessors, (197), 0 states have call successors, (0), 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 19:40:45,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:40:45,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:40:45,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-05-04 19:40:45,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:40:45,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-05-04 19:40:45,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:40:45,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:41:21,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:41:21,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:41:21,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-05-04 19:41:21,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:41:21,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-05-04 19:41:21,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:41:21,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-05-04 19:41:21,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-05-04 19:41:21,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:41:21,559 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:41:21,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:41:21,560 INFO L85 PathProgramCache]: Analyzing trace with hash 612973849, now seen corresponding path program 2 times [2023-05-04 19:41:21,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:41:21,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351514494] [2023-05-04 19:41:21,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:41:21,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:41:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:41:22,245 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:41:22,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:41:22,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351514494] [2023-05-04 19:41:22,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351514494] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 19:41:22,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007993756] [2023-05-04 19:41:22,246 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 19:41:22,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:41:22,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:41:22,265 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 19:41:22,267 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 19:41:22,370 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 19:41:22,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 19:41:22,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 84 conjunts are in the unsatisfiable core [2023-05-04 19:41:22,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 19:41:22,438 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 19:41:22,535 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-05-04 19:41:22,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-05-04 19:41:22,589 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-05-04 19:41:22,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-05-04 19:41:22,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-05-04 19:41:22,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-05-04 19:41:23,032 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 19:41:23,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 19:41:23,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-05-04 19:41:23,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-05-04 19:41:23,391 INFO L356 Elim1Store]: treesize reduction 42, result has 42.5 percent of original size [2023-05-04 19:41:23,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 74 [2023-05-04 19:41:23,426 INFO L356 Elim1Store]: treesize reduction 78, result has 31.0 percent of original size [2023-05-04 19:41:23,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 67 treesize of output 103 [2023-05-04 19:41:23,432 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 8 treesize of output 7 [2023-05-04 19:41:23,464 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 8 treesize of output 7 [2023-05-04 19:41:23,484 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 10 treesize of output 9 [2023-05-04 19:41:23,524 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 0 case distinctions, treesize of input 23 treesize of output 18 [2023-05-04 19:41:23,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-05-04 19:41:23,540 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 0 case distinctions, treesize of input 16 treesize of output 11 [2023-05-04 19:41:23,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 39 [2023-05-04 19:41:23,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 19:41:23,578 INFO L356 Elim1Store]: treesize reduction 33, result has 13.2 percent of original size [2023-05-04 19:41:23,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 28 [2023-05-04 19:41:23,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 19:41:23,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 19:41:23,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-05-04 19:41:23,762 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:41:23,763 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 42 treesize of output 42 [2023-05-04 19:41:23,791 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:41:23,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 19:41:25,828 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse1 |c_~#top~0.offset|)))) (and (or (not .cse0) (forall ((|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_17| Int) (v_ArrVal_664 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_#t~mem8#1|)) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_17| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_664) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_17|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (or (forall ((v_ArrVal_667 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_17| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_17| v_ArrVal_667) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse0)))) is different from false [2023-05-04 19:41:49,261 WARN L233 SmtUtils]: Spent 8.26s on a formula simplification. DAG size of input: 38 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:42:08,207 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:42:08,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 53 [2023-05-04 19:42:08,215 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:42:08,215 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-05-04 19:42:08,255 INFO L356 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2023-05-04 19:42:08,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1221 treesize of output 1183 [2023-05-04 19:42:08,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1163 treesize of output 1131 [2023-05-04 19:42:08,276 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:42:08,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1131 treesize of output 1092 [2023-05-04 19:42:08,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-05-04 19:42:08,416 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:42:08,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1171 treesize of output 1129 [2023-05-04 19:42:08,428 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:42:08,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1114 treesize of output 1075 [2023-05-04 19:42:08,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1066 treesize of output 1034 [2023-05-04 19:42:08,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2023-05-04 19:42:09,013 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:42:09,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 50 [2023-05-04 19:42:09,613 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-05-04 19:42:09,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007993756] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 19:42:09,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 19:42:09,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 19] total 53 [2023-05-04 19:42:09,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825096606] [2023-05-04 19:42:09,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 19:42:09,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-05-04 19:42:09,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:42:09,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-05-04 19:42:09,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=2287, Unknown=52, NotChecked=100, Total=2756 [2023-05-04 19:42:09,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:42:09,616 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:42:09,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 5.2075471698113205) internal successors, (276), 53 states have internal predecessors, (276), 0 states have call successors, (0), 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 19:42:09,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:42:09,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:42:09,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-05-04 19:42:09,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:42:09,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2023-05-04 19:42:09,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:42:09,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-05-04 19:42:09,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:42:33,446 WARN L233 SmtUtils]: Spent 10.79s on a formula simplification. DAG size of input: 57 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:42:38,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:42:38,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:42:38,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-05-04 19:42:38,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 19:42:38,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-05-04 19:42:38,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 19:42:38,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-05-04 19:42:38,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-05-04 19:42:38,776 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 19:42:38,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:42:38,976 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:42:38,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:42:38,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1034867930, now seen corresponding path program 2 times [2023-05-04 19:42:38,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:42:38,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89043091] [2023-05-04 19:42:38,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:42:38,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:42:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:42:39,557 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 32 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:42:39,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:42:39,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89043091] [2023-05-04 19:42:39,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89043091] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 19:42:39,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840471713] [2023-05-04 19:42:39,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 19:42:39,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:42:39,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:42:39,559 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 19:42:39,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-05-04 19:42:39,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 19:42:39,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 19:42:39,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 113 conjunts are in the unsatisfiable core [2023-05-04 19:42:39,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 19:42:39,792 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 19:42:39,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 19:42:40,141 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 19:42:40,178 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 19:42:40,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 19:42:40,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-05-04 19:42:40,541 INFO L356 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2023-05-04 19:42:40,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 29 [2023-05-04 19:42:40,611 INFO L356 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2023-05-04 19:42:40,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 52 [2023-05-04 19:42:40,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-05-04 19:42:40,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-05-04 19:42:41,039 INFO L356 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2023-05-04 19:42:41,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 37 [2023-05-04 19:42:41,063 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-05-04 19:42:41,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 41 [2023-05-04 19:42:41,152 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-05-04 19:42:41,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2023-05-04 19:42:41,171 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:42:41,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 19:42:41,437 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_793 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_793) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2023-05-04 19:42:41,522 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_793 (Array Int Int)) (v_ArrVal_792 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_792))) (or (not (= (select (select (store (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse0 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_793) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse0 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))))) is different from false [2023-05-04 19:42:41,552 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse4 |c_~#top~0.offset|)))) (and (or .cse0 (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_792 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_788) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_792))) (or (not (= (select (select (store (store .cse1 |c_~#top~0.base| (store (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse1 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_793) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse1 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0)))))) (or (not .cse0) (forall ((v_ArrVal_793 (Array Int Int)) (v_ArrVal_792 (Array Int Int))) (let ((.cse2 (store (let ((.cse3 (store |c_#memory_int| |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_#t~mem8#1|)))) (store .cse3 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse3 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_792))) (or (not (= (select (select (store (store .cse2 |c_~#top~0.base| (store (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse2 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_793) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse2 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))))))))) is different from false [2023-05-04 19:42:41,572 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse3 |c_~#top~0.offset|)))) (and (or (not .cse0) (forall ((v_ArrVal_793 (Array Int Int)) (v_ArrVal_792 (Array Int Int))) (let ((.cse1 (store (let ((.cse2 (store |c_#memory_int| |c_~#top~0.base| (store .cse3 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (store .cse2 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse2 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_792))) (or (not (= (select (select .cse1 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0)) (not (= (select (select (store (store .cse1 |c_~#top~0.base| (store (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse1 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_793) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))) (or .cse0 (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_792 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_788) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_792))) (or (not (= (select (select (store (store .cse4 |c_~#top~0.base| (store (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse4 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_793) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse4 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))))))))) is different from false [2023-05-04 19:42:41,650 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_#t~mem6#1| (select .cse4 |c_~#top~0.offset|)))) (and (or .cse0 (forall ((v_ArrVal_788 (Array Int Int)) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_792 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_788) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_792))) (or (not (= (select (select (store (store .cse1 |c_~#top~0.base| (store (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse1 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_793) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (select (select .cse1 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0)))))) (or (forall ((v_ArrVal_793 (Array Int Int)) (v_ArrVal_792 (Array Int Int))) (let ((.cse2 (store (let ((.cse3 (store |c_#memory_int| |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (store .cse3 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse3 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_792))) (or (not (= (select (select .cse2 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0)) (not (= (select (select (store (store .cse2 |c_~#top~0.base| (store (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse2 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_793) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))) (not .cse0))))) is different from false [2023-05-04 19:42:41,658 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_793 (Array Int Int)) (v_ArrVal_792 (Array Int Int))) (let ((.cse0 (store (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (store .cse1 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse1 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_792))) (or (not (= (select (select .cse0 |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0)) (not (= (select (select (store (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse0 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_793) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))) is different from false [2023-05-04 19:42:41,725 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:42:41,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 53 [2023-05-04 19:42:41,737 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:42:41,737 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-05-04 19:42:41,821 INFO L356 Elim1Store]: treesize reduction 27, result has 60.9 percent of original size [2023-05-04 19:42:41,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 362 treesize of output 312 [2023-05-04 19:42:41,918 INFO L356 Elim1Store]: treesize reduction 74, result has 46.0 percent of original size [2023-05-04 19:42:41,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 293 treesize of output 324 [2023-05-04 19:42:42,031 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-05-04 19:42:42,031 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 44 [2023-05-04 19:42:42,549 INFO L356 Elim1Store]: treesize reduction 28, result has 50.9 percent of original size [2023-05-04 19:42:42,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 142 [2023-05-04 19:42:42,616 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2023-05-04 19:42:42,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-05-04 19:42:42,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-05-04 19:42:42,834 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:187) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-05-04 19:42:42,839 INFO L158 Benchmark]: Toolchain (without parser) took 222044.13ms. Allocated memory was 187.7MB in the beginning and 265.3MB in the end (delta: 77.6MB). Free memory was 131.0MB in the beginning and 213.2MB in the end (delta: -82.2MB). Peak memory consumption was 138.3MB. Max. memory is 8.0GB. [2023-05-04 19:42:42,839 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 19:42:42,839 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.38ms. Allocated memory is still 187.7MB. Free memory was 130.7MB in the beginning and 150.9MB in the end (delta: -20.2MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. [2023-05-04 19:42:42,840 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.07ms. Allocated memory is still 187.7MB. Free memory was 150.9MB in the beginning and 148.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 19:42:42,840 INFO L158 Benchmark]: Boogie Preprocessor took 29.65ms. Allocated memory is still 187.7MB. Free memory was 148.8MB in the beginning and 147.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-05-04 19:42:42,840 INFO L158 Benchmark]: RCFGBuilder took 374.20ms. Allocated memory is still 187.7MB. Free memory was 147.1MB in the beginning and 127.9MB in the end (delta: 19.2MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-05-04 19:42:42,841 INFO L158 Benchmark]: TraceAbstraction took 221196.41ms. Allocated memory was 187.7MB in the beginning and 265.3MB in the end (delta: 77.6MB). Free memory was 126.6MB in the beginning and 213.2MB in the end (delta: -86.6MB). Peak memory consumption was 133.9MB. Max. memory is 8.0GB. [2023-05-04 19:42:42,841 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.09ms. Allocated memory is still 187.7MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 381.38ms. Allocated memory is still 187.7MB. Free memory was 130.7MB in the beginning and 150.9MB in the end (delta: -20.2MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.07ms. Allocated memory is still 187.7MB. Free memory was 150.9MB in the beginning and 148.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.65ms. Allocated memory is still 187.7MB. Free memory was 148.8MB in the beginning and 147.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 374.20ms. Allocated memory is still 187.7MB. Free memory was 147.1MB in the beginning and 127.9MB in the end (delta: 19.2MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 221196.41ms. Allocated memory was 187.7MB in the beginning and 265.3MB in the end (delta: 77.6MB). Free memory was 126.6MB in the beginning and 213.2MB in the end (delta: -86.6MB). Peak memory consumption was 133.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:333) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-05-04 19:42:42,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2023-05-04 19:42:43,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...