./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 IA --traceabstraction.criterion.for.conditional.commutativity.checking LOOP -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 IA --traceabstraction.criterion.for.conditional.commutativity.checking LOOP -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-18 14:56:40,500 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-18 14:56:40,568 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-18 14:56:40,575 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-18 14:56:40,575 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-18 14:56:40,594 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-18 14:56:40,595 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-18 14:56:40,595 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-18 14:56:40,596 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-18 14:56:40,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-18 14:56:40,598 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-18 14:56:40,598 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-18 14:56:40,598 INFO L153 SettingsManager]: * Use SBE=true [2024-10-18 14:56:40,598 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-18 14:56:40,599 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-18 14:56:40,601 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-18 14:56:40,601 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-18 14:56:40,601 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-18 14:56:40,601 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-18 14:56:40,601 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-18 14:56:40,602 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-18 14:56:40,602 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-18 14:56:40,602 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-18 14:56:40,602 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-18 14:56:40,602 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-18 14:56:40,602 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-18 14:56:40,603 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-18 14:56:40,603 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-18 14:56:40,603 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-18 14:56:40,603 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-18 14:56:40,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 14:56:40,603 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-18 14:56:40,603 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-18 14:56:40,604 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-18 14:56:40,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-18 14:56:40,604 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-18 14:56:40,604 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-18 14:56:40,604 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-18 14:56:40,604 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-18 14:56:40,604 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-18 14:56:40,604 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-18 14:56:40,606 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 -> IA Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> LOOP [2024-10-18 14:56:40,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-18 14:56:40,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-18 14:56:40,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-18 14:56:40,829 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-18 14:56:40,829 INFO L274 PluginConnector]: CDTParser initialized [2024-10-18 14:56:40,830 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-18 14:56:42,014 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-18 14:56:42,184 INFO L384 CDTParser]: Found 1 translation units. [2024-10-18 14:56:42,185 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i [2024-10-18 14:56:42,193 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/875d49b6a/fe54627451644859b74590292fb12915/FLAGe8e0cf89d [2024-10-18 14:56:42,203 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/875d49b6a/fe54627451644859b74590292fb12915 [2024-10-18 14:56:42,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-18 14:56:42,206 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-18 14:56:42,207 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-18 14:56:42,207 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-18 14:56:42,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-18 14:56:42,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 02:56:42" (1/1) ... [2024-10-18 14:56:42,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3384fee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:56:42, skipping insertion in model container [2024-10-18 14:56:42,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 02:56:42" (1/1) ... [2024-10-18 14:56:42,240 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-18 14:56:42,545 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-18 14:56:42,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 14:56:42,561 INFO L200 MainTranslator]: Completed pre-run [2024-10-18 14:56:42,593 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-18 14:56:42,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 14:56:42,624 INFO L204 MainTranslator]: Completed translation [2024-10-18 14:56:42,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:56:42 WrapperNode [2024-10-18 14:56:42,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-18 14:56:42,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-18 14:56:42,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-18 14:56:42,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-18 14:56:42,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:56:42" (1/1) ... [2024-10-18 14:56:42,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:56:42" (1/1) ... [2024-10-18 14:56:42,669 INFO L138 Inliner]: procedures = 172, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 103 [2024-10-18 14:56:42,672 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-18 14:56:42,674 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-18 14:56:42,674 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-18 14:56:42,674 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-18 14:56:42,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:56:42" (1/1) ... [2024-10-18 14:56:42,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:56:42" (1/1) ... [2024-10-18 14:56:42,682 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:56:42" (1/1) ... [2024-10-18 14:56:42,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:56:42" (1/1) ... [2024-10-18 14:56:42,689 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:56:42" (1/1) ... [2024-10-18 14:56:42,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:56:42" (1/1) ... [2024-10-18 14:56:42,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:56:42" (1/1) ... [2024-10-18 14:56:42,693 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:56:42" (1/1) ... [2024-10-18 14:56:42,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-18 14:56:42,695 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-18 14:56:42,695 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-18 14:56:42,695 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-18 14:56:42,696 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:56:42" (1/1) ... [2024-10-18 14:56:42,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 14:56:42,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:56:42,726 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-18 14:56:42,734 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-18 14:56:42,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-18 14:56:42,768 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-18 14:56:42,768 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-18 14:56:42,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-18 14:56:42,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-18 14:56:42,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-18 14:56:42,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-18 14:56:42,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-18 14:56:42,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-18 14:56:42,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-18 14:56:42,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-18 14:56:42,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-18 14:56:42,771 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-18 14:56:42,880 INFO L238 CfgBuilder]: Building ICFG [2024-10-18 14:56:42,882 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-18 14:56:43,051 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-18 14:56:43,052 INFO L287 CfgBuilder]: Performing block encoding [2024-10-18 14:56:43,155 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-18 14:56:43,155 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-18 14:56:43,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 02:56:43 BoogieIcfgContainer [2024-10-18 14:56:43,155 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-18 14:56:43,159 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-18 14:56:43,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-18 14:56:43,161 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-18 14:56:43,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.10 02:56:42" (1/3) ... [2024-10-18 14:56:43,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d826f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 02:56:43, skipping insertion in model container [2024-10-18 14:56:43,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 02:56:42" (2/3) ... [2024-10-18 14:56:43,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d826f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 02:56:43, skipping insertion in model container [2024-10-18 14:56:43,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 02:56:43" (3/3) ... [2024-10-18 14:56:43,163 INFO L112 eAbstractionObserver]: Analyzing ICFG 36_stack_cas_p0_vs_concur.i [2024-10-18 14:56:43,175 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-18 14:56:43,175 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-18 14:56:43,175 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-18 14:56:43,210 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-18 14:56:43,246 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 14:56:43,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 14:56:43,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:56:43,249 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-18 14:56:43,250 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-18 14:56:43,326 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 14:56:43,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:56:43,341 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-10-18 14:56:43,346 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;@7452432, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 14:56:43,346 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 14:56:43,809 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 14:56:43,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:56:43,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1639139020, now seen corresponding path program 1 times [2024-10-18 14:56:43,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:56:43,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953645727] [2024-10-18 14:56:43,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:56:43,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:56:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:56:44,439 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-18 14:56:44,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:56:44,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953645727] [2024-10-18 14:56:44,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953645727] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 14:56:44,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356886054] [2024-10-18 14:56:44,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:56:44,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 14:56:44,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:56:44,444 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-18 14:56:44,445 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-18 14:56:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:56:44,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-18 14:56:44,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:56:44,577 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-18 14:56:44,725 INFO L349 Elim1Store]: treesize reduction 70, result has 17.6 percent of original size [2024-10-18 14:56:44,725 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-18 14:56:44,784 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-18 14:56:44,786 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 14:56:45,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 14:56:45,008 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-18 14:56:45,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 14:56:45,020 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-18 14:56:45,048 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-18 14:56:45,051 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-18 14:56:45,058 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-18 14:56:45,091 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-18 14:56:45,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356886054] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 14:56:45,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 14:56:45,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 17 [2024-10-18 14:56:45,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194918436] [2024-10-18 14:56:45,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 14:56:45,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-18 14:56:45,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:56:45,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-18 14:56:45,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=286, Unknown=2, NotChecked=0, Total=342 [2024-10-18 14:56:45,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:56:45,127 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:56:45,128 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-18 14:56:45,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:56:46,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-18 14:56:46,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-18 14:56:46,278 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-18 14:56:46,465 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-18 14:56:46,475 INFO L414 BasicCegarLoop]: Path program histogram: [1] [2024-10-18 14:56:46,476 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-10-18 14:56:46,478 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 14:56:46,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 14:56:46,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:56:46,479 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-18 14:56:46,481 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-18 14:56:46,510 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 14:56:46,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:56:46,511 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 14:56:46,512 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;@7452432, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 14:56:46,512 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 14:56:46,735 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 14:56:46,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:56:46,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1663913868, now seen corresponding path program 1 times [2024-10-18 14:56:46,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:56:46,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330361980] [2024-10-18 14:56:46,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:56:46,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:56:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:56:46,745 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:56:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:56:46,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 14:56:46,772 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 14:56:46,772 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-18 14:56:46,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-18 14:56:46,775 INFO L414 BasicCegarLoop]: Path program histogram: [1] [2024-10-18 14:56:46,777 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-10-18 14:56:46,778 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 14:56:46,778 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-18 14:56:46,794 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-18 14:56:46,796 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 14:56:46,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 14:56:46,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:56:46,797 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-18 14:56:46,799 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-18 14:56:46,837 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 14:56:46,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:56:46,838 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 14:56:46,839 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;@7452432, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 14:56:46,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 14:56:48,225 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 14:56:48,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:56:48,226 INFO L85 PathProgramCache]: Analyzing trace with hash -517477166, now seen corresponding path program 1 times [2024-10-18 14:56:48,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:56:48,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279632184] [2024-10-18 14:56:48,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:56:48,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:56:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:56:48,551 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-18 14:56:48,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:56:48,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279632184] [2024-10-18 14:56:48,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279632184] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 14:56:48,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997668432] [2024-10-18 14:56:48,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:56:48,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 14:56:48,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:56:48,556 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-18 14:56:48,557 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-18 14:56:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:56:48,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-18 14:56:48,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:56:48,668 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-18 14:56:48,773 INFO L349 Elim1Store]: treesize reduction 70, result has 17.6 percent of original size [2024-10-18 14:56:48,773 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-18 14:56:48,817 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-18 14:56:48,818 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 14:56:48,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 14:56:48,963 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-18 14:56:48,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 14:56:48,972 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-18 14:56:48,993 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-18 14:56:48,999 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-18 14:56:49,003 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-18 14:56:49,032 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-18 14:56:49,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997668432] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 14:56:49,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 14:56:49,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 17 [2024-10-18 14:56:49,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466183601] [2024-10-18 14:56:49,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 14:56:49,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-18 14:56:49,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:56:49,295 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-18 14:56:49,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 112 [2024-10-18 14:56:49,332 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:56:49,333 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:56:49,335 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:56:49,336 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:56:49,344 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-10-18 14:56:49,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4553 treesize of output 1 [2024-10-18 14:56:49,347 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:56:49,347 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:56:49,348 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:56:49,348 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:56:49,353 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-18 14:56:49,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2024-10-18 14:56:51,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1637898230, now seen corresponding path program 1 times [2024-10-18 14:56:51,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:56:51,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:56:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:56:51,479 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:56:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:56:51,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-18 14:56:51,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=250, Unknown=1, NotChecked=0, Total=306 [2024-10-18 14:56:51,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:56:51,503 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:56:51,503 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-18 14:56:51,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:56:51,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-18 14:56:51,951 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-18 14:56:52,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 14:56:52,138 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 14:56:52,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:56:52,139 INFO L85 PathProgramCache]: Analyzing trace with hash -488848015, now seen corresponding path program 1 times [2024-10-18 14:56:52,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:56:52,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957447482] [2024-10-18 14:56:52,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:56:52,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:56:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:56:52,167 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:56:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:56:52,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-18 14:56:52,187 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 14:56:52,187 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-18 14:56:52,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-18 14:56:52,189 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-18 14:56:52,189 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-10-18 14:56:52,189 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 14:56:52,189 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-18 14:56:52,212 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-18 14:56:52,214 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 14:56:52,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 14:56:52,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:56:52,216 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-18 14:56:52,217 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-18 14:56:52,258 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 14:56:52,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:56:52,259 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-10-18 14:56:52,260 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;@7452432, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 14:56:52,260 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 14:56:54,943 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 14:56:54,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:56:54,943 INFO L85 PathProgramCache]: Analyzing trace with hash -921853997, now seen corresponding path program 1 times [2024-10-18 14:56:54,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:56:54,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136942637] [2024-10-18 14:56:54,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:56:54,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:56:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:56:55,239 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-18 14:56:55,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:56:55,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136942637] [2024-10-18 14:56:55,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136942637] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 14:56:55,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660967900] [2024-10-18 14:56:55,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:56:55,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 14:56:55,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:56:55,242 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-18 14:56:55,243 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-18 14:56:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:56:55,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-18 14:56:55,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:56:55,447 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-18 14:56:55,539 INFO L349 Elim1Store]: treesize reduction 58, result has 31.8 percent of original size [2024-10-18 14:56:55,539 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-18 14:56:55,600 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-18 14:56:55,600 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 14:56:57,753 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-18 14:56:57,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660967900] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-18 14:56:57,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-18 14:56:57,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 8] total 19 [2024-10-18 14:56:57,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821582228] [2024-10-18 14:56:57,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 14:56:57,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-18 14:56:57,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:56:57,982 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-10-18 14:56:57,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5882 treesize of output 5654 [2024-10-18 14:56:58,062 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:56:58,062 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:56:58,064 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:56:58,064 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:56:58,066 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:56:58,070 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:56:58,074 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:56:58,075 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:56:58,078 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-18 14:56:58,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2024-10-18 14:56:58,362 INFO L85 PathProgramCache]: Analyzing trace with hash -976882281, now seen corresponding path program 1 times [2024-10-18 14:56:58,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:56:58,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:56:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:56:58,376 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:56:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:56:58,639 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-10-18 14:56:58,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 13844 treesize of output 13182 [2024-10-18 14:56:58,724 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:56:58,724 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:56:58,728 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:56:58,728 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:56:58,729 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:56:58,729 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:56:59,635 INFO L85 PathProgramCache]: Analyzing trace with hash -327369694, now seen corresponding path program 1 times [2024-10-18 14:56:59,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:56:59,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:56:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:56:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 14:56:59,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:56:59,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:56:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:56:59,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 14:56:59,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-18 14:56:59,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=296, Unknown=3, NotChecked=0, Total=342 [2024-10-18 14:56:59,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:56:59,987 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:56:59,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-18 14:56:59,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:57:01,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-18 14:57:01,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-18 14:57:01,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5 [2024-10-18 14:57:01,314 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 14:57:01,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:57:01,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1776021351, now seen corresponding path program 1 times [2024-10-18 14:57:01,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:57:01,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564302536] [2024-10-18 14:57:01,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:57:01,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:57:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:57:01,886 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-18 14:57:01,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:57:01,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564302536] [2024-10-18 14:57:01,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564302536] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 14:57:01,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833202918] [2024-10-18 14:57:01,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:57:01,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 14:57:01,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:57:01,889 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-18 14:57:01,890 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-18 14:57:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:57:02,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-18 14:57:02,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:57:02,080 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-18 14:57:02,081 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-18 14:57:02,107 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-18 14:57:02,184 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 14:57:02,184 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-18 14:57:02,217 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-18 14:57:02,343 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-10-18 14:57:02,343 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-18 14:57:02,461 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-18 14:57:02,461 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 14:57:02,635 WARN L851 $PredicateComparison]: unable to prove that (and (or (forall ((v_DerPreprocessor_5 (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_5))) (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))) (< 64 c_~next_alloc_idx~0)) (or (< c_~next_alloc_idx~0 65) (forall ((v_DerPreprocessor_6 (Array Int Int)) (|~#top~0.base| Int)) (not (= (select (select (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6))) (store .cse3 |~#top~0.base| (store (select .cse3 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse3 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse2 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| (store (select .cse2 |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-18 14:57:02,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 14:57:02,821 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-18 14:57:02,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 14:57:02,828 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-18 14:57:03,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 14:57:03,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 21739 treesize of output 21393 [2024-10-18 14:57:03,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 1906 treesize of output 1890 [2024-10-18 14:57:03,197 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 1870 treesize of output 1854 [2024-10-18 14:57:03,230 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 1814 treesize of output 1750 [2024-10-18 14:57:03,266 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 1670 treesize of output 1606 [2024-10-18 14:57:05,223 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 109 treesize of output 105 [2024-10-18 14:57:05,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 14:57:05,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 535 treesize of output 797 [2024-10-18 14:57:05,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 14:57:05,850 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-18 14:57:05,899 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-18 14:57:05,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833202918] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 14:57:05,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 14:57:05,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 29 [2024-10-18 14:57:05,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851916331] [2024-10-18 14:57:05,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 14:57:05,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-18 14:57:05,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 14:57:06,162 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-18 14:57:06,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 71 [2024-10-18 14:57:06,188 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:57:06,189 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:57:06,190 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:57:06,190 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:57:06,193 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-18 14:57:06,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2024-10-18 14:57:06,196 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:57:06,196 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:57:06,198 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:57:06,199 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:57:06,205 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-10-18 14:57:06,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4661 treesize of output 1 [2024-10-18 14:57:06,484 INFO L85 PathProgramCache]: Analyzing trace with hash -976882233, now seen corresponding path program 1 times [2024-10-18 14:57:06,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:57:06,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:57:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:57:06,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:57:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:57:06,785 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-18 14:57:06,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 72 [2024-10-18 14:57:06,829 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:57:06,830 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:57:06,832 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:57:06,832 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:57:06,839 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-10-18 14:57:06,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3284 treesize of output 1 [2024-10-18 14:57:06,841 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:57:06,842 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:57:06,843 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:57:06,844 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 14:57:06,847 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-18 14:57:06,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2024-10-18 14:57:06,944 INFO L85 PathProgramCache]: Analyzing trace with hash -2116355082, now seen corresponding path program 1 times [2024-10-18 14:57:06,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:57:06,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:57:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:57:06,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 14:57:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 14:57:07,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-18 14:57:07,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=701, Unknown=12, NotChecked=54, Total=870 [2024-10-18 14:57:07,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:57:07,012 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 14:57:07,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.233333333333333) internal successors, (127), 29 states have internal predecessors, (127), 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-18 14:57:07,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-18 14:57:07,012 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 14:57:10,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 14:57:10,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-18 14:57:10,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-18 14:57:10,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-18 14:57:10,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable9,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 14:57:10,873 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 14:57:10,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 14:57:10,873 INFO L85 PathProgramCache]: Analyzing trace with hash 445065779, now seen corresponding path program 1 times [2024-10-18 14:57:10,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-18 14:57:10,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514117489] [2024-10-18 14:57:10,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:57:10,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 14:57:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:57:11,823 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 14:57:11,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-18 14:57:11,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514117489] [2024-10-18 14:57:11,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514117489] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-18 14:57:11,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528897305] [2024-10-18 14:57:11,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 14:57:11,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-18 14:57:11,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 14:57:11,824 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-18 14:57:11,825 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-18 14:57:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 14:57:11,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-18 14:57:11,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 14:57:12,026 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-18 14:57:12,031 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-18 14:57:12,053 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-18 14:57:12,094 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-18 14:57:12,095 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-18 14:57:12,118 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-18 14:57:12,247 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-18 14:57:12,247 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 1 case distinctions, treesize of input 31 treesize of output 23 [2024-10-18 14:57:12,251 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 10 [2024-10-18 14:57:12,261 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 26 treesize of output 19 [2024-10-18 14:57:12,463 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-10-18 14:57:12,463 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 59 treesize of output 62 [2024-10-18 14:57:13,209 INFO L349 Elim1Store]: treesize reduction 140, result has 40.7 percent of original size [2024-10-18 14:57:13,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 179 treesize of output 182 [2024-10-18 14:57:13,808 INFO L349 Elim1Store]: treesize reduction 155, result has 55.2 percent of original size [2024-10-18 14:57:13,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 219 treesize of output 293 [2024-10-18 14:58:28,845 WARN L286 SmtUtils]: Spent 8.93s on a formula simplification. DAG size of input: 2649 DAG size of output: 2747 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-18 14:59:54,673 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-18 14:59:54,673 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 14:59:59,158 WARN L851 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|) 0) (and (or (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int))) (or (not (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9))) (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)) (= (select v_DerPreprocessor_9 0) 0))) (< c_~next_alloc_idx~0 65)) (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-18 15:00:00,193 WARN L851 $PredicateComparison]: unable to prove that (or (and (or (and (forall ((|~#top~0.base| Int)) (or (= |~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |~#top~0.base| v_DerPreprocessor_11) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_12))) (or (= (select (select .cse0 |~#top~0.base|) |c_~#top~0.offset|) 0) (not (= (select (select (let ((.cse1 (let ((.cse2 (store (select .cse0 |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_12) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| .cse2) |~#top~0.base| (let ((.cse3 (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| .cse2))) (store (select .cse3 |~#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 .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))))))) (forall ((v_DerPreprocessor_10 (Array Int Int)) (|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (|~#top~0.base| Int)) (let ((.cse4 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_10))) (or (= (select (select .cse4 |~#top~0.base|) |c_~#top~0.offset|) 0) (not (= (select (select (let ((.cse5 (let ((.cse6 (store .cse4 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select .cse4 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) 0 c_~next_alloc_idx~0)))) (store .cse6 |~#top~0.base| (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 .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)))))) (< 64 c_~next_alloc_idx~0) (= c_~next_alloc_idx~0 0)) (or (and (forall ((|~#top~0.base| Int)) (or (= |~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |~#top~0.base| v_DerPreprocessor_16) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_17))) (or (= (select (select .cse7 |~#top~0.base|) |c_~#top~0.offset|) 0) (= (select v_DerPreprocessor_9 0) 0) (not (= (select (select (let ((.cse8 (store (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_17) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9) |~#top~0.base| (let ((.cse9 (store .cse7 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9))) (store (select .cse9 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse9 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse8 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse8 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0))))))) (forall ((v_DerPreprocessor_9 (Array Int Int)) (|~#top~0.base| Int)) (or (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (v_DerPreprocessor_15 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse10 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_15))) (or (= (select (select .cse10 |~#top~0.base|) |c_~#top~0.offset|) 0) (not (= (select (select (let ((.cse11 (let ((.cse12 (store .cse10 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9))) (store .cse12 |~#top~0.base| (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 .cse11 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse11 |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_9 0) 0)))) (< c_~next_alloc_idx~0 65))) (= (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0)) is different from false [2024-10-18 15:00:00,429 WARN L851 $PredicateComparison]: unable to prove that (and (or (and (forall ((v_DerPreprocessor_18 (Array Int Int))) (or (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (|~#top~0.base| Int) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_18))) (let ((.cse0 (store (store .cse2 |~#top~0.base| v_DerPreprocessor_16) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_17))) (or (= |~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) (= (select (select .cse0 |~#top~0.base|) |c_~#top~0.offset|) 0) (= (select v_DerPreprocessor_9 0) 0) (not (= (select (select (let ((.cse1 (store (store (store .cse2 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_17) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9) |~#top~0.base| (let ((.cse3 (store .cse0 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9))) (store (select .cse3 |~#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 .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)))))) (= (select v_DerPreprocessor_18 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0))) (forall ((v_DerPreprocessor_18 (Array Int Int))) (or (= (select v_DerPreprocessor_18 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0) (forall ((v_prenex_112 Int) (v_prenex_110 Int) (v_DerPreprocessor_15 (Array Int Int)) (v_prenex_111 (Array Int Int)) (v_prenex_109 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_18) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_15))) (or (not (= (select (select (let ((.cse4 (let ((.cse5 (store .cse6 v_prenex_110 v_prenex_111))) (store .cse5 v_prenex_112 (store (select .cse5 v_prenex_112) |c_~#top~0.offset| (select (select .cse5 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse4 v_prenex_109 (store (select .cse4 v_prenex_109) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) v_prenex_112) |c_~#top~0.offset|) 0)) (= (select (select .cse6 v_prenex_112) |c_~#top~0.offset|) 0) (= (select v_prenex_111 0) 0))))))) (< c_~next_alloc_idx~0 65)) (or (let ((.cse8 (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) (and (forall ((|~#top~0.base| Int)) (or (= |~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (let ((.cse10 (store (store .cse8 |~#top~0.base| v_DerPreprocessor_16) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_17))) (or (not (= (select (select (let ((.cse7 (store (store (store .cse8 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_17) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9) |~#top~0.base| (let ((.cse9 (store .cse10 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9))) (store (select .cse9 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse9 |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))) |~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse10 |~#top~0.base|) |c_~#top~0.offset|) 0) (= (select v_DerPreprocessor_9 0) 0)))))) (forall ((v_DerPreprocessor_9 (Array Int Int)) (|~#top~0.base| Int)) (or (= (select v_DerPreprocessor_9 0) 0) (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (v_DerPreprocessor_15 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse11 (store .cse8 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_15))) (or (= (select (select .cse11 |~#top~0.base|) |c_~#top~0.offset|) 0) (not (= (select (select (let ((.cse12 (let ((.cse13 (store .cse11 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9))) (store .cse13 |~#top~0.base| (store (select .cse13 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse13 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse12 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse12 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0))))))))) (let ((.cse17 (+ c_~next_alloc_idx~0 2))) (or (< 62 c_~next_alloc_idx~0) (and (forall ((v_DerPreprocessor_10 (Array Int Int)) (|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (|~#top~0.base| Int)) (let ((.cse14 (store .cse8 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_10))) (or (= (select (select .cse14 |~#top~0.base|) |c_~#top~0.offset|) 0) (not (= (select (select (let ((.cse15 (let ((.cse16 (store .cse14 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select .cse14 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) 0 .cse17)))) (store .cse16 |~#top~0.base| (store (select .cse16 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse16 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse15 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse15 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0))))) (forall ((|~#top~0.base| Int)) (or (= |~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse18 (store (store .cse8 |~#top~0.base| v_DerPreprocessor_11) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_12))) (or (= (select (select .cse18 |~#top~0.base|) |c_~#top~0.offset|) 0) (not (= (select (select (let ((.cse19 (let ((.cse20 (store (select .cse18 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) 0 .cse17))) (store (store (store .cse8 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_12) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| .cse20) |~#top~0.base| (let ((.cse21 (store .cse18 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| .cse20))) (store (select .cse21 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse21 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))))) (store .cse19 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse19 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0)))))))) (= .cse17 0))))) (< 64 c_~next_alloc_idx~0) (= c_~next_alloc_idx~0 0))) is different from false [2024-10-18 15:00:01,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 15:00:01,710 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-18 15:00:05,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 15:00:05,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 298828756 treesize of output 297677268 [2024-10-18 15:00:12,294 WARN L286 SmtUtils]: Spent 6.98s on a formula simplification. DAG size of input: 14494 DAG size of output: 439 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-18 15:00:12,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 15:00:12,318 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 28029 treesize of output 27005 [2024-10-18 15:00:12,770 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 20668 treesize of output 19898 [2024-10-18 15:00:13,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 15:00:13,084 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 12272 treesize of output 12146 [2024-10-18 15:00:13,391 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 10087 treesize of output 10085 [2024-10-18 15:00:13,808 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 8825 treesize of output 8823 [2024-10-18 15:00:14,840 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 15:00:14,846 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 15:00:14,945 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 4399100 treesize of output 4390908 [2024-10-18 15:00:15,161 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-18 15:00:15,162 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 3372 treesize of output 3245 [2024-10-18 15:00:15,262 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 15:00:15,265 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 1964 treesize of output 1898 [2024-10-18 15:00:15,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 15:00:15,456 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 97 [2024-10-18 15:00:15,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 15:00:15,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92486 treesize of output 88842 [2024-10-18 15:00:15,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 15:00:15,745 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 2024 treesize of output 1966 [2024-10-18 15:00:15,795 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 1618 treesize of output 1568 [2024-10-18 15:00:16,044 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 8 treesize of output 6 [2024-10-18 15:00:16,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 15:00:16,053 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 23 treesize of output 27 [2024-10-18 15:00:16,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 15:00:16,064 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 112 [2024-10-18 15:00:16,066 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 15:00:16,068 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 15:00:16,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 15:00:16,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3818 treesize of output 3740 [2024-10-18 15:00:16,129 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-18 15:00:16,130 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 900 treesize of output 871 [2024-10-18 15:00:16,168 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 15:00:16,170 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 598 treesize of output 580 [2024-10-18 15:00:16,247 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 8 treesize of output 6 [2024-10-18 15:00:16,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 15:00:16,257 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 157 [2024-10-18 15:00:16,495 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2024-10-18 15:00:16,496 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 133038 treesize of output 126058 [2024-10-18 15:00:16,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 15:00:16,880 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 3896 treesize of output 3774 [2024-10-18 15:00:17,560 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 8 treesize of output 6 [2024-10-18 15:00:17,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 15:00:17,569 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 23 treesize of output 27 [2024-10-18 15:00:17,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 15:00:17,579 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 310 treesize of output 190 [2024-10-18 15:00:17,581 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 15:00:17,585 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 15:00:17,643 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-10-18 15:00:17,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 158598 treesize of output 153364 [2024-10-18 15:00:17,859 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-18 15:00:17,859 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 1656 treesize of output 1593 [2024-10-18 15:00:18,017 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 8 treesize of output 6 [2024-10-18 15:00:18,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 15:00:18,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 889320 treesize of output 883308 [2024-10-18 15:00:19,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 15:00:19,035 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 7241 treesize of output 7117 [2024-10-18 15:00:19,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 15:00:19,155 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 6335 treesize of output 6083 [2024-10-18 15:00:19,305 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 4484 treesize of output 4322 [2024-10-18 15:00:19,437 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 2436 treesize of output 2434 [2024-10-18 15:00:19,693 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 15:00:19,695 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 15:00:19,709 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 26444 treesize of output 26316 [2024-10-18 15:00:19,790 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-18 15:00:19,790 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 1588 treesize of output 1537 [2024-10-18 15:00:19,837 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 15:00:19,839 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 896 treesize of output 862 [2024-10-18 15:00:20,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 15:00:20,206 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-18 15:00:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-18 15:00:20,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528897305] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 15:00:20,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-18 15:00:20,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 48 [2024-10-18 15:00:20,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835672921] [2024-10-18 15:00:20,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-18 15:00:20,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-18 15:00:20,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-18 15:00:20,550 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-10-18 15:00:20,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 9416 treesize of output 8946 [2024-10-18 15:00:20,612 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 15:00:20,612 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 15:00:20,615 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 15:00:20,615 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 15:00:20,616 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 15:00:20,616 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 15:00:20,712 INFO L85 PathProgramCache]: Analyzing trace with hash -976882201, now seen corresponding path program 1 times [2024-10-18 15:00:20,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 15:00:20,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 15:00:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 15:00:20,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 15:00:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 15:00:21,041 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-10-18 15:00:21,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 14724 treesize of output 13962 [2024-10-18 15:00:21,105 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 15:00:21,106 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 15:00:21,107 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 15:00:21,107 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 15:00:21,110 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 15:00:21,110 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 15:00:21,200 INFO L85 PathProgramCache]: Analyzing trace with hash -2116355050, now seen corresponding path program 1 times [2024-10-18 15:00:21,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 15:00:21,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 15:00:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 15:00:21,226 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 15:00:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 15:00:21,493 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-10-18 15:00:21,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5882 treesize of output 5654 [2024-10-18 15:00:21,566 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 15:00:21,567 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 15:00:21,569 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 15:00:21,569 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 15:00:21,571 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 15:00:21,572 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-18 15:00:21,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1714062360, now seen corresponding path program 1 times [2024-10-18 15:00:21,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 15:00:21,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 15:00:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 15:00:21,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 15:00:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 15:00:21,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-18 15:00:21,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1769, Unknown=48, NotChecked=270, Total=2352 [2024-10-18 15:00:21,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 15:00:21,749 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 15:00:21,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.020408163265306) internal successors, (148), 48 states have internal predecessors, (148), 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-18 15:00:21,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-18 15:00:21,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-10-18 15:00:21,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 15:00:29,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 15:00:35,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 15:00:37,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 15:00:39,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 15:00:58,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-18 15:00:58,908 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse25 (+ c_~next_alloc_idx~0 2))) (let ((.cse2 (= |c_~#top~0.offset| 0)) (.cse1 (not (= (select |c_#valid| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) 0))) (.cse6 (< c_~next_alloc_idx~0 65)) (.cse0 (< c_~next_alloc_idx~0 63)) (.cse3 (< 62 c_~next_alloc_idx~0)) (.cse4 (= .cse25 0)) (.cse5 (< 64 c_~next_alloc_idx~0))) (and (or (and (or .cse0 (and .cse1 (or .cse2 (forall ((v_prenex_189 Int)) (not (= 0 (select |c_#valid| v_prenex_189))))))) (or .cse3 (and (or (and (or .cse2 (forall ((v_prenex_174 Int)) (not (= (select |c_#valid| v_prenex_174) 0)))) .cse1) (< c_~next_alloc_idx~0 61)) (or (< 60 c_~next_alloc_idx~0) (= (+ c_~next_alloc_idx~0 4) 0) (and (or (forall ((v_prenex_178 Int)) (not (= (select |c_#valid| v_prenex_178) 0))) .cse2) .cse1))) .cse4)) .cse5) .cse2 (or (and (or (forall ((|~#top~0.base| Int)) (not (= (select |c_#valid| |~#top~0.base|) 0))) .cse2) .cse1) .cse6) (let ((.cse7 (select (select |c_#memory_int| |c_~#top~0.base|) 0))) (or (= .cse7 1) (and (exists ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int)) (= 1 (select (select |c_#memory_int| |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) 0))) (not (= .cse7 0))))) (or (and (forall ((v_DerPreprocessor_18 (Array Int Int))) (or (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (|~#top~0.base| Int) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_18))) (let ((.cse8 (store (store .cse10 |~#top~0.base| v_DerPreprocessor_16) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_17))) (or (= |~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) (= (select (select .cse8 |~#top~0.base|) |c_~#top~0.offset|) 0) (= (select v_DerPreprocessor_9 0) 0) (not (= (select (select (let ((.cse9 (store (store (store .cse10 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_17) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9) |~#top~0.base| (let ((.cse11 (store .cse8 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9))) (store (select .cse11 |~#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 .cse9 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse9 |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_18 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0))) (forall ((v_DerPreprocessor_18 (Array Int Int))) (or (= (select v_DerPreprocessor_18 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0) (forall ((v_prenex_112 Int) (v_prenex_110 Int) (v_DerPreprocessor_15 (Array Int Int)) (v_prenex_111 (Array Int Int)) (v_prenex_109 Int)) (let ((.cse14 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_18) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_15))) (or (not (= (select (select (let ((.cse12 (let ((.cse13 (store .cse14 v_prenex_110 v_prenex_111))) (store .cse13 v_prenex_112 (store (select .cse13 v_prenex_112) |c_~#top~0.offset| (select (select .cse13 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse12 v_prenex_109 (store (select .cse12 v_prenex_109) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) v_prenex_112) |c_~#top~0.offset|) 0)) (= (select (select .cse14 v_prenex_112) |c_~#top~0.offset|) 0) (= (select v_prenex_111 0) 0))))))) .cse6) (or (let ((.cse16 (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 .cse0 (and (forall ((|~#top~0.base| Int)) (or (= |~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (let ((.cse18 (store (store .cse16 |~#top~0.base| v_DerPreprocessor_16) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_17))) (or (not (= (select (select (let ((.cse15 (store (store (store .cse16 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_17) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9) |~#top~0.base| (let ((.cse17 (store .cse18 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9))) (store (select .cse17 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse17 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse15 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse15 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0)) (= (select (select .cse18 |~#top~0.base|) |c_~#top~0.offset|) 0) (= (select v_DerPreprocessor_9 0) 0)))))) (forall ((v_DerPreprocessor_9 (Array Int Int)) (|~#top~0.base| Int)) (or (= (select v_DerPreprocessor_9 0) 0) (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (v_DerPreprocessor_15 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int)) (let ((.cse19 (store .cse16 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_15))) (or (= (select (select .cse19 |~#top~0.base|) |c_~#top~0.offset|) 0) (not (= (select (select (let ((.cse20 (let ((.cse21 (store .cse19 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9))) (store .cse21 |~#top~0.base| (store (select .cse21 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse21 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse20 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse20 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0))))))))) (or .cse3 (and (forall ((v_DerPreprocessor_10 (Array Int Int)) (|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (|~#top~0.base| Int)) (let ((.cse22 (store .cse16 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_10))) (or (= (select (select .cse22 |~#top~0.base|) |c_~#top~0.offset|) 0) (not (= (select (select (let ((.cse23 (let ((.cse24 (store .cse22 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select .cse22 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) 0 .cse25)))) (store .cse24 |~#top~0.base| (store (select .cse24 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse24 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse23 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse23 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0))))) (forall ((|~#top~0.base| Int)) (or (= |~#top~0.base| |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base|) (forall ((|thr1Thread1of3ForFork0_push_~#ret~0#1.base| Int) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse26 (store (store .cse16 |~#top~0.base| v_DerPreprocessor_11) |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_12))) (or (= (select (select .cse26 |~#top~0.base|) |c_~#top~0.offset|) 0) (not (= (select (select (let ((.cse27 (let ((.cse28 (store (select .cse26 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) 0 .cse25))) (store (store (store .cse16 |c_thr1Thread2of3ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_12) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| .cse28) |~#top~0.base| (let ((.cse29 (store .cse26 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| .cse28))) (store (select .cse29 |~#top~0.base|) |c_~#top~0.offset| (select (select .cse29 |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))))))) (store .cse27 |thr1Thread1of3ForFork0_push_~#ret~0#1.base| (store (select .cse27 |thr1Thread1of3ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#ret~0#1.offset| 1))) |~#top~0.base|) |c_~#top~0.offset|) 0)))))))) .cse4))) .cse5 (= c_~next_alloc_idx~0 0))))) is different from false [2024-10-18 15:01:13,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-18 15:01:13,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 139 [2024-10-18 15:01:13,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-18 15:01:13,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15 [2024-10-18 15:01:13,375 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkValidity(IncrementalHoareTripleChecker.java:680) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:145) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:460) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:104) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:196) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:169) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at java.base/java.lang.Iterable.spliterator(Iterable.java:101) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:235) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$BasicTraversal.traverse(PartialOrderReductionFacade.java:345) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$PersistentSetTraversal.traverse(PartialOrderReductionFacade.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$SleepSetTraversal.traverse(PartialOrderReductionFacade.java:380) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$StatefulOrderTraversal.traverse(PartialOrderReductionFacade.java:362) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:442) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 58 more [2024-10-18 15:01:13,378 INFO L158 Benchmark]: Toolchain (without parser) took 271171.79ms. Allocated memory was 167.8MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 102.4MB in the beginning and 827.5MB in the end (delta: -725.1MB). Peak memory consumption was 987.5MB. Max. memory is 16.1GB. [2024-10-18 15:01:13,378 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 96.5MB. Free memory is still 51.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-18 15:01:13,378 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.41ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 125.9MB in the end (delta: -23.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-18 15:01:13,378 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.15ms. Allocated memory is still 167.8MB. Free memory was 125.9MB in the beginning and 123.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-18 15:01:13,378 INFO L158 Benchmark]: Boogie Preprocessor took 20.67ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 122.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-18 15:01:13,378 INFO L158 Benchmark]: RCFGBuilder took 460.28ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 94.4MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-18 15:01:13,378 INFO L158 Benchmark]: TraceAbstraction took 270218.87ms. Allocated memory was 167.8MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 92.8MB in the beginning and 827.5MB in the end (delta: -734.6MB). Peak memory consumption was 980.5MB. Max. memory is 16.1GB. [2024-10-18 15:01:13,379 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 96.5MB. Free memory is still 51.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 418.41ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 125.9MB in the end (delta: -23.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.15ms. Allocated memory is still 167.8MB. Free memory was 125.9MB in the beginning and 123.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.67ms. Allocated memory is still 167.8MB. Free memory was 123.8MB in the beginning and 122.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 460.28ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 94.4MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 270218.87ms. Allocated memory was 167.8MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 92.8MB in the beginning and 827.5MB in the end (delta: -734.6MB). Peak memory consumption was 980.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 528, independent: 481, independent conditional: 220, independent unconditional: 261, dependent: 47, dependent conditional: 35, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 493, independent: 481, independent conditional: 220, independent unconditional: 261, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 493, independent: 481, independent conditional: 220, independent unconditional: 261, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 493, independent: 481, independent conditional: 220, independent unconditional: 261, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 505, independent: 481, independent conditional: 220, independent unconditional: 261, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 505, independent: 481, independent conditional: 4, independent unconditional: 477, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 505, independent: 481, independent conditional: 4, independent unconditional: 477, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 183, independent: 171, independent conditional: 0, independent unconditional: 171, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 183, independent: 165, independent conditional: 0, independent unconditional: 165, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 18, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 828, independent: 294, independent conditional: 0, independent unconditional: 294, dependent: 534, dependent conditional: 0, dependent unconditional: 534, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 505, independent: 310, independent conditional: 4, independent unconditional: 306, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 183, unknown conditional: 0, unknown unconditional: 183] , Statistics on independence cache: Total cache size (in pairs): 183, Positive cache size: 171, Positive conditional cache size: 0, Positive unconditional cache size: 171, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 216, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 505, independent: 481, independent conditional: 220, independent unconditional: 261, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 505, independent: 481, independent conditional: 4, independent unconditional: 477, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 505, independent: 481, independent conditional: 4, independent unconditional: 477, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 183, independent: 171, independent conditional: 0, independent unconditional: 171, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 183, independent: 165, independent conditional: 0, independent unconditional: 165, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 18, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 828, independent: 294, independent conditional: 0, independent unconditional: 294, dependent: 534, dependent conditional: 0, dependent unconditional: 534, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 505, independent: 310, independent conditional: 4, independent unconditional: 306, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 183, unknown conditional: 0, unknown unconditional: 183] , Statistics on independence cache: Total cache size (in pairs): 183, Positive cache size: 171, Positive conditional cache size: 0, Positive unconditional cache size: 171, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 216 ], Independence queries for same thread: 35, Persistent sets #1 benchmarks: Persistent set computation time: 0.9s, Number of persistent set computation: 55, Number of trivial persistent sets: 53, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 273, independent: 261, independent conditional: 0, independent unconditional: 261, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 528, independent: 481, independent conditional: 220, independent unconditional: 261, dependent: 47, dependent conditional: 35, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 493, independent: 481, independent conditional: 220, independent unconditional: 261, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 493, independent: 481, independent conditional: 220, independent unconditional: 261, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 493, independent: 481, independent conditional: 220, independent unconditional: 261, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 505, independent: 481, independent conditional: 220, independent unconditional: 261, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 505, independent: 481, independent conditional: 4, independent unconditional: 477, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 505, independent: 481, independent conditional: 4, independent unconditional: 477, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 183, independent: 171, independent conditional: 0, independent unconditional: 171, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 183, independent: 165, independent conditional: 0, independent unconditional: 165, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 18, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 828, independent: 294, independent conditional: 0, independent unconditional: 294, dependent: 534, dependent conditional: 0, dependent unconditional: 534, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 505, independent: 310, independent conditional: 4, independent unconditional: 306, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 183, unknown conditional: 0, unknown unconditional: 183] , Statistics on independence cache: Total cache size (in pairs): 183, Positive cache size: 171, Positive conditional cache size: 0, Positive unconditional cache size: 171, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 216, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 505, independent: 481, independent conditional: 220, independent unconditional: 261, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 505, independent: 481, independent conditional: 4, independent unconditional: 477, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 505, independent: 481, independent conditional: 4, independent unconditional: 477, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 183, independent: 171, independent conditional: 0, independent unconditional: 171, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 183, independent: 165, independent conditional: 0, independent unconditional: 165, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 18, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 828, independent: 294, independent conditional: 0, independent unconditional: 294, dependent: 534, dependent conditional: 0, dependent unconditional: 534, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 505, independent: 310, independent conditional: 4, independent unconditional: 306, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 183, unknown conditional: 0, unknown unconditional: 183] , Statistics on independence cache: Total cache size (in pairs): 183, Positive cache size: 171, Positive conditional cache size: 0, Positive unconditional cache size: 171, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 216 ], Independence queries for same thread: 35 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 164, independent: 157, independent conditional: 12, independent unconditional: 145, dependent: 7, dependent conditional: 4, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 160, independent: 157, independent conditional: 12, independent unconditional: 145, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 160, independent: 157, independent conditional: 12, independent unconditional: 145, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 160, independent: 157, independent conditional: 12, independent unconditional: 145, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 163, independent: 157, independent conditional: 12, independent unconditional: 145, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 163, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 163, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 213, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 163, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 101, Positive conditional cache size: 0, Positive unconditional cache size: 101, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 163, independent: 157, independent conditional: 12, independent unconditional: 145, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 163, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 163, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 213, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 163, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 101, Positive conditional cache size: 0, Positive unconditional cache size: 101, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12 ], Independence queries for same thread: 4, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 10, Number of trivial persistent sets: 8, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 148, independent: 145, independent conditional: 0, independent unconditional: 145, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 164, independent: 157, independent conditional: 12, independent unconditional: 145, dependent: 7, dependent conditional: 4, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 160, independent: 157, independent conditional: 12, independent unconditional: 145, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 160, independent: 157, independent conditional: 12, independent unconditional: 145, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 160, independent: 157, independent conditional: 12, independent unconditional: 145, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 163, independent: 157, independent conditional: 12, independent unconditional: 145, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 163, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 163, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 213, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 163, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 101, Positive conditional cache size: 0, Positive unconditional cache size: 101, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 163, independent: 157, independent conditional: 12, independent unconditional: 145, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 163, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 163, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 213, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 163, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 101, Positive conditional cache size: 0, Positive unconditional cache size: 101, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12 ], Independence queries for same thread: 4 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 904, independent: 856, independent conditional: 238, independent unconditional: 618, dependent: 48, dependent conditional: 26, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 881, independent: 856, independent conditional: 238, independent unconditional: 618, dependent: 25, dependent conditional: 3, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 881, independent: 856, independent conditional: 238, independent unconditional: 618, dependent: 25, dependent conditional: 3, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 881, independent: 856, independent conditional: 238, independent unconditional: 618, dependent: 25, dependent conditional: 3, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 907, independent: 856, independent conditional: 238, independent unconditional: 618, dependent: 51, dependent conditional: 7, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 907, independent: 856, independent conditional: 28, independent unconditional: 828, dependent: 51, dependent conditional: 1, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 907, independent: 856, independent conditional: 28, independent unconditional: 828, dependent: 51, dependent conditional: 1, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 495, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 23, dependent conditional: 1, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 495, independent: 458, independent conditional: 0, independent unconditional: 458, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 37, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 23, dependent conditional: 1, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 37, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 23, dependent conditional: 1, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1509, independent: 460, independent conditional: 0, independent unconditional: 460, dependent: 1049, dependent conditional: 58, dependent unconditional: 991, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 907, independent: 384, independent conditional: 28, independent unconditional: 356, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 495, unknown conditional: 1, unknown unconditional: 494] , Statistics on independence cache: Total cache size (in pairs): 495, Positive cache size: 472, Positive conditional cache size: 0, Positive unconditional cache size: 472, Negative cache size: 23, Negative conditional cache size: 1, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 216, Maximal queried relation: 1, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 907, independent: 856, independent conditional: 238, independent unconditional: 618, dependent: 51, dependent conditional: 7, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 907, independent: 856, independent conditional: 28, independent unconditional: 828, dependent: 51, dependent conditional: 1, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 907, independent: 856, independent conditional: 28, independent unconditional: 828, dependent: 51, dependent conditional: 1, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 495, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 23, dependent conditional: 1, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 495, independent: 458, independent conditional: 0, independent unconditional: 458, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 37, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 23, dependent conditional: 1, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 37, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 23, dependent conditional: 1, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1509, independent: 460, independent conditional: 0, independent unconditional: 460, dependent: 1049, dependent conditional: 58, dependent unconditional: 991, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 907, independent: 384, independent conditional: 28, independent unconditional: 356, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 495, unknown conditional: 1, unknown unconditional: 494] , Statistics on independence cache: Total cache size (in pairs): 495, Positive cache size: 472, Positive conditional cache size: 0, Positive unconditional cache size: 472, Negative cache size: 23, Negative conditional cache size: 1, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 216 ], Independence queries for same thread: 23, Persistent sets #1 benchmarks: Persistent set computation time: 1.5s, Number of persistent set computation: 30, Number of trivial persistent sets: 24, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 640, independent: 618, independent conditional: 0, independent unconditional: 618, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 904, independent: 856, independent conditional: 238, independent unconditional: 618, dependent: 48, dependent conditional: 26, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 881, independent: 856, independent conditional: 238, independent unconditional: 618, dependent: 25, dependent conditional: 3, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 881, independent: 856, independent conditional: 238, independent unconditional: 618, dependent: 25, dependent conditional: 3, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 881, independent: 856, independent conditional: 238, independent unconditional: 618, dependent: 25, dependent conditional: 3, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 907, independent: 856, independent conditional: 238, independent unconditional: 618, dependent: 51, dependent conditional: 7, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 907, independent: 856, independent conditional: 28, independent unconditional: 828, dependent: 51, dependent conditional: 1, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 907, independent: 856, independent conditional: 28, independent unconditional: 828, dependent: 51, dependent conditional: 1, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 495, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 23, dependent conditional: 1, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 495, independent: 458, independent conditional: 0, independent unconditional: 458, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 37, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 23, dependent conditional: 1, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 37, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 23, dependent conditional: 1, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1509, independent: 460, independent conditional: 0, independent unconditional: 460, dependent: 1049, dependent conditional: 58, dependent unconditional: 991, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 907, independent: 384, independent conditional: 28, independent unconditional: 356, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 495, unknown conditional: 1, unknown unconditional: 494] , Statistics on independence cache: Total cache size (in pairs): 495, Positive cache size: 472, Positive conditional cache size: 0, Positive unconditional cache size: 472, Negative cache size: 23, Negative conditional cache size: 1, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 216, Maximal queried relation: 1, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 907, independent: 856, independent conditional: 238, independent unconditional: 618, dependent: 51, dependent conditional: 7, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 907, independent: 856, independent conditional: 28, independent unconditional: 828, dependent: 51, dependent conditional: 1, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 907, independent: 856, independent conditional: 28, independent unconditional: 828, dependent: 51, dependent conditional: 1, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 495, independent: 472, independent conditional: 0, independent unconditional: 472, dependent: 23, dependent conditional: 1, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 495, independent: 458, independent conditional: 0, independent unconditional: 458, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 37, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 23, dependent conditional: 1, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 37, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 23, dependent conditional: 1, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1509, independent: 460, independent conditional: 0, independent unconditional: 460, dependent: 1049, dependent conditional: 58, dependent unconditional: 991, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 907, independent: 384, independent conditional: 28, independent unconditional: 356, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 495, unknown conditional: 1, unknown unconditional: 494] , Statistics on independence cache: Total cache size (in pairs): 495, Positive cache size: 472, Positive conditional cache size: 0, Positive unconditional cache size: 472, Negative cache size: 23, Negative conditional cache size: 1, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 216 ], Independence queries for same thread: 23 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-18 15:01:13,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Ended with exit code 0 [2024-10-18 15:01:13,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Ended with exit code 0 [2024-10-18 15:01:13,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2024-10-18 15:01:14,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_Bitvector.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 IA --traceabstraction.criterion.for.conditional.commutativity.checking LOOP -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-18 15:01:15,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-18 15:01:15,929 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2024-10-18 15:01:15,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-18 15:01:15,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-18 15:01:15,953 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-18 15:01:15,953 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-18 15:01:15,954 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-18 15:01:15,955 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-18 15:01:15,956 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-18 15:01:15,956 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-18 15:01:15,957 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-18 15:01:15,957 INFO L153 SettingsManager]: * Use SBE=true [2024-10-18 15:01:15,959 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-18 15:01:15,959 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-18 15:01:15,959 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-18 15:01:15,959 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-18 15:01:15,960 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-18 15:01:15,960 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-18 15:01:15,960 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-18 15:01:15,960 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-18 15:01:15,963 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-18 15:01:15,963 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-18 15:01:15,963 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-18 15:01:15,963 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-18 15:01:15,963 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-18 15:01:15,964 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-18 15:01:15,964 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-18 15:01:15,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-18 15:01:15,964 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-18 15:01:15,964 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-18 15:01:15,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 15:01:15,965 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-18 15:01:15,965 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-18 15:01:15,965 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-18 15:01:15,965 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-18 15:01:15,965 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-18 15:01:15,966 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-18 15:01:15,966 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-18 15:01:15,966 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-18 15:01:15,967 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-18 15:01:15,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-18 15:01:15,968 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-18 15:01:15,968 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 -> IA Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> LOOP [2024-10-18 15:01:16,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-18 15:01:16,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-18 15:01:16,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-18 15:01:16,245 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-18 15:01:16,245 INFO L274 PluginConnector]: CDTParser initialized [2024-10-18 15:01:16,246 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-18 15:01:17,512 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-18 15:01:17,716 INFO L384 CDTParser]: Found 1 translation units. [2024-10-18 15:01:17,717 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i [2024-10-18 15:01:17,728 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7f8e93fd2/2482b224a48c46acb47b3c91347794a9/FLAGc76296ca7 [2024-10-18 15:01:17,738 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7f8e93fd2/2482b224a48c46acb47b3c91347794a9 [2024-10-18 15:01:17,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-18 15:01:17,741 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-18 15:01:17,742 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-18 15:01:17,742 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-18 15:01:17,746 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-18 15:01:17,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 03:01:17" (1/1) ... [2024-10-18 15:01:17,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25d21c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:01:17, skipping insertion in model container [2024-10-18 15:01:17,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.10 03:01:17" (1/1) ... [2024-10-18 15:01:17,789 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-18 15:01:18,055 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-18 15:01:18,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 15:01:18,072 INFO L200 MainTranslator]: Completed pre-run [2024-10-18 15:01:18,109 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-18 15:01:18,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-18 15:01:18,145 INFO L204 MainTranslator]: Completed translation [2024-10-18 15:01:18,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:01:18 WrapperNode [2024-10-18 15:01:18,146 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-18 15:01:18,147 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-18 15:01:18,147 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-18 15:01:18,147 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-18 15:01:18,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:01:18" (1/1) ... [2024-10-18 15:01:18,169 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:01:18" (1/1) ... [2024-10-18 15:01:18,194 INFO L138 Inliner]: procedures = 176, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 104 [2024-10-18 15:01:18,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-18 15:01:18,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-18 15:01:18,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-18 15:01:18,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-18 15:01:18,202 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:01:18" (1/1) ... [2024-10-18 15:01:18,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:01:18" (1/1) ... [2024-10-18 15:01:18,207 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:01:18" (1/1) ... [2024-10-18 15:01:18,207 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:01:18" (1/1) ... [2024-10-18 15:01:18,219 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:01:18" (1/1) ... [2024-10-18 15:01:18,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:01:18" (1/1) ... [2024-10-18 15:01:18,229 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:01:18" (1/1) ... [2024-10-18 15:01:18,233 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:01:18" (1/1) ... [2024-10-18 15:01:18,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-18 15:01:18,236 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-18 15:01:18,236 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-18 15:01:18,236 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-18 15:01:18,241 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:01:18" (1/1) ... [2024-10-18 15:01:18,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-18 15:01:18,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 15:01:18,269 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-18 15:01:18,271 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-18 15:01:18,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-10-18 15:01:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-18 15:01:18,307 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-18 15:01:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-18 15:01:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-18 15:01:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-18 15:01:18,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-18 15:01:18,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-10-18 15:01:18,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-10-18 15:01:18,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-10-18 15:01:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-18 15:01:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-18 15:01:18,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-18 15:01:18,310 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-18 15:01:18,415 INFO L238 CfgBuilder]: Building ICFG [2024-10-18 15:01:18,416 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-18 15:01:18,602 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-18 15:01:18,602 INFO L287 CfgBuilder]: Performing block encoding [2024-10-18 15:01:18,748 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-18 15:01:18,748 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-18 15:01:18,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 03:01:18 BoogieIcfgContainer [2024-10-18 15:01:18,749 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-18 15:01:18,751 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-18 15:01:18,751 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-18 15:01:18,754 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-18 15:01:18,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.10 03:01:17" (1/3) ... [2024-10-18 15:01:18,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4075ef9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 03:01:18, skipping insertion in model container [2024-10-18 15:01:18,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.10 03:01:18" (2/3) ... [2024-10-18 15:01:18,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4075ef9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.10 03:01:18, skipping insertion in model container [2024-10-18 15:01:18,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.10 03:01:18" (3/3) ... [2024-10-18 15:01:18,757 INFO L112 eAbstractionObserver]: Analyzing ICFG 36_stack_cas_p0_vs_concur.i [2024-10-18 15:01:18,770 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-18 15:01:18,771 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-18 15:01:18,771 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-18 15:01:18,805 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-18 15:01:18,840 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 15:01:18,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 15:01:18,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 15:01:18,843 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-18 15:01:18,844 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-18 15:01:18,915 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 15:01:18,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 15:01:18,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-10-18 15:01:18,947 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;@2b06fc38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 15:01:18,948 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 15:01:19,475 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 15:01:19,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 15:01:19,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1740536692, now seen corresponding path program 1 times [2024-10-18 15:01:19,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 15:01:19,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978453714] [2024-10-18 15:01:19,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 15:01:19,487 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-18 15:01:19,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 15:01:19,504 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-18 15:01:19,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-18 15:01:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 15:01:19,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-18 15:01:19,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 15:01:19,703 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-18 15:01:19,914 INFO L349 Elim1Store]: treesize reduction 70, result has 17.6 percent of original size [2024-10-18 15:01:19,914 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-18 15:01:19,989 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-18 15:01:19,989 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 15:01:20,066 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse2 |c_~#top~0.offset|)))) (and (or .cse0 (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_1) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))))) (or (not .cse0) (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32))) (not (= (_ bv0 32) (select (select (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_#t~mem8#1|)))) (store .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| (_ bv1 32)))) |c_~#top~0.base|) |c_~#top~0.offset|)))))))) is different from false [2024-10-18 15:01:20,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 15:01:20,240 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 43 treesize of output 57 [2024-10-18 15:01:20,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 15:01:20,258 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-18 15:01:20,332 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 73 treesize of output 61 [2024-10-18 15:01:20,365 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-18 15:01:20,371 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 32 treesize of output 24 [2024-10-18 15:01:20,419 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-18 15:01:20,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 15:01:20,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978453714] [2024-10-18 15:01:20,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [978453714] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 15:01:20,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-18 15:01:20,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 11 [2024-10-18 15:01:20,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360741530] [2024-10-18 15:01:20,424 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-18 15:01:20,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-18 15:01:20,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 15:01:20,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-18 15:01:20,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=102, Unknown=2, NotChecked=20, Total=156 [2024-10-18 15:01:20,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 15:01:20,453 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 15:01:20,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 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-18 15:01:20,454 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 15:01:21,038 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse4 (select .cse2 |c_~#top~0.offset|))) (let ((.cse3 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| .cse4))) (let ((.cse0 (not .cse3))) (and (or .cse0 (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32))) (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_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (store .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| (_ bv1 32)))) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))))) (or .cse3 (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_1) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))))) (not (= (_ bv0 32) .cse4)) (or .cse0 (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32))) (not (= (_ bv0 32) (select (select (let ((.cse5 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_#t~mem8#1|)))) (store .cse5 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse5 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| (_ bv1 32)))) |c_~#top~0.base|) |c_~#top~0.offset|)))))))))) is different from false [2024-10-18 15:01:21,082 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse3 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse2 |c_~#top~0.offset|)))) (let ((.cse0 (not .cse3))) (and (or .cse0 (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32))) (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_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (store .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse1 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| (_ bv1 32)))) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))))) (or .cse3 (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_1) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))))) (or .cse0 (forall ((|thr1Thread1of1ForFork0_push_~#ret~0#1.base| (_ BitVec 32))) (not (= (_ bv0 32) (select (select (let ((.cse4 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_#t~mem8#1|)))) (store .cse4 |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select .cse4 |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| (_ bv1 32)))) |c_~#top~0.base|) |c_~#top~0.offset|))))))))) is different from false [2024-10-18 15:01:21,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-18 15:01:21,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-18 15:01:21,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-18 15:01:21,357 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-18 15:01:21,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 15:01:21,358 INFO L85 PathProgramCache]: Analyzing trace with hash -204529729, now seen corresponding path program 1 times [2024-10-18 15:01:21,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 15:01:21,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258435600] [2024-10-18 15:01:21,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 15:01:21,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-18 15:01:21,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 15:01:21,362 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-18 15:01:21,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-18 15:01:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 15:01:21,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-18 15:01:21,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 15:01:21,456 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-18 15:01:21,466 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 1 [2024-10-18 15:01:21,476 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 18 treesize of output 7 [2024-10-18 15:01:21,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-18 15:01:21,482 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-18 15:01:21,500 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-18 15:01:21,501 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-18 15:01:21,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 15:01:21,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1258435600] [2024-10-18 15:01:21,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1258435600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-18 15:01:21,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-18 15:01:21,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-18 15:01:21,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438785961] [2024-10-18 15:01:21,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-18 15:01:21,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-18 15:01:21,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 15:01:21,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-18 15:01:21,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-18 15:01:21,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-18 15:01:21,505 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-18 15:01:21,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-18 15:01:21,505 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-10-18 15:01:21,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-18 15:01:22,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-18 15:01:22,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-18 15:01:22,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-18 15:01:22,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-18 15:01:22,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-18 15:01:22,309 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-18 15:01:22,310 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-10-18 15:01:22,312 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 15:01:22,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 15:01:22,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 15:01:22,313 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-18 15:01:22,315 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-18 15:01:22,346 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 15:01:22,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 15:01:22,347 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 15:01:22,347 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;@2b06fc38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 15:01:22,347 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 15:01:22,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 15:01:22,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 15:01:22,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1319194420, now seen corresponding path program 1 times [2024-10-18 15:01:22,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 15:01:22,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358743503] [2024-10-18 15:01:22,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 15:01:22,684 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-18 15:01:22,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 15:01:22,687 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-18 15:01:22,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-18 15:01:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 15:01:22,734 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-18 15:01:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-18 15:01:22,768 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-18 15:01:22,768 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-18 15:01:22,768 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-18 15:01:22,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-18 15:01:22,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-18 15:01:22,970 INFO L414 BasicCegarLoop]: Path program histogram: [1] [2024-10-18 15:01:22,971 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-10-18 15:01:22,971 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-18 15:01:22,971 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-18 15:01:23,012 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-18 15:01:23,014 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-18 15:01:23,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-18 15:01:23,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-18 15:01:23,016 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-18 15:01:23,018 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-18 15:01:23,055 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-18 15:01:23,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 15:01:23,056 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-18 15:01:23,056 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;@2b06fc38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-18 15:01:23,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-18 15:01:25,347 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-18 15:01:25,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-18 15:01:25,348 INFO L85 PathProgramCache]: Analyzing trace with hash -801740332, now seen corresponding path program 1 times [2024-10-18 15:01:25,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-18 15:01:25,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057041136] [2024-10-18 15:01:25,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 15:01:25,348 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-18 15:01:25,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-18 15:01:25,350 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-18 15:01:25,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-18 15:01:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-18 15:01:25,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-18 15:01:25,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-18 15:01:25,490 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-18 15:01:25,638 INFO L349 Elim1Store]: treesize reduction 70, result has 17.6 percent of original size [2024-10-18 15:01:25,639 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-18 15:01:25,698 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-18 15:01:25,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-18 15:01:25,745 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse2 (= |c_thr1Thread1of2ForFork0_push_~oldTop~0#1| (select .cse1 |c_~#top~0.offset|)))) (and (or (forall ((|thr1Thread1of2ForFork0_push_~#ret~0#1.base| (_ BitVec 32))) (not (= (_ bv0 32) (select (select (let ((.cse0 (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| |c_thr1Thread1of2ForFork0_push_#t~mem8#1|)))) (store .cse0 |thr1Thread1of2ForFork0_push_~#ret~0#1.base| (store (select .cse0 |thr1Thread1of2ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#ret~0#1.offset| (_ bv1 32)))) |c_~#top~0.base|) |c_~#top~0.offset|)))) (not .cse2)) (or .cse2 (forall ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of2ForFork0_push_~#ret~0#1.base| (_ BitVec 32))) (not (= (select (select (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_4) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32)))))))) is different from false [2024-10-18 15:01:25,763 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of2ForFork0_push_~oldTop~0#1| (select .cse2 |c_~#top~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of2ForFork0_push_~#ret~0#1.base| (_ BitVec 32))) (not (= (select (select (store |c_#memory_int| |thr1Thread1of2ForFork0_push_~#ret~0#1.base| v_DerPreprocessor_4) |c_~#top~0.base|) |c_~#top~0.offset|) (_ bv0 32))))) (or (forall ((|thr1Thread1of2ForFork0_push_~#ret~0#1.base| (_ BitVec 32))) (not (= (_ bv0 32) (select (select (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|))))) (store .cse1 |thr1Thread1of2ForFork0_push_~#ret~0#1.base| (store (select .cse1 |thr1Thread1of2ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#ret~0#1.offset| (_ bv1 32)))) |c_~#top~0.base|) |c_~#top~0.offset|)))) (not .cse0))))) is different from false [2024-10-18 15:01:25,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 15:01:25,873 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 43 treesize of output 57 [2024-10-18 15:01:25,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-18 15:01:25,892 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-18 15:01:25,939 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 73 treesize of output 61 [2024-10-18 15:01:25,945 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-18 15:01:25,953 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 32 treesize of output 24 [2024-10-18 15:01:25,993 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-18 15:01:25,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-18 15:01:25,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057041136] [2024-10-18 15:01:25,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057041136] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-18 15:01:25,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-18 15:01:25,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2024-10-18 15:01:25,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740665735] [2024-10-18 15:01:25,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-18 15:01:25,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-18 15:01:25,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-18 15:01:26,262 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-10-18 15:01:26,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 92 treesize of output 84 [2024-10-18 15:01:26,315 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-10-18 15:01:26,315 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 97 treesize of output 89 [2024-10-18 15:01:26,420 INFO L349 Elim1Store]: treesize reduction 10, result has 67.7 percent of original size [2024-10-18 15:01:26,421 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 14008 treesize of output 13350 [2024-10-18 15:01:27,728 INFO L85 PathProgramCache]: Analyzing trace with hash 722606646, now seen corresponding path program 1 times [2024-10-18 15:01:27,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-18 15:01:27,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-18 15:01:27,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-18 15:01:28,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,SelfDestructingSolverStorable0 [2024-10-18 15:01:28,030 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Const is only supported for infinite index sort at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:88) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:87) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraigSleepSetPOR.construct(IpTcStrategyModuleCraigSleepSetPOR.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraigSleepSetPOR.construct(IpTcStrategyModuleCraigSleepSetPOR.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.PostConditionTraceChecker.checkTrace(PostConditionTraceChecker.java:110) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityChecker.checkConditionalCommutativity(ConditionalCommutativityChecker.java:222) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityInterpolantChecker.checkTransitions(ConditionalCommutativityInterpolantChecker.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityInterpolantChecker.checkState(ConditionalCommutativityInterpolantChecker.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityInterpolantChecker.getInterpolants(ConditionalCommutativityInterpolantChecker.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.refineAbstraction(PartialOrderCegarLoop.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Const is only supported for infinite index sort at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.TermCompiler.convertApplicationTerm(TermCompiler.java:562) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:389) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:319) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.Clausifier.addFormula(Clausifier.java:2655) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.assertTerm(SMTInterpol.java:660) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertTerm(ManagedScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAssertCodeBlocks.annotateAndAssertTerm(AnnotateAndAssertCodeBlocks.java:193) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAssertCodeBlocks.annotateAndAssertNonCall(AnnotateAndAssertCodeBlocks.java:109) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:101) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:317) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:215) ... 32 more [2024-10-18 15:01:28,034 INFO L158 Benchmark]: Toolchain (without parser) took 10292.69ms. Allocated memory was 75.5MB in the beginning and 197.1MB in the end (delta: 121.6MB). Free memory was 39.2MB in the beginning and 81.2MB in the end (delta: -42.0MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. [2024-10-18 15:01:28,034 INFO L158 Benchmark]: CDTParser took 0.75ms. Allocated memory is still 52.4MB. Free memory is still 29.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-18 15:01:28,035 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.12ms. Allocated memory is still 75.5MB. Free memory was 39.1MB in the beginning and 33.5MB in the end (delta: 5.6MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2024-10-18 15:01:28,035 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.74ms. Allocated memory is still 75.5MB. Free memory was 33.5MB in the beginning and 31.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-18 15:01:28,035 INFO L158 Benchmark]: Boogie Preprocessor took 40.60ms. Allocated memory is still 75.5MB. Free memory was 31.0MB in the beginning and 52.6MB in the end (delta: -21.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-18 15:01:28,036 INFO L158 Benchmark]: RCFGBuilder took 513.43ms. Allocated memory is still 75.5MB. Free memory was 52.6MB in the beginning and 40.5MB in the end (delta: 12.1MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2024-10-18 15:01:28,036 INFO L158 Benchmark]: TraceAbstraction took 9282.77ms. Allocated memory was 75.5MB in the beginning and 197.1MB in the end (delta: 121.6MB). Free memory was 39.3MB in the beginning and 81.2MB in the end (delta: -41.9MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. [2024-10-18 15:01:28,039 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.75ms. Allocated memory is still 52.4MB. Free memory is still 29.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.12ms. Allocated memory is still 75.5MB. Free memory was 39.1MB in the beginning and 33.5MB in the end (delta: 5.6MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.74ms. Allocated memory is still 75.5MB. Free memory was 33.5MB in the beginning and 31.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.60ms. Allocated memory is still 75.5MB. Free memory was 31.0MB in the beginning and 52.6MB in the end (delta: -21.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 513.43ms. Allocated memory is still 75.5MB. Free memory was 52.6MB in the beginning and 40.5MB in the end (delta: 12.1MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9282.77ms. Allocated memory was 75.5MB in the beginning and 197.1MB in the end (delta: 121.6MB). Free memory was 39.3MB in the beginning and 81.2MB in the end (delta: -41.9MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 462, independent: 425, independent conditional: 164, independent unconditional: 261, dependent: 37, dependent conditional: 25, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 437, independent: 425, independent conditional: 164, independent unconditional: 261, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 437, independent: 425, independent conditional: 164, independent unconditional: 261, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 437, independent: 425, independent conditional: 164, independent unconditional: 261, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 449, independent: 425, independent conditional: 164, independent unconditional: 261, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 449, independent: 425, independent conditional: 6, independent unconditional: 419, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 449, independent: 425, independent conditional: 6, independent unconditional: 419, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 183, independent: 171, independent conditional: 0, independent unconditional: 171, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 183, independent: 165, independent conditional: 0, independent unconditional: 165, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 18, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1001, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 694, dependent conditional: 0, dependent unconditional: 694, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 449, independent: 254, independent conditional: 6, independent unconditional: 248, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 183, unknown conditional: 0, unknown unconditional: 183] , Statistics on independence cache: Total cache size (in pairs): 183, Positive cache size: 171, Positive conditional cache size: 0, Positive unconditional cache size: 171, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 158, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 449, independent: 425, independent conditional: 164, independent unconditional: 261, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 449, independent: 425, independent conditional: 6, independent unconditional: 419, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 449, independent: 425, independent conditional: 6, independent unconditional: 419, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 183, independent: 171, independent conditional: 0, independent unconditional: 171, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 183, independent: 165, independent conditional: 0, independent unconditional: 165, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 18, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1001, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 694, dependent conditional: 0, dependent unconditional: 694, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 449, independent: 254, independent conditional: 6, independent unconditional: 248, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 183, unknown conditional: 0, unknown unconditional: 183] , Statistics on independence cache: Total cache size (in pairs): 183, Positive cache size: 171, Positive conditional cache size: 0, Positive unconditional cache size: 171, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 158 ], Independence queries for same thread: 25, Persistent sets #1 benchmarks: Persistent set computation time: 1.0s, Number of persistent set computation: 55, Number of trivial persistent sets: 53, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 273, independent: 261, independent conditional: 0, independent unconditional: 261, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 462, independent: 425, independent conditional: 164, independent unconditional: 261, dependent: 37, dependent conditional: 25, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 437, independent: 425, independent conditional: 164, independent unconditional: 261, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 437, independent: 425, independent conditional: 164, independent unconditional: 261, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 437, independent: 425, independent conditional: 164, independent unconditional: 261, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 449, independent: 425, independent conditional: 164, independent unconditional: 261, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 449, independent: 425, independent conditional: 6, independent unconditional: 419, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 449, independent: 425, independent conditional: 6, independent unconditional: 419, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 183, independent: 171, independent conditional: 0, independent unconditional: 171, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 183, independent: 165, independent conditional: 0, independent unconditional: 165, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 18, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1001, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 694, dependent conditional: 0, dependent unconditional: 694, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 449, independent: 254, independent conditional: 6, independent unconditional: 248, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 183, unknown conditional: 0, unknown unconditional: 183] , Statistics on independence cache: Total cache size (in pairs): 183, Positive cache size: 171, Positive conditional cache size: 0, Positive unconditional cache size: 171, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 158, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 449, independent: 425, independent conditional: 164, independent unconditional: 261, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 449, independent: 425, independent conditional: 6, independent unconditional: 419, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 449, independent: 425, independent conditional: 6, independent unconditional: 419, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 183, independent: 171, independent conditional: 0, independent unconditional: 171, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 183, independent: 165, independent conditional: 0, independent unconditional: 165, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 18, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1001, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 694, dependent conditional: 0, dependent unconditional: 694, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 449, independent: 254, independent conditional: 6, independent unconditional: 248, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 183, unknown conditional: 0, unknown unconditional: 183] , Statistics on independence cache: Total cache size (in pairs): 183, Positive cache size: 171, Positive conditional cache size: 0, Positive unconditional cache size: 171, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 158 ], Independence queries for same thread: 25 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 164, independent: 157, independent conditional: 12, independent unconditional: 145, dependent: 7, dependent conditional: 4, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 160, independent: 157, independent conditional: 12, independent unconditional: 145, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 160, independent: 157, independent conditional: 12, independent unconditional: 145, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 160, independent: 157, independent conditional: 12, independent unconditional: 145, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 163, independent: 157, independent conditional: 12, independent unconditional: 145, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 163, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 163, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 326, independent: 119, independent conditional: 0, independent unconditional: 119, dependent: 207, dependent conditional: 0, dependent unconditional: 207, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 163, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 101, Positive conditional cache size: 0, Positive unconditional cache size: 101, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 163, independent: 157, independent conditional: 12, independent unconditional: 145, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 163, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 163, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 326, independent: 119, independent conditional: 0, independent unconditional: 119, dependent: 207, dependent conditional: 0, dependent unconditional: 207, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 163, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 101, Positive conditional cache size: 0, Positive unconditional cache size: 101, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12 ], Independence queries for same thread: 4, Persistent sets #1 benchmarks: Persistent set computation time: 0.3s, Number of persistent set computation: 10, Number of trivial persistent sets: 8, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 148, independent: 145, independent conditional: 0, independent unconditional: 145, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 164, independent: 157, independent conditional: 12, independent unconditional: 145, dependent: 7, dependent conditional: 4, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 160, independent: 157, independent conditional: 12, independent unconditional: 145, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 160, independent: 157, independent conditional: 12, independent unconditional: 145, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 160, independent: 157, independent conditional: 12, independent unconditional: 145, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 163, independent: 157, independent conditional: 12, independent unconditional: 145, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 163, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 163, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 326, independent: 119, independent conditional: 0, independent unconditional: 119, dependent: 207, dependent conditional: 0, dependent unconditional: 207, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 163, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 101, Positive conditional cache size: 0, Positive unconditional cache size: 101, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 163, independent: 157, independent conditional: 12, independent unconditional: 145, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 163, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 163, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 326, independent: 119, independent conditional: 0, independent unconditional: 119, dependent: 207, dependent conditional: 0, dependent unconditional: 207, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 163, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 101, Positive conditional cache size: 0, Positive unconditional cache size: 101, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12 ], Independence queries for same thread: 4 - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Const is only supported for infinite index sort de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Const is only supported for infinite index sort: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-18 15:01:28,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Ended with exit code 0 [2024-10-18 15:01:28,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Forceful destruction successful, exit code 0 [2024-10-18 15:01:28,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-10-18 15:01:28,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Const is only supported for infinite index sort