./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.tracecheck.mode.for.conditional.commutativity GENERATOR -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5bf99dd5722e6551de991a345b21615b777cf7cef3d452afb8b79773fd45d3d8 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.tracecheck.mode.for.conditional.commutativity GENERATOR -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-16 23:39:59,026 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-16 23:39:59,111 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-16 23:39:59,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-16 23:39:59,116 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-16 23:39:59,156 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-16 23:39:59,158 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-16 23:39:59,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-16 23:39:59,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-16 23:39:59,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-16 23:39:59,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-16 23:39:59,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-16 23:39:59,161 INFO L153 SettingsManager]: * Use SBE=true [2024-10-16 23:39:59,163 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-16 23:39:59,163 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-16 23:39:59,164 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-16 23:39:59,164 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-16 23:39:59,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-16 23:39:59,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-16 23:39:59,165 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-16 23:39:59,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-16 23:39:59,169 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-16 23:39:59,169 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-16 23:39:59,169 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-16 23:39:59,169 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-16 23:39:59,169 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-16 23:39:59,170 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-16 23:39:59,170 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-16 23:39:59,170 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-16 23:39:59,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-16 23:39:59,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-16 23:39:59,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-16 23:39:59,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-16 23:39:59,172 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-16 23:39:59,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-16 23:39:59,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-16 23:39:59,173 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-16 23:39:59,173 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-16 23:39:59,173 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-16 23:39:59,174 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-16 23:39:59,174 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-16 23:39:59,174 INFO L153 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/UGemCutter-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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5bf99dd5722e6551de991a345b21615b777cf7cef3d452afb8b79773fd45d3d8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> COUNTEREXAMPLE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: TraceCheck mode for conditional commutativity -> GENERATOR [2024-10-16 23:39:59,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-16 23:39:59,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-16 23:39:59,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-16 23:39:59,481 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-16 23:39:59,481 INFO L274 PluginConnector]: CDTParser initialized [2024-10-16 23:39:59,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i [2024-10-16 23:40:01,002 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-16 23:40:01,288 INFO L384 CDTParser]: Found 1 translation units. [2024-10-16 23:40:01,289 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i [2024-10-16 23:40:01,308 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fdaf30581/ebc956df91674d44ba4f12db89cb3a80/FLAGc82ab4ed9 [2024-10-16 23:40:01,326 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fdaf30581/ebc956df91674d44ba4f12db89cb3a80 [2024-10-16 23:40:01,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-16 23:40:01,330 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-16 23:40:01,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-16 23:40:01,334 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-16 23:40:01,340 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-16 23:40:01,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:40:01" (1/1) ... [2024-10-16 23:40:01,341 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7af79b9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:40:01, skipping insertion in model container [2024-10-16 23:40:01,342 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:40:01" (1/1) ... [2024-10-16 23:40:01,392 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-16 23:40:01,799 WARN L247 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[30869,30882] [2024-10-16 23:40:01,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-16 23:40:01,822 INFO L200 MainTranslator]: Completed pre-run [2024-10-16 23:40:01,885 WARN L247 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[30869,30882] [2024-10-16 23:40:01,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-16 23:40:01,933 INFO L204 MainTranslator]: Completed translation [2024-10-16 23:40:01,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:40:01 WrapperNode [2024-10-16 23:40:01,933 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-16 23:40:01,935 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-16 23:40:01,935 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-16 23:40:01,935 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-16 23:40:01,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:40:01" (1/1) ... [2024-10-16 23:40:01,975 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:40:01" (1/1) ... [2024-10-16 23:40:02,002 INFO L138 Inliner]: procedures = 172, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 103 [2024-10-16 23:40:02,005 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-16 23:40:02,006 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-16 23:40:02,006 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-16 23:40:02,006 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-16 23:40:02,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:40:01" (1/1) ... [2024-10-16 23:40:02,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:40:01" (1/1) ... [2024-10-16 23:40:02,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:40:01" (1/1) ... [2024-10-16 23:40:02,037 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:40:01" (1/1) ... [2024-10-16 23:40:02,043 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:40:01" (1/1) ... [2024-10-16 23:40:02,046 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:40:01" (1/1) ... [2024-10-16 23:40:02,048 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:40:01" (1/1) ... [2024-10-16 23:40:02,049 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:40:01" (1/1) ... [2024-10-16 23:40:02,052 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-16 23:40:02,052 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-16 23:40:02,053 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-16 23:40:02,053 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-16 23:40:02,054 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:40:01" (1/1) ... [2024-10-16 23:40:02,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-16 23:40:02,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:40:02,090 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-16 23:40:02,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-16 23:40:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-16 23:40:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-16 23:40:02,136 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-16 23:40:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-16 23:40:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-16 23:40:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-16 23:40:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-16 23:40:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-16 23:40:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-16 23:40:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-16 23:40:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-16 23:40:02,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-16 23:40:02,139 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-16 23:40:02,268 INFO L238 CfgBuilder]: Building ICFG [2024-10-16 23:40:02,270 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-16 23:40:02,430 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-16 23:40:02,431 INFO L287 CfgBuilder]: Performing block encoding [2024-10-16 23:40:02,570 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-16 23:40:02,571 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-16 23:40:02,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:40:02 BoogieIcfgContainer [2024-10-16 23:40:02,571 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-16 23:40:02,574 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-16 23:40:02,575 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-16 23:40:02,578 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-16 23:40:02,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:40:01" (1/3) ... [2024-10-16 23:40:02,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5215ac67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:40:02, skipping insertion in model container [2024-10-16 23:40:02,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:40:01" (2/3) ... [2024-10-16 23:40:02,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5215ac67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:40:02, skipping insertion in model container [2024-10-16 23:40:02,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:40:02" (3/3) ... [2024-10-16 23:40:02,581 INFO L112 eAbstractionObserver]: Analyzing ICFG 36_stack_cas_p0_vs_concur.i [2024-10-16 23:40:02,600 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-16 23:40:02,601 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-16 23:40:02,601 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-16 23:40:02,650 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-16 23:40:02,708 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-16 23:40:02,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-16 23:40:02,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:40:02,710 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-16 23:40:02,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-16 23:40:02,813 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-16 23:40:02,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:02,835 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-10-16 23:40:02,844 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@21daf431, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-16 23:40:02,845 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-16 23:40:03,499 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:40:03,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:03,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1639139020, now seen corresponding path program 1 times [2024-10-16 23:40:03,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:40:03,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192272910] [2024-10-16 23:40:03,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:03,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:40:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:40:04,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:40:04,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:40:04,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192272910] [2024-10-16 23:40:04,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192272910] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 23:40:04,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176725285] [2024-10-16 23:40:04,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:04,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:40:04,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:40:04,336 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-16 23:40:04,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-16 23:40:04,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:40:04,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-16 23:40:04,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 23:40:04,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-16 23:40:04,748 INFO L349 Elim1Store]: treesize reduction 70, result has 17.6 percent of original size [2024-10-16 23:40:04,748 INFO L378 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 35 treesize of output 25 [2024-10-16 23:40:04,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:40:04,826 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 23:40:05,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:40:05,104 INFO L378 Elim1Store]: Elim1 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 38 treesize of output 52 [2024-10-16 23:40:05,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:40:05,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2024-10-16 23:40:05,158 INFO L378 Elim1Store]: Elim1 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 70 treesize of output 58 [2024-10-16 23:40:05,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-16 23:40:05,173 INFO L378 Elim1Store]: Elim1 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 29 treesize of output 21 [2024-10-16 23:40:05,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:40:05,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176725285] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-16 23:40:05,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-16 23:40:05,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 17 [2024-10-16 23:40:05,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120267367] [2024-10-16 23:40:05,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-16 23:40:05,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-16 23:40:05,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:40:05,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-16 23:40:05,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=286, Unknown=2, NotChecked=0, Total=342 [2024-10-16 23:40:05,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:05,254 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:40:05,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:40:05,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:06,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-16 23:40:06,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-16 23:40:06,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-16 23:40:06,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-16 23:40:06,951 INFO L414 BasicCegarLoop]: Path program histogram: [1] [2024-10-16 23:40:06,952 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-10-16 23:40:06,955 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-16 23:40:06,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-16 23:40:06,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:40:06,958 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-16 23:40:06,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-10-16 23:40:06,993 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-16 23:40:06,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:06,994 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-16 23:40:06,995 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@21daf431, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-16 23:40:06,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-16 23:40:07,312 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-16 23:40:07,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:07,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1663913868, now seen corresponding path program 1 times [2024-10-16 23:40:07,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:40:07,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856919445] [2024-10-16 23:40:07,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:07,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:40:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:40:07,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:40:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:40:07,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-16 23:40:07,369 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-16 23:40:07,370 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-16 23:40:07,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-16 23:40:07,373 INFO L414 BasicCegarLoop]: Path program histogram: [1] [2024-10-16 23:40:07,373 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-10-16 23:40:07,374 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-16 23:40:07,374 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-16 23:40:07,394 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-16 23:40:07,396 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-16 23:40:07,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-16 23:40:07,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:40:07,398 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-16 23:40:07,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-10-16 23:40:07,439 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-16 23:40:07,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:07,440 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-16 23:40:07,441 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@21daf431, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-16 23:40:07,442 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-16 23:40:09,223 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-16 23:40:09,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:09,224 INFO L85 PathProgramCache]: Analyzing trace with hash -517477166, now seen corresponding path program 1 times [2024-10-16 23:40:09,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:40:09,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786107419] [2024-10-16 23:40:09,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:09,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:40:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:40:09,637 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:40:09,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:40:09,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786107419] [2024-10-16 23:40:09,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786107419] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 23:40:09,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889913976] [2024-10-16 23:40:09,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:09,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:40:09,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:40:09,643 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-16 23:40:09,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-16 23:40:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:40:09,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-16 23:40:09,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 23:40:09,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-16 23:40:09,980 INFO L349 Elim1Store]: treesize reduction 70, result has 17.6 percent of original size [2024-10-16 23:40:09,981 INFO L378 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 35 treesize of output 25 [2024-10-16 23:40:10,041 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:40:10,042 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 23:40:10,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:40:10,248 INFO L378 Elim1Store]: Elim1 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 38 treesize of output 52 [2024-10-16 23:40:10,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:40:10,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2024-10-16 23:40:10,289 INFO L378 Elim1Store]: Elim1 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 70 treesize of output 58 [2024-10-16 23:40:10,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-16 23:40:10,303 INFO L378 Elim1Store]: Elim1 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 29 treesize of output 21 [2024-10-16 23:40:10,345 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:40:10,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889913976] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-16 23:40:10,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-16 23:40:10,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 17 [2024-10-16 23:40:10,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135117250] [2024-10-16 23:40:10,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-16 23:40:10,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-16 23:40:10,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:40:10,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-16 23:40:10,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=250, Unknown=1, NotChecked=0, Total=306 [2024-10-16 23:40:10,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:10,349 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:40:10,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:40:10,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:10,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-16 23:40:10,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-16 23:40:11,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:40:11,074 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-16 23:40:11,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:11,074 INFO L85 PathProgramCache]: Analyzing trace with hash -488848015, now seen corresponding path program 1 times [2024-10-16 23:40:11,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:40:11,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083862218] [2024-10-16 23:40:11,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:11,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:40:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:40:11,105 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-16 23:40:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-16 23:40:11,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-16 23:40:11,132 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-16 23:40:11,133 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-16 23:40:11,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-16 23:40:11,135 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-16 23:40:11,135 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-10-16 23:40:11,136 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-16 23:40:11,136 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-16 23:40:11,164 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-16 23:40:11,169 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-16 23:40:11,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-16 23:40:11,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:40:11,171 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-16 23:40:11,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2024-10-16 23:40:11,218 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-16 23:40:11,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:11,219 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-10-16 23:40:11,219 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@21daf431, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-16 23:40:11,220 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-16 23:40:14,651 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:40:14,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:14,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1941716179, now seen corresponding path program 1 times [2024-10-16 23:40:14,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:40:14,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655331179] [2024-10-16 23:40:14,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:14,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:40:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:40:15,146 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-16 23:40:15,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:40:15,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655331179] [2024-10-16 23:40:15,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655331179] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 23:40:15,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582110599] [2024-10-16 23:40:15,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:15,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:40:15,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:40:15,150 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-16 23:40:15,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-16 23:40:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:40:15,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-16 23:40:15,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 23:40:15,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-16 23:40:15,553 INFO L349 Elim1Store]: treesize reduction 58, result has 31.8 percent of original size [2024-10-16 23:40:15,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 37 [2024-10-16 23:40:15,601 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:40:15,602 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 23:40:15,747 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-16 23:40:15,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582110599] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-16 23:40:15,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-16 23:40:15,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 8] total 19 [2024-10-16 23:40:15,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919632395] [2024-10-16 23:40:15,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 23:40:15,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-16 23:40:15,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:40:15,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-16 23:40:15,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=308, Unknown=2, NotChecked=0, Total=380 [2024-10-16 23:40:15,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:15,750 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:40:15,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:40:15,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:15,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-16 23:40:16,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-16 23:40:16,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:40:16,191 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:40:16,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:16,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1928291270, now seen corresponding path program 1 times [2024-10-16 23:40:16,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:40:16,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081929863] [2024-10-16 23:40:16,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:16,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:40:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:40:16,478 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-16 23:40:16,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:40:16,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081929863] [2024-10-16 23:40:16,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081929863] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 23:40:16,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271533530] [2024-10-16 23:40:16,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:16,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:40:16,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:40:16,482 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-16 23:40:16,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-16 23:40:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:40:16,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-16 23:40:16,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 23:40:16,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-10-16 23:40:16,675 INFO L378 Elim1Store]: Elim1 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 36 treesize of output 17 [2024-10-16 23:40:16,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-16 23:40:16,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-16 23:40:16,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-10-16 23:40:16,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-16 23:40:16,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-10-16 23:40:16,703 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-16 23:40:16,703 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-16 23:40:16,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271533530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 23:40:16,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-16 23:40:16,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-10-16 23:40:16,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010948753] [2024-10-16 23:40:16,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 23:40:16,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-16 23:40:16,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:40:16,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-16 23:40:16,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-16 23:40:16,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:16,706 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:40:16,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:40:16,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-16 23:40:16,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:17,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-16 23:40:17,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-16 23:40:17,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-16 23:40:17,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:40:17,786 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:40:17,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:17,786 INFO L85 PathProgramCache]: Analyzing trace with hash 377710808, now seen corresponding path program 1 times [2024-10-16 23:40:17,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:40:17,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079896042] [2024-10-16 23:40:17,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:17,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:40:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:40:18,211 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-16 23:40:18,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:40:18,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079896042] [2024-10-16 23:40:18,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079896042] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 23:40:18,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064866491] [2024-10-16 23:40:18,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:18,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:40:18,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:40:18,215 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-16 23:40:18,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-16 23:40:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:40:18,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-16 23:40:18,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 23:40:18,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-16 23:40:18,543 INFO L349 Elim1Store]: treesize reduction 70, result has 17.6 percent of original size [2024-10-16 23:40:18,543 INFO L378 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 35 treesize of output 25 [2024-10-16 23:40:18,587 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-16 23:40:18,587 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 23:40:18,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:40:18,771 INFO L378 Elim1Store]: Elim1 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 38 treesize of output 52 [2024-10-16 23:40:18,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:40:18,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2024-10-16 23:40:18,806 INFO L378 Elim1Store]: Elim1 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 70 treesize of output 58 [2024-10-16 23:40:18,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-16 23:40:18,819 INFO L378 Elim1Store]: Elim1 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 29 treesize of output 21 [2024-10-16 23:40:18,849 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-16 23:40:18,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064866491] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-16 23:40:18,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-16 23:40:18,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 17 [2024-10-16 23:40:18,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869769461] [2024-10-16 23:40:18,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-16 23:40:18,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-16 23:40:18,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:40:18,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-16 23:40:18,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=249, Unknown=2, NotChecked=0, Total=306 [2024-10-16 23:40:18,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:18,852 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:40:18,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 17 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:40:18,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-16 23:40:18,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-16 23:40:18,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:20,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-16 23:40:20,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-16 23:40:20,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-16 23:40:20,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-16 23:40:20,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:40:20,324 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:40:20,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:20,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1227092024, now seen corresponding path program 1 times [2024-10-16 23:40:20,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:40:20,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323456568] [2024-10-16 23:40:20,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:20,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:40:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:40:22,121 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:40:22,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:40:22,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323456568] [2024-10-16 23:40:22,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323456568] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 23:40:22,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451848186] [2024-10-16 23:40:22,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:22,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:40:22,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:40:22,123 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-16 23:40:22,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-16 23:40:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:40:22,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-16 23:40:22,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 23:40:22,362 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-16 23:40:22,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 13 [2024-10-16 23:40:22,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-16 23:40:22,486 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-16 23:40:22,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 [2024-10-16 23:40:22,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-16 23:40:22,651 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-10-16 23:40:22,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 29 [2024-10-16 23:40:22,817 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:40:22,818 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 23:40:22,853 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse2 |c_~#top~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_5 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_5) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (or (not .cse0) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |c_thr1Thread2of3ForFork0_push_#t~mem8#1|)))) (store .cse1 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| (store (select .cse1 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))) is different from false [2024-10-16 23:40:22,870 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse2 |c_~#top~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_5 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_5) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (or (not (= (select (select (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))))) (store .cse1 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| (store (select .cse1 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not .cse0))))) is different from false [2024-10-16 23:40:22,954 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (Array Int Int)) (|~#top~0.base| Int)) (not (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6))) (store .cse1 |~#top~0.base| (store (select .cse1 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse0 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| (store (select .cse0 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2024-10-16 23:40:23,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:40:23,100 INFO L378 Elim1Store]: Elim1 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 38 treesize of output 52 [2024-10-16 23:40:23,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:40:23,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2024-10-16 23:40:23,226 INFO L349 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2024-10-16 23:40:23,227 INFO L378 Elim1Store]: Elim1 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 1031 treesize of output 1002 [2024-10-16 23:40:23,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 357 treesize of output 341 [2024-10-16 23:40:23,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:40:23,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1256 treesize of output 1240 [2024-10-16 23:40:23,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 573 treesize of output 557 [2024-10-16 23:40:23,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-10-16 23:40:23,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-16 23:40:23,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-10-16 23:40:23,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-10-16 23:40:24,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:40:24,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 197 treesize of output 211 [2024-10-16 23:40:24,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:40:24,216 INFO L378 Elim1Store]: Elim1 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 33 treesize of output 49 [2024-10-16 23:40:24,285 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-10-16 23:40:24,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451848186] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-16 23:40:24,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-16 23:40:24,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 10, 10] total 40 [2024-10-16 23:40:24,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308342745] [2024-10-16 23:40:24,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-16 23:40:24,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-16 23:40:24,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:40:24,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-16 23:40:24,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1288, Unknown=3, NotChecked=222, Total=1640 [2024-10-16 23:40:24,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:24,289 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:40:24,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.658536585365854) internal successors, (150), 40 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:40:24,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-16 23:40:24,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-16 23:40:24,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-16 23:40:24,290 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:40:28,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-16 23:40:28,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-16 23:40:28,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-16 23:40:28,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-16 23:40:28,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-16 23:40:29,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-16 23:40:29,176 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 23:40:29,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 23:40:29,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2089286597, now seen corresponding path program 1 times [2024-10-16 23:40:29,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 23:40:29,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926865886] [2024-10-16 23:40:29,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:29,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 23:40:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:40:30,513 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 23:40:30,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 23:40:30,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926865886] [2024-10-16 23:40:30,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926865886] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-16 23:40:30,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494335752] [2024-10-16 23:40:30,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 23:40:30,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-16 23:40:30,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 23:40:30,516 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-16 23:40:30,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-16 23:40:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 23:40:30,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-16 23:40:30,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 23:40:30,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-16 23:40:30,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 [2024-10-16 23:40:30,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-16 23:40:30,904 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-16 23:40:30,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-16 23:40:30,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-16 23:40:31,136 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-16 23:40:31,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2024-10-16 23:40:31,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-10-16 23:40:31,411 INFO L349 Elim1Store]: treesize reduction 28, result has 52.5 percent of original size [2024-10-16 23:40:31,412 INFO L378 Elim1Store]: Elim1 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 35 treesize of output 53 [2024-10-16 23:40:32,293 INFO L349 Elim1Store]: treesize reduction 96, result has 44.5 percent of original size [2024-10-16 23:40:32,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 141 treesize of output 153 [2024-10-16 23:40:32,818 INFO L349 Elim1Store]: treesize reduction 124, result has 52.5 percent of original size [2024-10-16 23:40:32,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 177 treesize of output 225 [2024-10-16 23:40:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 17 proven. 26 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-16 23:40:42,537 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 23:40:44,911 WARN L851 $PredicateComparison]: unable to prove that (and (or (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (store .cse1 |c_~#top~0.base| (store (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse0 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse0 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (< 64 c_~next_alloc_idx~0) (= c_~next_alloc_idx~0 0)) (or (< c_~next_alloc_idx~0 65) (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_8 (Array Int Int))) (or (not (= (select (select (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8))) (store .cse3 |c_~#top~0.base| (store (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse3 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse2 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse2 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select v_DerPreprocessor_8 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0))))) is different from false [2024-10-16 23:40:45,044 WARN L851 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|) 0) (and (or (< c_~next_alloc_idx~0 65) (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_8 (Array Int Int))) (or (= (select v_DerPreprocessor_8 0) 0) (not (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8))) (store .cse1 |c_~#top~0.base| (store (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse1 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse0 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse0 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))) (or (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse3 |c_~#top~0.base| (store (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse3 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse2 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse2 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (< 64 c_~next_alloc_idx~0) (= c_~next_alloc_idx~0 0)))) is different from false [2024-10-16 23:40:45,234 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse9 (= |c_thr1Thread2of3ForFork0_push_~oldTop~0#1| (select .cse4 |c_~#top~0.offset|)))) (let ((.cse5 (not .cse9))) (and (or (< 64 c_~next_alloc_idx~0) (and (or (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread2of3ForFork0_push_#t~mem8#1| Int) (v_DerPreprocessor_9 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| |thr1Thread2of3ForFork0_push_#t~mem8#1|)) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_9))) (or (not (= (select (select (let ((.cse0 (let ((.cse1 (store (select .cse3 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0))) (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_9) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| .cse1) |c_~#top~0.base| (let ((.cse2 (store .cse3 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| .cse1))) (store (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse2 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))))) (store .cse0 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse0 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse3 |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) .cse5) (or (forall ((v_DerPreprocessor_10 (Array Int Int)) (|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse6 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_10))) (or (= 0 (select (select .cse6 |c_~#top~0.base|) |c_~#top~0.offset|)) (not (= (select (select (let ((.cse7 (let ((.cse8 (store .cse6 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select .cse6 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse8 |c_~#top~0.base| (store (select .cse8 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse8 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse7 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse7 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))) .cse9)) (= c_~next_alloc_idx~0 0)) (or (and (or .cse5 (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread2of3ForFork0_push_#t~mem8#1| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| |c_~#top~0.base| (store .cse4 |c_~#top~0.offset| |thr1Thread2of3ForFork0_push_#t~mem8#1|)) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_11))) (or (not (= (select (select (let ((.cse10 (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_11) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |c_~#top~0.base| (let ((.cse11 (store .cse12 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8))) (store (select .cse11 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse11 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse10 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse10 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select v_DerPreprocessor_8 0) 0) (= (select (select .cse12 |c_~#top~0.base|) |c_~#top~0.offset|) 0))))) (or (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_12))) (or (= (select (select .cse13 |c_~#top~0.base|) |c_~#top~0.offset|) 0) (= (select v_DerPreprocessor_8 0) 0) (not (= (select (select (let ((.cse14 (let ((.cse15 (store .cse13 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8))) (store .cse15 |c_~#top~0.base| (store (select .cse15 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse15 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse14 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse14 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))) .cse9)) (< c_~next_alloc_idx~0 65)))))) is different from false [2024-10-16 23:40:45,595 WARN L851 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0) (and (or (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread2of3ForFork0_push_#t~mem8#1| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (|~#top~0.base| Int) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |~#top~0.base| (store (select |c_#memory_int| |~#top~0.base|) |c_~#top~0.offset| |thr1Thread2of3ForFork0_push_#t~mem8#1|)) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_11))) (or (= (select v_DerPreprocessor_8 0) 0) (= (select (select .cse0 |~#top~0.base|) |c_~#top~0.offset|) 0) (not (= (select (select (let ((.cse1 (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_11) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |~#top~0.base| (let ((.cse2 (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8))) (store (select .cse2 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse2 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse1 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse1 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0))))) (< c_~next_alloc_idx~0 65)) (or (< 64 c_~next_alloc_idx~0) (= c_~next_alloc_idx~0 0) (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread2of3ForFork0_push_#t~mem8#1| Int) (v_DerPreprocessor_9 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (|~#top~0.base| Int)) (let ((.cse3 (store (store |c_#memory_int| |~#top~0.base| (store (select |c_#memory_int| |~#top~0.base|) |c_~#top~0.offset| |thr1Thread2of3ForFork0_push_#t~mem8#1|)) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_9))) (or (= (select (select .cse3 |~#top~0.base|) |c_~#top~0.offset|) 0) (not (= 0 (select (select (let ((.cse4 (let ((.cse5 (store (select .cse3 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0))) (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_9) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| .cse5) |~#top~0.base| (let ((.cse6 (store .cse3 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| .cse5))) (store (select .cse6 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse6 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))))) (store .cse4 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse4 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|))))))))) is different from false [2024-10-16 23:40:45,752 WARN L851 $PredicateComparison]: unable to prove that (and (or (< 64 c_~next_alloc_idx~0) (= c_~next_alloc_idx~0 0) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (and (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread2of3ForFork0_push_#t~mem8#1| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (|~#top~0.base| Int) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse3 (store (store .cse1 |~#top~0.base| (store (select .cse1 |~#top~0.base|) |c_~#top~0.offset| |thr1Thread2of3ForFork0_push_#t~mem8#1|)) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_11))) (or (not (= (select (select (let ((.cse0 (store (store (store .cse1 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_11) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |~#top~0.base| (let ((.cse2 (store .cse3 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8))) (store (select .cse2 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse2 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse0 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse0 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse3 |~#top~0.base|) |c_~#top~0.offset|) 0) (= (select v_DerPreprocessor_8 0) 0))))) (let ((.cse4 (+ c_~next_alloc_idx~0 2))) (or (< 62 c_~next_alloc_idx~0) (= .cse4 0) (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread2of3ForFork0_push_#t~mem8#1| Int) (v_DerPreprocessor_9 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (|~#top~0.base| Int)) (let ((.cse8 (store (store .cse1 |~#top~0.base| (store (select .cse1 |~#top~0.base|) |c_~#top~0.offset| |thr1Thread2of3ForFork0_push_#t~mem8#1|)) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_9))) (or (not (= (select (select (let ((.cse5 (let ((.cse6 (store (select .cse8 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) 0 .cse4))) (store (store (store .cse1 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_9) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| .cse6) |~#top~0.base| (let ((.cse7 (store .cse8 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| .cse6))) (store (select .cse7 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse7 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))))) (store .cse5 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse5 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse8 |~#top~0.base|) |c_~#top~0.offset|) 0))))))))) (or (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread2of3ForFork0_push_#t~mem8#1| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (|~#top~0.base| Int) (v_DerPreprocessor_8 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13))) (let ((.cse9 (store (store .cse11 |~#top~0.base| (store (select .cse11 |~#top~0.base|) |c_~#top~0.offset| |thr1Thread2of3ForFork0_push_#t~mem8#1|)) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_11))) (or (= (select (select .cse9 |~#top~0.base|) |c_~#top~0.offset|) 0) (= (select v_DerPreprocessor_8 0) 0) (not (= (select (select (let ((.cse10 (store (store (store .cse11 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_11) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |~#top~0.base| (let ((.cse12 (store .cse9 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8))) (store (select .cse12 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse12 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse10 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse10 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select v_DerPreprocessor_13 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (< c_~next_alloc_idx~0 65))) is different from false [2024-10-16 23:40:46,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:40:46,416 INFO L378 Elim1Store]: Elim1 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 33 treesize of output 49 [2024-10-16 23:40:47,102 INFO L349 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2024-10-16 23:40:47,104 INFO L378 Elim1Store]: Elim1 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 7667701 treesize of output 7505930 [2024-10-16 23:40:48,349 INFO L349 Elim1Store]: treesize reduction 274, result has 32.0 percent of original size [2024-10-16 23:40:48,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 29 case distinctions, treesize of input 2160783 treesize of output 2143665 [2024-10-16 23:40:49,976 INFO L349 Elim1Store]: treesize reduction 490, result has 27.1 percent of original size [2024-10-16 23:40:49,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 45 case distinctions, treesize of input 17472 treesize of output 17118 [2024-10-16 23:41:43,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:41:43,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 33733646442306 treesize of output 33648984416212 [2024-10-16 23:46:02,138 WARN L286 SmtUtils]: Spent 4.30m on a formula simplification. DAG size of input: 15311 DAG size of output: 1691 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-16 23:46:02,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:46:02,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 920915 treesize of output 893644 [2024-10-16 23:47:20,282 WARN L286 SmtUtils]: Spent 1.30m on a formula simplification. DAG size of input: 1676 DAG size of output: 1647 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-16 23:47:20,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:47:20,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 719475 treesize of output 719442 [2024-10-16 23:47:47,338 WARN L286 SmtUtils]: Spent 26.87s on a formula simplification. DAG size of input: 1635 DAG size of output: 1631 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-16 23:47:47,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 719145 treesize of output 719095 [2024-10-16 23:48:01,113 WARN L286 SmtUtils]: Spent 13.63s on a formula simplification. DAG size of input: 1614 DAG size of output: 1607 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-16 23:48:01,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:48:01,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 718527 treesize of output 718324 [2024-10-16 23:48:15,232 WARN L286 SmtUtils]: Spent 13.97s on a formula simplification. DAG size of input: 1591 DAG size of output: 1581 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-16 23:48:15,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 717051 treesize of output 716857 [2024-10-16 23:48:29,337 WARN L286 SmtUtils]: Spent 13.97s on a formula simplification. DAG size of input: 1561 DAG size of output: 1541 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-16 23:48:29,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 715902 treesize of output 715774 [2024-10-16 23:48:43,085 WARN L286 SmtUtils]: Spent 13.62s on a formula simplification. DAG size of input: 1526 DAG size of output: 1504 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-16 23:48:43,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:48:43,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 714032 treesize of output 713829 [2024-10-16 23:49:10,428 WARN L286 SmtUtils]: Spent 27.16s on a formula simplification. DAG size of input: 1488 DAG size of output: 1478 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-16 23:49:10,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 713624 treesize of output 713470 [2024-10-16 23:49:24,412 WARN L286 SmtUtils]: Spent 13.83s on a formula simplification. DAG size of input: 1465 DAG size of output: 1444 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-16 23:49:24,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 711718 treesize of output 711556 [2024-10-16 23:49:38,232 WARN L286 SmtUtils]: Spent 13.69s on a formula simplification. DAG size of input: 1429 DAG size of output: 1401 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-16 23:51:52,332 WARN L286 SmtUtils]: Spent 6.30s on a formula simplification. DAG size of input: 580 DAG size of output: 418 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-16 23:53:44,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 23:53:44,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2024-10-16 23:53:44,781 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 38 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-16 23:53:44,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494335752] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-16 23:53:44,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-16 23:53:44,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 46 [2024-10-16 23:53:44,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441364812] [2024-10-16 23:53:44,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-16 23:53:44,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-10-16 23:53:44,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 23:53:44,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-10-16 23:53:44,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1439, Unknown=11, NotChecked=410, Total=2070 [2024-10-16 23:53:44,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 23:53:44,785 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 23:53:44,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 4.239130434782608) internal successors, (195), 46 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-16 23:53:44,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-16 23:53:44,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-16 23:53:44,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-16 23:53:44,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-10-16 23:53:44,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Killed by 15